{"id":33049,"date":"2021-05-21T08:08:57","date_gmt":"2021-05-21T08:08:57","guid":{"rendered":"https:\/\/www.inspirenignite.com\/anna-university\/it5402-design-and-analysis-of-algorithms-syllabus-for-it-4th-sem-2019-regulation-anna-university\/"},"modified":"2021-05-21T08:08:57","modified_gmt":"2021-05-21T08:08:57","slug":"it5402-design-and-analysis-of-algorithms-syllabus-for-it-4th-sem-2019-regulation-anna-university","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/anna-university\/it5402-design-and-analysis-of-algorithms-syllabus-for-it-4th-sem-2019-regulation-anna-university\/","title":{"rendered":"IT5402: Design and Analysis of Algorithms Syllabus for IT 4th Sem 2019 Regulation Anna University"},"content":{"rendered":"

Design and Analysis of Algorithms detailed syllabus for Information Technology (IT) for 2019 regulation curriculum has been taken from the Anna Universities<\/a> official website and presented for the IT 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 Information Technology 4th Sem scheme and its subjects, do visit IT 4th Sem 2019 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 Objective:<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a class=\"rank-math-link\" 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 pdfs platform to make students’s lives easier.<\/b><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\"><\/a>. <\/p>\n<h4>Unit I<\/h4>\n<p align=\"justify\">\n <strong>Fundamentals<\/strong><br \/>\n The Role of Algorithms in Computing – Algorithms – Designing Algorithms – Analysing Algorithms – Iterative Algorithms – Step Count – Operation Count – Recursive Algorithms – Recurrence Equations – Substitution Method – Recursion Tree Method – Master Theorem -Proof – Asymptotic Notations – Growth of Functions.<\/p>\n<p><i>Suggested Activities:<\/i>\n <\/p>\n<ul>\n<li>Discussion on role of algorithms in computer science.<\/li>\n<li>External learning – Design of simple problems, sample problems in Hackerrank, like, diagonal difference in matrices, staircase construction.<\/li>\n<li>Computation of step count and operation count for merge sort and Quicksort.<\/li>\n<li>Design of induction proofs for algorithm verification for recursive algorithms.<\/li>\n<li>Practical – Implementation of time complexity in Python.<\/li>\n<\/ul>\n<p><i>Suggested Evaluation Methods:<\/i>\n <\/p>\n<ul>\n<li>Tutorials on operation count and step count for iterative algorithms such as linear search and array sum.<\/li>\n<li>Assignments on recursive algorithm analysis and Master Theorem.<\/li>\n<li>Quizzes on algorithm writing.<\/li>\n<\/ul>\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 class=\"rank-math-link\" 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 pdfs platform to make students’s lives easier.<\/b><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\"><\/a>. <\/p>\n<h4>Unit III<\/h4>\n<p align=\"justify\">\n <strong>Greedy Approach and Matrix Operations<\/strong><br \/>\n Elements of The Greedy Strategy – Huffman Code – Task Scheduling Problem – Activity Selection – Set Cover and Vertex Cover – Transform and Conquer Approach – Matrix Operations – Solving Systems of Linear Equations – LUP Decomposition – Matrix Inverse and Determinant of a Matrix.<\/p>\n<p><i>Suggested Activities:<\/i>\n <\/p>\n<ul>\n<li>Flipped classroom on algorithm design.<\/li>\n<li>External learning – Greedy approach based algorithms like set cover and vertex. cover – Hackerrank problems like Password cracker.<\/li>\n<li>Computation of step count and operation count of Huffman code.<\/li>\n<li>Design of greedy based proofs for set cover problems.<\/li>\n<li>Practical – Implementation of matrix inverse using Gaussian Elimination problem.<\/li>\n<\/ul>\n<p><i>Suggested Evaluation Methods:<\/i>\n <\/p>\n<ul>\n<li>Tutorial on Huffman code and task scheduling.<\/li>\n<li>Assignments on LUP Decomposition and Matrix Inverse using matrix decomposition.<\/li>\n<li>Quizzes on greedy approach.<\/li>\n<\/ul>\n<h4>Unit IV<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a class=\"rank-math-link\" 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 pdfs platform to make students’s lives easier.<\/b><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\"><\/a>. <\/p>\n<h4>Unit V<\/h4>\n<p align=\"justify\">\n <strong>Computational Complexity<\/strong><br \/>\n Understanding of Computational Complexity – NP-Hard – NP-Completeness – Reducibility -Cook”s Theorem – NP-Completeness Proofs – Probabilistic Analysis and Randomized Algorithms – Quicksort – Approximation Algorithms – Set Cover and Vertex Cover.<\/p>\n<p><i>Suggested Activities:<\/i>\n <\/p>\n<ul>\n<li>Flipped classroom on computational complexity.<\/li>\n<li>External learning – NP complexity, Turing machines.<\/li>\n<li>Computation and derivation of exponential complexity for set cover and vertex cover problems.<\/li>\n<li>Design of approximation bounds for randomized quicksort.<\/li>\n<li>Practical – Implementation of approximation algorithm for set cover problem.<\/li>\n<\/ul>\n<p><i>Suggested Evaluation Methods:<\/i>\n <\/p>\n<ul>\n<li>Tutorials on NP-complete proofs such as SAT problem.<\/li>\n<li>Assignments on set cover and vertex cover approximation problems.<\/li>\n<li>Quizzes on computational complexity.<\/li>\n<\/ul>\n<h4>Course Outcome:<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a class=\"rank-math-link\" 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 pdfs platform to make students’s lives easier.<\/b><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\"><\/a>. <\/p>\n<h4>Text Books:<\/h4>\n<p align=\"justify\">\n<ol>\n<li>Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, “Introduction to Algorithms”, Third Edition, McGraw Hill, 2009.<\/li>\n<li>S. Sridhar, “Design and Analysis of Algorithms”, Oxford University Press, 2015.<\/li>\n<\/ol>\n<h4>References:<\/h4>\n<p align=\"justify\">\n<ol>\n<li>Steven S. Skiena, “The Algorithm Design Manual”, Second Edition, Springer, 2010.<\/li>\n<li>Robert Sedgewick, Kevin Wayne, “Algorithms”, Fourth Edition, Pearson Education, 2011.<\/li>\n<li>Donald E. Knuth, “Art of Computer Programming, Volume I – Fundamental Algorithms”, Third Edition, Addison Wesley, 1997.<\/li>\n<\/ol>\n<p align=\"justify\">For detailed syllabus of all other subjects of Information Technology, 2019 regulation curriculum do visit <a class=\"rank-math-link\" href=\"..\/category\/it+4th-sem\">IT 4th Sem subject syllabuses for 2019 regulation<\/a>. <\/p>\n<p align=\"justify\">For all Information Technology results, visit <a class=\"rank-math-link\" href=\"https:\/\/www.inspirenignite.com\/anna-university\/anna-university-results\/\">Anna University IT all semester results<\/a> direct link. <\/p>\n","protected":false},"excerpt":{"rendered":"<p>Design and Analysis of Algorithms detailed syllabus for Information Technology (IT) for 2019 regulation curriculum has been taken from the Anna Universities official website and presented for the IT students. […]<\/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-33049","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\/33049","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=33049"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/33049\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/media?parent=33049"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/categories?post=33049"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/tags?post=33049"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}