{"id":50600,"date":"2023-03-22T07:13:19","date_gmt":"2023-03-22T07:13:19","guid":{"rendered":"https:\/\/www.inspirenignite.com\/anna-university\/ad3351-design-and-analysis-of-algorithms-syllabus-for-aids-2021-regulation\/"},"modified":"2023-03-22T07:13:19","modified_gmt":"2023-03-22T07:13:19","slug":"ad3351-design-and-analysis-of-algorithms-syllabus-for-aids-2021-regulation","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/anna-university\/ad3351-design-and-analysis-of-algorithms-syllabus-for-aids-2021-regulation\/","title":{"rendered":"AD3351: Design and Analysis of Algorithms syllabus for AI&DS 2021 regulation"},"content":{"rendered":"

Design and Analysis of Algorithms detailed syllabus for Artificial Intelligence & Data Science (AI&DS) for 2021 regulation curriculum has been taken from the Anna University<\/a> official website and presented for the AI&DS students. For course code, course name, number of credits for a course and other scheme related information, do visit full semester subjects post given below. <\/p>\n

For Artificial Intelligence & Data Science 3rd Sem scheme and its subjects, do visit AI&DS 3rd Sem 2021 regulation scheme<\/a>. The detailed syllabus of design and analysis of algorithms is as follows. <\/p>\n

Design and Analysis of Algorithms<\/title><\/p>\n<h4>Course Objectives:<\/h4>\n<h4 id=\"istudy\" style=\"text-align:center\"><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" style=\"color: inherit\" target=\"_blank\" rel=\"noopener\">Download the iStudy App for all syllabus and other updates.<\/a><br \/><a class=\"rank-math-link\" 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;text-align:center\"><\/a><\/h4>\n<h4>Unit I<\/h4>\n<p> <strong>INTRODUCTION 8<\/strong> Notion of an Algorithm – Fundamentals of Algorithmic Problem Solving – Important Problem Types -Fundamentals of the Analysis of Algorithm Efficiency – Analysis Framework – Asymptotic Notations and their properties – Empirical analysis – Mathematical analysis of Recursive and Non-recursive algorithms – Visualization.<\/p>\n<h4>Unit II<\/h4>\n<h4 id=\"istudy\" style=\"text-align:center\"><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" style=\"color: inherit\" target=\"_blank\" rel=\"noopener\">Download the iStudy App for all syllabus and other updates.<\/a><br \/><a class=\"rank-math-link\" 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;text-align:center\"><\/a><\/h4>\n<h4>Unit III<\/h4>\n<p> <strong>DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE 10<\/strong> Dynamic programming – Principle of optimality – Coin changing problem – Warshalls and Floyds algorithms – Optimal Binary Search Trees – Multi stage graph – Knapsack Problem and Memory functions. Greedy Technique – Dijkstras algorithm – Huffman Trees and codes – 0\/1 Knapsack problem.<\/p>\n<h4>Unit IV<\/h4>\n<h4 id=\"istudy\" style=\"text-align:center\"><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" style=\"color: inherit\" target=\"_blank\" rel=\"noopener\">Download the iStudy App for all syllabus and other updates.<\/a><br \/><a class=\"rank-math-link\" 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;text-align:center\"><\/a><\/h4>\n<h4>Unit V<\/h4>\n<p> <strong>LIMITATIONS OF ALGORITHM POWER 9<\/strong> Lower – Bound Arguments – P, NP, NP- Complete and NP Hard Problems. Backtracking – N-Queen problem – Hamiltonian Circuit Problem – Subset Sum Problem. Branch and Bound – LIFO Search and FIFO search – Assignment problem – Knapsack Problem – Traveling Salesman Problem -Approximation Algorithms for NP-Hard Problems – Traveling Salesman problem – Knapsack problem.<\/p>\n<h4>Practical Exercises:<\/h4>\n<h4 id=\"istudy\" style=\"text-align:center\"><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" style=\"color: inherit\" target=\"_blank\" rel=\"noopener\">Download the iStudy App for all syllabus and other updates.<\/a><br \/><a class=\"rank-math-link\" 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;text-align:center\"><\/a><\/h4>\n<h4>Course Outcomes:<\/h4>\n<p> At the end of this course, the students will be able to:<\/p>\n<ol>\n<li>Analyze the efficiency of recursive and non-recursive algorithms mathematically<\/li>\n<li>Analyze the efficiency of brute force, divide and conquer, decrease and conquer, Transform and conquer algorithmic techniques<\/li>\n<li>Implement and analyze the problems using dynamic programming and greedy algorithmic techniques.<\/li>\n<li>Solve the problems using iterative improvement techniques for optimization.<\/li>\n<li>Compute the limitations of algorithmic power and solve the problems using backtracking and branch and bound techniques.<\/li>\n<\/ol>\n<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<\/ol>\n<h4>Reference Books:<\/h4>\n<h4 id=\"istudy\" style=\"text-align:center\"><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" style=\"color: inherit\" target=\"_blank\" rel=\"noopener\">Download the iStudy App for all syllabus and other updates.<\/a><br \/><a class=\"rank-math-link\" 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;text-align:center\"><\/a><\/h4>\n<p align=\"justify\">For detailed syllabus of all other subjects of Artificial Intelligence & Data Science, 2021 regulation curriculum do visit <a class=\"rank-math-link\" href=\"..\/category\/ai-ds+3rd-sem\">AI&DS 3rd Sem subject syllabuses for 2021 regulation<\/a>. <\/p>\n<p align=\"justify\">For all Artificial Intelligence & Data Science results, visit <a class=\"rank-math-link\" href=\"https:\/\/www.inspirenignite.com\/anna-university\/anna-university-results\/\">Anna University AI&DS all semester results<\/a> direct link. <\/p>\n","protected":false},"excerpt":{"rendered":"<p>Design and Analysis of Algorithms detailed syllabus for Artificial Intelligence & Data Science (AI&DS) for 2021 regulation curriculum has been taken from the Anna University official website and presented for […]<\/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":[46,144],"tags":[],"class_list":["post-50600","post","type-post","status-publish","format-standard","hentry","category-3rd-sem","category-aids"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/50600","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=50600"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/50600\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/media?parent=50600"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/categories?post=50600"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/tags?post=50600"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}