{"id":19202,"date":"2019-12-10T05:46:10","date_gmt":"2019-12-10T05:46:10","guid":{"rendered":"https:\/\/www.inspirenignite.com\/anna-university\/design-and-analysis-of-algorithms-it-4th-sem-syllabus-for-be-2017-regulation-anna-univ\/"},"modified":"2019-12-10T05:46:10","modified_gmt":"2019-12-10T05:46:10","slug":"design-and-analysis-of-algorithms-it-4th-sem-syllabus-for-be-2017-regulation-anna-univ","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/anna-university\/design-and-analysis-of-algorithms-it-4th-sem-syllabus-for-be-2017-regulation-anna-univ\/","title":{"rendered":"Design and Analysis of Algorithms It 4th Sem Syllabus for BE 2017 Regulation Anna Univ"},"content":{"rendered":"<p>Design and Analysis of Algorithms detail syllabus for Information Technology (It), 2017 regulation is taken from <a href=\"https:\/\/www.annauniv.edu\/\" target=\"_blank\" rel=\"noopener\">Anna University<\/a> official website and presented for students of Anna University. The details of the course are: course code (CS8451), Category (PC), Contact Periods\/week (3), Teaching hours\/week (3), Practical Hours\/week (0). The total course credits are given in combined syllabus.<\/p>\n<p>For all other it 4th sem syllabus for be 2017 regulation anna univ you can visit <a href=\"..\/it-4th-sem-syllabus-for-be-2017-regulation-anna-univ\">It 4th Sem syllabus for BE 2017 regulation Anna Univ Subjects<\/a>. The detail syllabus for design and analysis of algorithms is as follows.&#8221;<\/p>\n<p><h4>Course Objective:<\/h4>\n<ul>\n<li>To understand and apply the algorithm analysis techniques.<\/li>\n<li>To critically analyze the efficiency of alternative algorithmic solutions for the same problem<\/li>\n<li>To understand different algorithm design techniques.<\/li>\n<li>To understand the limitations of Algorithmic power.<\/li>\n<\/ul>\n<p><h4>Unit I<\/h4>\n<p>For complete syllabus and results, class timetable and more pls <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">download iStudy<\/a>. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.<\/p>\n<p><h4>Unit II<\/h4>\n<p><strong> Brute Force and Divide-And-Conquer<\/strong><br \/>\nBrute Force &#8211; Computing an &#8211; String Matching &#8211; Closest-Pair and Convex-Hull Problems &#8211; Exhaustive Search &#8211; Travelling Salesman Problem &#8211; Knapsack Problem &#8211; Assignment problem.<br \/>\nDivide and Conquer Methodology &#8211; Binary Search &#8211; Merge sort &#8211; Quick sort &#8211; Heap Sort -Multiplication of Large Integers &#8211; Closest-Pair and Convex &#8211; Hull Problems.\n<\/p>\n<p><h4>Unit III<\/h4>\n<p><strong> Dynamic Programming and Greedy Technique<\/strong><br \/>\nDynamic programming &#8211; Principle of optimality &#8211; Coin changing problem, Computing a Binomial Coefficient &#8211; Floyds algorithm &#8211; Multi stage graph &#8211; Optimal Binary Search Trees &#8211; Knapsack Problem and Memory functions.<br \/>\nGreedy Technique &#8211; Container loading problem &#8211; Prims algorithm and Kruskals Algorithm &#8211; 0\/1 Knapsack problem, Optimal Merge pattern &#8211; Huffman Trees.\n<\/p>\n<p><h4>Unit IV<\/h4>\n<p>For complete syllabus and results, class timetable and more pls <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">download iStudy<\/a>. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.<\/p>\n<p><h4>Unit V<\/h4>\n<p><strong> Coping With the Limitations of Algorithm Power<\/strong><br \/>\nLower &#8211; Bound Arguments &#8211; P, NP NP- Complete and NP Hard Problems. Backtracking &#8211; n-Queen problem &#8211; Hamiltonian Circuit Problem &#8211; Subset Sum Problem. Branch and Bound &#8211; LIFO Search and FIFO search &#8211; Assignment problem &#8211; Knapsack Problem &#8211; Travelling Salesman Problem -Approximation Algorithms for NP-Hard Problems &#8211; Travelling Salesman problem &#8211; Knapsack problem.\n<\/p>\n<p><h4>Course Outcome:<\/h4>\n<p>At the end of the course, the students should be able to:<\/p>\n<ul>\n<li>Design algorithms for various computing problems.<\/li>\n<li>Analyze the time and space complexity of algorithms.<\/li>\n<li>Critically analyze the different algorithm design techniques for a given problem.<\/li>\n<li>Modify existing algorithms to improve efficiency.<\/li>\n<\/ul>\n<p><h4>Text Books:<\/h4>\n<ol>\n<li>Anany Levitin, Introduction to the Design and Analysis of Algorithms, Third Edition, Pearson Education, 2012.<\/li>\n<li>Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Computer Algorithms\/ C++, Second Edition, Universities Press, 2007.<\/li>\n<\/ol>\n<p><h4>References:<\/h4>\n<ol>\n<li>Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to Algorithms, Third Edition, PHI Learning Private Limited, 2012.<\/li>\n<li>Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, Data Structures and Algorithms, Pearson Education, Reprint 2006.<\/li>\n<li>Harsh Bhasin, Algorithms Design and Analysis, Oxford university press, 2016.<\/li>\n<li>S. Sridhar, Design and Analysis of Algorithms, Oxford university press, 2014.<\/li>\n<li>http:\/\/nptel.ac.in\/<\/li>\n<\/li>\n<\/ol>\n<p>For detail syllabus of all other subjects of BE It, 2017 regulation do visit <a href=\"..\/category\/it+4th-sem\">It 4th Sem syllabus for 2017 Regulation<\/a>.<\/p>\n<p>Dont forget to <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">download iStudy<\/a> for latest syllabus and results, class timetable and more.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Design and Analysis of Algorithms detail syllabus for Information Technology (It), 2017 regulation is taken from Anna University official website and presented for students of Anna University. The details of [&hellip;]<\/p>\n","protected":false},"author":2297,"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":[47,72],"tags":[],"class_list":["post-19202","post","type-post","status-publish","format-standard","hentry","category-4th-sem","category-it"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/19202","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/users\/2297"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/comments?post=19202"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/19202\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/media?parent=19202"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/categories?post=19202"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/tags?post=19202"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}