{"id":18624,"date":"2020-09-11T15:11:53","date_gmt":"2020-09-11T15:11:53","guid":{"rendered":"https:\/\/www.inspirenignite.com\/mh\/btitc502-design-and-analysis-of-algorithms-syllabus-for-it-5th-sem-2019-20-dbatu\/"},"modified":"2020-09-11T15:11:53","modified_gmt":"2020-09-11T15:11:53","slug":"btitc502-design-and-analysis-of-algorithms-syllabus-for-it-5th-sem-2019-20-dbatu","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/mh\/btitc502-design-and-analysis-of-algorithms-syllabus-for-it-5th-sem-2019-20-dbatu\/","title":{"rendered":"BTITC502: Design and Analysis of Algorithms Syllabus for IT 5th Sem 2019-20 DBATU"},"content":{"rendered":"

Design and Analysis of Algorithms detailed syllabus scheme for B.Tech Information Technology (IT), 2019-20 onwards has been taken from the DBATU<\/a> official website and presented for the Bachelor of Technology students. For Subject Code, Course Title, Lecutres, Tutorials, Practice, Credits, and other information, do visit full semester subjects post given below. <\/p>\n

For all other DBATU Syllabus for Information Technology 5th Sem 2019-20, do visit IT 5th Sem 2019-20 Onwards Scheme<\/a>. The detailed syllabus scheme for design and analysis of algorithms is as follows.<\/p>\n

Design and Analysis of Algorithms Syllabus for Information Technology (IT) 3rd Year 5th Sem 2019-20 DBATU<\/h2>\n

Design and Analysis of Algorithms<\/title><\/p>\n<h4>Course Objectives:<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">iStudy App<\/a><br \/><b> It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.<\/b><br \/><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&pcampaignid=pcampaignidMKT-Other-global-all-co-prtnr-py-PartBadge-Mar2515-1\" target=\"_blank\" rel=\"noopener\"><img decoding=\"async\" src=\"https:\/\/play.google.com\/intl\/en_us\/badges\/static\/images\/badges\/en_badge_web_generic.png\" alt=\"Get it on Google Play\" style=\"height:65px\"><\/a>. <\/p>\n<h4>Course Outcomes:<\/h4>\n<p> After learning the course the students should be able:<\/p>\n<ol>\n<li>Develop efficient algorithms for simple computational tasks.<\/li>\n<li>Gain understanding of concepts of time and space complexity, worst case, average case and best case complexities and the big-O notation.<\/li>\n<li>Design standard algorithms such as sorting, searching, and problems involving graphs.<\/li>\n<li>Compute complexity measures of algorithms, including recursive algorithms using recurrence relations.<\/li>\n<\/ol>\n<h4>UNIT I<\/h4>\n<p> Introduction: Instruction counts, Growth functions, Necessity of time and space analysis of algorithms, Order notations (O, 0, Q notations), Problem instance size, frequently occurring recurrence relations in analysis of algorithms.<\/p>\n<h4>UNIT II<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">iStudy App<\/a><br \/><b> It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.<\/b><br \/><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&pcampaignid=pcampaignidMKT-Other-global-all-co-prtnr-py-PartBadge-Mar2515-1\" target=\"_blank\" rel=\"noopener\"><img decoding=\"async\" src=\"https:\/\/play.google.com\/intl\/en_us\/badges\/static\/images\/badges\/en_badge_web_generic.png\" alt=\"Get it on Google Play\" style=\"height:65px\"><\/a>. <\/p>\n<h4>UNIT III<\/h4>\n<p> Design Techniques-II: Dynamic Programming: Multistage graphs, All pairs shortest paths, 0\/1 Knapsack, Travelling salesman problem.<\/p>\n<h4>UNIT IV<\/h4>\n<p> Design Techniques: Backtracking: 8-Queens Problems, Sum of subsets, Graph coloring. Branch-and-bound: Least cost (LC) search, Control abstractions for LC search, FIFO branch and bound, LC branch and bound.<\/p>\n<h4>UNIT V<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">iStudy App<\/a><br \/><b> It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.<\/b><br \/><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&pcampaignid=pcampaignidMKT-Other-global-all-co-prtnr-py-PartBadge-Mar2515-1\" target=\"_blank\" rel=\"noopener\"><img decoding=\"async\" src=\"https:\/\/play.google.com\/intl\/en_us\/badges\/static\/images\/badges\/en_badge_web_generic.png\" alt=\"Get it on Google Play\" style=\"height:65px\"><\/a>. <\/p>\n<h4>UNIT VI<\/h4>\n<p> Complexity Theory: Lower-bound arguments, NP-completeness: Introduction to NP-Complete, Reducibility (SAT, Independent Set, 3VC, Subset Sum and Partition, Hamiltonian Circuit).<\/p>\n<h4>Text Books:<\/h4>\n<ol>\n<li>Thomas Cormen, Charles Leiserson, Ronald Rivest and Cliford Stein, Introduction to Algorithms, MIT Press, 3rd Edition, 2009.<\/li>\n<li>E. Horowitz, S. Sahni and S. Rajsekaran, ComputerAlgorithms, Silicon Press, 2nd Edition, 2008.<\/li>\n<\/ol>\n<h4>Reference Books:<\/h4>\n<ol>\n<li>B. K. Joshi, Data Structures and Algorithms in C++, Tata McGraw Hill Education, 2010.<\/li>\n<li>G. T. Heineman, Gary Pollice, Stanley Selkow, Algorithms in a Nutshell, Shroff Publication, 1st Edition, 2008.<\/li>\n<li>Kyle Loudon, Mastering Algorithms with C, Shroff Publication, 1st Edition, 2008.<\/li>\n<\/ol>\n<p align=\"justify\">For detail syllabus of all other subjects of Information Technology (IT) 5th Sem 2019-20 regulation, visit <a href=\"..\/category\/dbatu\/5th-sem-dbatu\">IT 5th Sem Subjects<\/a> syllabus for 2019-20 regulation.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Design and Analysis of Algorithms detailed syllabus scheme for B.Tech Information Technology (IT), 2019-20 onwards has been taken from the DBATU official website and presented for the Bachelor of Technology […]<\/p>\n","protected":false},"author":2351,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_bbp_topic_count":0,"_bbp_reply_count":0,"_bbp_total_topic_count":0,"_bbp_total_reply_count":0,"_bbp_voice_count":0,"_bbp_anonymous_reply_count":0,"_bbp_topic_count_hidden":0,"_bbp_reply_count_hidden":0,"_bbp_forum_subforum_count":0,"footnotes":""},"categories":[97,109],"tags":[],"class_list":["post-18624","post","type-post","status-publish","format-standard","hentry","category-5th-sem-dbatu","category-it-dbatu"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/posts\/18624","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/users\/2351"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/comments?post=18624"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/posts\/18624\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/media?parent=18624"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/categories?post=18624"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/tags?post=18624"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}