{"id":31648,"date":"2021-05-19T11:56:08","date_gmt":"2021-05-19T11:56:08","guid":{"rendered":"https:\/\/www.inspirenignite.com\/anna-university\/ee5015-data-structures-and-algorithms-syllabus-for-eee-6th-sem-2019-regulation-anna-university-professional-elective-ii\/"},"modified":"2021-05-19T11:56:08","modified_gmt":"2021-05-19T11:56:08","slug":"ee5015-data-structures-and-algorithms-syllabus-for-eee-6th-sem-2019-regulation-anna-university-professional-elective-ii","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/anna-university\/ee5015-data-structures-and-algorithms-syllabus-for-eee-6th-sem-2019-regulation-anna-university-professional-elective-ii\/","title":{"rendered":"EE5015: Data Structures and Algorithms Syllabus for EEE 6th Sem 2019 Regulation Anna University (Professional Elective-II)"},"content":{"rendered":"

Data Structures and Algorithms detailed syllabus for Electrical & Electronics Engineering (EEE) for 2019 regulation curriculum has been taken from the Anna Universities<\/a> official website and presented for the EEE 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 Electrical & Electronics Engineering 6th Sem scheme and its subjects, do visit EEE 6th Sem 2019 regulation scheme<\/a>. For Professional Elective-II scheme and its subjects refer to EEE Professional 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 <strong>Intruduction and Basic Data Structures<\/strong><br \/>\n Problem Solving Techniques with Examples- Introduction to Abstract Data Types (ADT) – Elementary Data Structures: Stacks and queues and their implementation – Linked lists – Implementing pointers and objects.\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 <strong>Sorting and Hasing<\/strong><br \/>\n Sorting: Sorting by Selection – Sorting by Insertion – Sorting by Exchange – Sorting by Diminishing Increment – Heap Sort – Quick Sort. Hashing: Direct-address tables – Hash tables – Hash functions -Open addressing – Perfect hashing.\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 <strong>Graph Algorithms<\/strong><br \/>\n Elementary Graph Algorithms: Representation of Graphs – Breadth-first Search – Depth-first Search. Minimum Spanning Trees: The algorithms of Kruskal and Prim. Single-source shortest paths: The Bellman-Ford algorithm – Dijkstra”s algorithm. All pairs shortest paths: The Floyd-Warshall algorithm.\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>Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein,<\/li>\n<li>“Introduction to Algorithms”, 3rd Edition, The MIT Press Cambridge, Massachusetts London, England, 2009.<\/li>\n<li>R G Dromey, “How to solve it by computers”, 9th Impression, Pearson Education Asia, 2011.<\/li>\n<li>Mark Allen Weiss,” Data Structures and Algorithm Analysis in C++”,3rd Edition, Pearson Education, 2007.<\/li>\n<\/ol>\n<h4>References:<\/h4>\n<p align=\"justify\">\n<ol>\n<li>Alfred V Aho, John E Hopcroft and Jeffrey D Ullman, ” Data Structures and Algorithms”, Pearson Education, 4th Impression, 2009.<\/li>\n<li>Robert L Kruse, Bruce P Leung and Vlovis L Tondo, “Data Structures and Program Design in C”, 2nd Edition, Pearson Education, 2006.<\/li>\n<\/ol>\n<p align=\"justify\">For detailed syllabus of all the other subjects of Electrical & Electronics Engineering 6th Sem, visit <a class=\"rank-math-link\" href=\"..\/category\/eee+6th-sem\">EEE 6th Sem subject syllabuses for 2019 regulation<\/a>. <\/p>\n<p align=\"justify\">For all Electrical & Electronics Engineering results, visit <a class=\"rank-math-link\" href=\"https:\/\/www.inspirenignite.com\/anna-university\/anna-university-results\/\">Anna University EEE all semester results<\/a> direct link. <\/p>\n","protected":false},"excerpt":{"rendered":"<p>Data Structures and Algorithms detailed syllabus for Electrical & Electronics Engineering (EEE) for 2019 regulation curriculum has been taken from the Anna Universities official website and presented for the EEE […]<\/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":[74],"tags":[],"class_list":["post-31648","post","type-post","status-publish","format-standard","hentry","category-eee"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/31648","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=31648"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/31648\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/media?parent=31648"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/categories?post=31648"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/tags?post=31648"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}