{"id":225,"date":"2016-11-01T19:34:34","date_gmt":"2016-11-01T19:34:34","guid":{"rendered":"http:\/\/www.inspirenignite.com\/anna-university\/?p=225"},"modified":"2019-07-17T06:26:28","modified_gmt":"2019-07-17T06:26:28","slug":"anna-university-b-tech-it-r13-4th-sem-design-and-analysis-of-algorithms-detailed-syllabus","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/anna-university\/anna-university-b-tech-it-r13-4th-sem-design-and-analysis-of-algorithms-detailed-syllabus\/","title":{"rendered":"Anna University B.Tech IT (R13) 4th Sem Design and Analysis Of Algorithms Detailed Syllabus"},"content":{"rendered":"<p>Design and Analysis Of Algorithms Syllabus for B.Tech 4th sem is covered here. This gives the details about credits, number of hours and other details along with reference books for the course.<\/p>\n<p>The detailed syllabus for Design and Analysis Of Algorithms B.Tech (R13) fourthsem is as follows<\/p>\n<p><strong>OBJECTIVES:<\/strong> The student should be made to:<\/p>\n<ul>\n<li>Learn the algorithm analysis techniques.<\/li>\n<li>Become familiar with the different algorithm design techniques.<\/li>\n<li>Understand the limitations of Algorithm power.<\/li>\n<\/ul>\n<p><strong>UNIT I INTRODUCTION<\/strong> \u00a0 \u00a0 \u00a0(9 \u00a0hours)<br \/>\nNotion of an Algorithm \u2013 Fundamentals of Algorithmic Problem Solving \u2013 Important Problem Types \u2013 Fundamentals of the Analysis of Algorithm Efficiency \u2013 Analysis Framework \u2013 Asymptotic Notations and its properties \u2013 Mathematical analysis for Recursive and Non-recursive algorithms.<\/p>\n<p><strong>UNIT II BRUTE FORCE AND DIVIDE-AND-CONQUER \u00a0<\/strong> \u00a0 \u00a0 \u00a0 \u00a0\u00a0(9 \u00a0hours)<br \/>\nBrute Force &#8211; Closest-Pair and Convex-Hull Problems-Exhaustive Search &#8211; Traveling Salesman Problem &#8211; Knapsack Problem &#8211; Assignment problem. Divide and conquer methodology \u2013 Merge sort \u2013 Quick sort \u2013 Binary search \u2013 Multiplication of Large Integers \u2013 Strassen\u201fs Matrix Multiplication-Closest-Pair and Convex-Hull Problems.<\/p>\n<p><strong>UNIT III DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE \u00a0<\/strong> \u00a0 \u00a0 \u00a0\u00a0(9 \u00a0hours)<br \/>\nComputing a Binomial Coefficient \u2013 Warshall\u201fs and Floyd\u201f algorithm \u2013 Optimal Binary Search Trees \u2013 Knapsack Problem and Memory functions. Greedy Technique\u2013 Prim\u201fs algorithm- Kruskal&#8217;s Algorithm-Dijkstra&#8217;s Algorithm-Huffman Trees.<\/p>\n<p style=\"text-align: center\"><strong><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">Download iStudy<\/a> <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">Android<\/a><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\"> App for complete Anna University syllabus, results, timetables and all other updates. There are no ads and no pdfs and will make your life way easier.<\/a><\/strong><\/p>\n<p><strong>[TOTAL: 45 PERIODS]<\/strong><\/p>\n<p><strong>OUTCOMES<\/strong>: At the end of the course, the student 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><strong>TEXT BOOK:<\/strong><\/p>\n<ul>\n<li>Anany Levitin, \u201cIntroduction to the Design and Analysis of Algorithms\u201d, Third Edition, Pearson Education, 2012.<\/li>\n<\/ul>\n<p><strong>REFERENCES:<\/strong><\/p>\n<ul>\n<li>Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein, \u201cIntroduction to Algorithms\u201d, Third Edition, PHI Learning Private Limited, 2012.<\/li>\n<li>Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, \u201cData Structures and Algorithms\u201d, Pearson Education, Reprint 2006.<\/li>\n<li>Donald E. Knuth, \u201cThe Art of Computer Programming\u201d, Volumes 1&amp; 3 Pearson Education, 2009.<br \/>\nSteven S. Skiena, \u201cThe Algorithm Design Manual\u201d, Second Edition, Springer, 2008.<\/li>\n<li>http:\/\/nptel.ac.in\/<\/li>\n<\/ul>\n<p>For all other B.Tech IT 4th sem syllabus go to <a href=\"http:\/\/www.inspirenignite.com\/anna-university\/anna-university-b-tech-information-technology-4th-sem-course-structure-for-r13-batch\/\">Anna University B.Tech Information Technology (IT) 4th Sem Course Structure for (R13) Batch.<\/a>All details and yearly new syllabus will be updated here time to time.<\/p>\n<p>Do share with friends and in case of questions please feel free drop a comment.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Design and Analysis Of Algorithms Syllabus for B.Tech 4th sem is covered here. This gives the details about credits, number of hours and other details along with reference books for [&hellip;]<\/p>\n","protected":false},"author":2259,"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":[1],"tags":[],"class_list":["post-225","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/225","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\/2259"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/comments?post=225"}],"version-history":[{"count":3,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/225\/revisions"}],"predecessor-version":[{"id":10577,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/225\/revisions\/10577"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/media?parent=225"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/categories?post=225"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/tags?post=225"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}