{"id":34762,"date":"2021-05-22T13:19:15","date_gmt":"2021-05-22T13:19:15","guid":{"rendered":"https:\/\/www.inspirenignite.com\/anna-university\/ocs751-data-structures-and-algorithms-syllabus-for-production-7th-sem-2019-regulation-anna-university-open-elective-ii\/"},"modified":"2021-05-22T13:19:15","modified_gmt":"2021-05-22T13:19:15","slug":"ocs751-data-structures-and-algorithms-syllabus-for-production-7th-sem-2019-regulation-anna-university-open-elective-ii","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/anna-university\/ocs751-data-structures-and-algorithms-syllabus-for-production-7th-sem-2019-regulation-anna-university-open-elective-ii\/","title":{"rendered":"OCS751: Data Structures and Algorithms Syllabus for Production 7th Sem 2019 Regulation Anna University (Open Elective-II)"},"content":{"rendered":"

Data Structures and Algorithms detailed syllabus for Production Engineering (Production) for 2019 regulation curriculum has been taken from the Anna Universities<\/a> official website and presented for the Production 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 Production Engineering 7th Sem scheme and its subjects, do visit Production 7th Sem 2019 regulation scheme<\/a>. For Open Elective-II scheme and its subjects refer to Production Open Elective-II syllabus scheme<\/a>. The detailed syllabus of data structures and algorithms is as follows. <\/p>\n

Data Structures and 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<p><strong>Algorithm Analysis, List Adt<\/strong><br \/>\n Algorithms: Notation – analysis – running time calculations. Abstract Data Types (ADTs): List ADT – array-based implementation – linked list implementation – singly linked lists- applications of lists: Polynomial Manipulation. Implementation of List ADT using an array and using a linked list in C.<\/p>\n<\/p>\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<p><strong>Searching and Sorting Algorithms<\/strong><br \/>\n Divide and conquer methodology – Searching: Linear Search – Binary Search. Sorting: Insertion sort – Merge sort – Quick sort – Heap sort. Analysis of searching and sorting techniques. Implementation of linear search, binary search, insertion sort, merge sort and quick sort algorithms in C.<\/p>\n<\/p>\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<p><strong>Graphs<\/strong><br \/>\n Definition – Representation of Graph – Breadth-first traversal – Depth-first traversal – Dynamic programming Technique – Warshalls and Floyds algorithm – Greedy method – Dijkstras algorithm – applications of graphs. Implementation of graph, graph traversal methods, finding shortest path using Dijkstras algorithm in C<\/p>\n<\/p>\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>Mark Allen Weiss, Data Structures and Algorithm Analysis in C, 2nd Edition, Pearson Education,1997.<\/li>\n<li>Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, 2nd Edition, Pearson Education, 1988.<\/li>\n<\/ol>\n<h4>References:<\/h4>\n<p align=\"justify\">\n<ol>\n<li>Aho, Hopcroft and Ullman, Data Structures and Algorithms, Pearson Education,1983.<\/li>\n<li>S.Sridhar, Design and Analysis of Algorithms, First Edition, Oxford University Press. 2014<\/li>\n<li>Byron Gottfried, Jitender Chhabra, Programming with C (Schaums Outlines Series), Mcgraw Hill Higher Ed., III Edition, 2010<\/li>\n<li>Yashvant Kanetkar, Data Structures Through C, BPB publications, II edition, 2003<\/li>\n<\/ol>\n<p align=\"justify\">For detailed syllabus of all the other subjects of Production Engineering 7th Sem, visit <a class=\"rank-math-link\" href=\"..\/category\/production+7th-sem\">Production 7th Sem subject syllabuses for 2019 regulation<\/a>. <\/p>\n<p align=\"justify\">For all Production Engineering results, visit <a class=\"rank-math-link\" href=\"https:\/\/www.inspirenignite.com\/anna-university\/anna-university-results\/\">Anna University Production all semester results<\/a> direct link. <\/p>\n","protected":false},"excerpt":{"rendered":"<p>Data Structures and Algorithms detailed syllabus for Production Engineering (Production) for 2019 regulation curriculum has been taken from the Anna Universities official website and presented for the Production students. 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":[63],"tags":[],"class_list":["post-34762","post","type-post","status-publish","format-standard","hentry","category-production"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/34762","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=34762"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/34762\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/media?parent=34762"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/categories?post=34762"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/tags?post=34762"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}