{"id":50757,"date":"2023-03-22T07:15:24","date_gmt":"2023-03-22T07:15:24","guid":{"rendered":"https:\/\/www.inspirenignite.com\/anna-university\/cd3291-data-structures-and-algorithms-syllabus-for-csd-2021-regulation\/"},"modified":"2023-03-22T07:15:24","modified_gmt":"2023-03-22T07:15:24","slug":"cd3291-data-structures-and-algorithms-syllabus-for-csd-2021-regulation","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/anna-university\/cd3291-data-structures-and-algorithms-syllabus-for-csd-2021-regulation\/","title":{"rendered":"CD3291: Data Structures and Algorithms syllabus for CSD 2021 regulation"},"content":{"rendered":"

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

Data Structures and 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>ABSTRACT DATA TYPES 9<\/strong> Abstract Data Types (ADTs) – ADTs and classes – introduction to OOP – classes in Python -inheritance – namespaces – shallow and deep copying Introduction to analysis of algorithms – asymptotic notations – divide & conquer – recursion -analyzing recursive algorithms<\/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>SORTING AND SEARCHING 9<\/strong> Bubble sort – selection sort – insertion sort – merge sort – quick sort – analysis of sorting algorithms – linear search – binary search – hashing – hash functions – collision handling – load factors, rehashing, and efficiency<\/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>GRAPH STRUCTURES 9<\/strong> Graph ADT – representations of graph – graph traversals – DAG – topological ordering – greedy algorithms – dynamic programming – shortest paths – minimum spanning trees – introduction to complexity classes and intractability At the end of the course, the student should be able to:<\/p>\n<ol>\n<li>Explain abstract data types<\/li>\n<li>Design, implement, and analyze linear data structures, such as lists, queues, and stacks, according to the needs of different applications<\/li>\n<li>Design, implement, and analyze efficient tree structures to meet requirements such as searching, indexing, and sorting<\/li>\n<li>Model problems as graph problems and implement efficient graph algorithms to solve them<\/li>\n<\/ol>\n<h4>Text 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<h4>Reference Books:<\/h4>\n<ol>\n<li>Lee, Kent D., Hubbard, Steve, Data Structures and Algorithms with Python Springer Edition<\/li>\n<li>Rance D. Necaise, Data Structures and Algorithms Using Python, John Wiley & Sons, 2011<\/li>\n<li>Aho, Hopcroft, and Ullman, Data Structures and Algorithms, Pearson Education, 1983.<\/li>\n<li>Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, Introduction to Algorithms”, Second Edition, McGraw Hill, 2002.<\/li>\n<li>Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, Fourth Edition, Pearson Education, 2014<\/li>\n<\/ol>\n<p align=\"justify\">For detailed syllabus of all other subjects of Computer Science & Design, 2021 regulation curriculum do visit <a class=\"rank-math-link\" href=\"..\/category\/csd+2nd-sem\">CSD 2nd Sem subject syllabuses for 2021 regulation<\/a>. <\/p>\n<p align=\"justify\">For all Computer Science & Design results, visit <a class=\"rank-math-link\" href=\"https:\/\/www.inspirenignite.com\/anna-university\/anna-university-results\/\">Anna University CSD all semester results<\/a> direct link. <\/p>\n","protected":false},"excerpt":{"rendered":"<p>Data Structures and Algorithms detailed syllabus for Computer Science & Design (CSD) for 2021 regulation curriculum has been taken from the Anna University official website and presented for the CSD […]<\/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":[45,156],"tags":[],"class_list":["post-50757","post","type-post","status-publish","format-standard","hentry","category-2nd-sem","category-csd"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/50757","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=50757"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/50757\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/media?parent=50757"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/categories?post=50757"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/tags?post=50757"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}