{"id":50447,"date":"2023-03-22T06:47:03","date_gmt":"2023-03-22T06:47:03","guid":{"rendered":"https:\/\/www.inspirenignite.com\/anna-university\/cs3401-algorithms-syllabus-for-cse-2021-regulation\/"},"modified":"2023-03-22T06:47:03","modified_gmt":"2023-03-22T06:47:03","slug":"cs3401-algorithms-syllabus-for-cse-2021-regulation","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/anna-university\/cs3401-algorithms-syllabus-for-cse-2021-regulation\/","title":{"rendered":"CS3401: Algorithms syllabus for CSE 2021 regulation"},"content":{"rendered":"

Algorithms detailed syllabus for Computer Science & Engineering (CSE) for 2021 regulation curriculum has been taken from the Anna University<\/a> official website and presented for the CSE 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 Computer Science & Engineering 4th Sem scheme and its subjects, do visit CSE 4th Sem 2021 regulation scheme<\/a>. The detailed syllabus of algorithms is as follows. <\/p>\n

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 9<\/strong> Algorithm analysis: Time and space complexity – Asymptotic Notations and its properties Best case, Worst case and average case analysis – Recurrence relation: substitution method – Lower bounds -searching: linear search, binary search and Interpolation Search, Pattern search: The naive stringmatching algorithm – Rabin-Karp algorithm – Knuth-Morris-Pratt algorithm. Sorting: Insertion sort -heap sort<\/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>ALGORITHM DESIGN TECHNIQUES 9<\/strong> Divide and Conquer methodology: Finding maximum and minimum – Merge sort – Quick sort Dynamic programming: Elements of dynamic programming Matrix-chain multiplication – Multi stage graph Optimal Binary Search Trees. Greedy Technique: Elements of the greedy strategy – Activity-selection problem Optimal Merge pattern Huffman Trees.<\/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>NP-COMPLETE AND APPROXIMATION ALGORITHM 9<\/strong> Tractable and intractable problems: Polynomial time algorithms – Venn diagram representation – NP-algorithms – NP-hardness and NP-completeness – Bin Packing problem – Problem reduction: TSP – 3- CNF problem. Approximation Algorithms: TSP – Randomized Algorithms: concept and application – primality testing – randomized quick sort – Finding kth smallest number<\/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 algorithms using various frameworks<\/li>\n<li>Apply graph algorithms to solve problems and analyze their efficiency.<\/li>\n<li>Make use of algorithm design techniques like divide and conquer, dynamic programming and greedy techniques to solve problems<\/li>\n<li>Use the state space tree method for solving problems.<\/li>\n<li>Solve problems using approximation algorithms and randomized algorithms<\/li>\n<\/ol>\n<h4>Text Books:<\/h4>\n<ol>\n<li>Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to Algorithms”, 3rd Edition, Prentice Hall of India, 2009.<\/li>\n<li>Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran Computer Algorithms\/C++ Orient Blackswan, 2nd Edition, 2019.<\/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 Computer Science & Engineering, 2021 regulation curriculum do visit <a class=\"rank-math-link\" href=\"..\/category\/cse+4th-sem\">CSE 4th Sem subject syllabuses for 2021 regulation<\/a>. <\/p>\n<p align=\"justify\">For all Computer Science & Engineering results, visit <a class=\"rank-math-link\" href=\"https:\/\/www.inspirenignite.com\/anna-university\/anna-university-results\/\">Anna University CSE all semester results<\/a> direct link. <\/p>\n","protected":false},"excerpt":{"rendered":"<p>Algorithms detailed syllabus for Computer Science & Engineering (CSE) for 2021 regulation curriculum has been taken from the Anna University official website and presented for the CSE students. For course […]<\/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,69],"tags":[],"class_list":["post-50447","post","type-post","status-publish","format-standard","hentry","category-4th-sem","category-cse"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/50447","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=50447"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/50447\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/media?parent=50447"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/categories?post=50447"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/tags?post=50447"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}