{"id":27654,"date":"2020-07-06T06:00:51","date_gmt":"2020-07-06T06:00:51","guid":{"rendered":"https:\/\/www.inspirenignite.com\/anna-university\/data-structures-and-algorithms-etc-7th-sem-syllabus-for-be-2017-regulation-anna-univ-open-elective-ii\/"},"modified":"2020-07-06T15:49:07","modified_gmt":"2020-07-06T15:49:07","slug":"data-structures-and-algorithms-etc-7th-sem-syllabus-for-be-2017-regulation-anna-univ-open-elective-ii","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/anna-university\/data-structures-and-algorithms-etc-7th-sem-syllabus-for-be-2017-regulation-anna-univ-open-elective-ii\/","title":{"rendered":"Data Structures and Algorithms E&amp;TC 7th Sem Syllabus for BE 2017 Regulation Anna Univ (Open Elective II)"},"content":{"rendered":"<p>Data Structures and Algorithms E&amp;TC 7th Sem Syllabus for BE 2017 Regulation Anna Univ (Open Elective II) detail syllabus for Electronics &amp; Communication Engineering (E&amp;Tc), 2017 regulation is collected from the <a href=\"https:\/\/www.annauniv.edu\/\" target=\"_blank\" rel=\"noopener\">Anna Univ<\/a> official website and presented for students of Anna University. The details of the course are: course code (OCS751), Category (OE), Contact Periods\/week (3), Teaching hours\/week (3), Practical Hours\/week (0). The total course credits are given in combined syllabus.<\/p>\n<p>For all other e&amp;tc 7th sem syllabus for be 2017 regulation anna univ you can visit <a href=\"..\/etc-7th-sem-syllabus-for-be-2017-regulation-anna-univ\">E&amp;TC 7th Sem syllabus for BE 2017 regulation Anna Univ Subjects<\/a>. For all other Open Elective II subjects do refer to <a href=\"..\/open-elective-ii-etc-7th-sem-syllabus-for-be-2017-regulation-anna-univ\">Open Elective II<\/a>. The detail syllabus for data structures and algorithms is as follows.<\/p>\n<h4>Course Objective:<\/h4>\n<ul>\n<li>To understand the various algorithm design and analysis techniques<\/li>\n<li>To learn linear data structures &#8211; lists, stacks, and queues<\/li>\n<li>To learn different sorting and searching algorithms<\/li>\n<li>To understand Tree and Graph data structures<\/li>\n<\/ul>\n<h4>Unit I<\/h4>\n<p>For complete syllabus and results, class timetable and more pls <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">download iStudy<\/a>. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.<\/p>\n<h4>Unit II<\/h4>\n<p><strong> Stacks and Queues<\/strong><\/p>\n<p>Stack ADT &#8211; Applications &#8211; Evaluating arithmetic expressions- Conversion of Infix to PostfixRecursion. Queue ADT &#8211; Priority Queue &#8211; applications of queues. Implementation of Stack ADT and palindrome checking using C. Implementation of Queue operations using arrays in C.<\/p>\n<h4>Unit III<\/h4>\n<p><strong> Searching and Sorting Algorithms<\/strong><\/p>\n<p>Divide and conquer methodology &#8211; Searching: Linear Search &#8211; Binary Search. Sorting: Insertion sort &#8211; Merge sort &#8211; Quick sort &#8211; 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<h4>Unit IV<\/h4>\n<p>For complete syllabus and results, class timetable and more pls <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">download iStudy<\/a>. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.<\/p>\n<h4>Unit V<\/h4>\n<p><strong> Graphs<\/strong><\/p>\n<p>Definition &#8211; Representation of Graph &#8211; Breadth-first traversal &#8211; Depth-first traversal &#8211; Dynamic programming Technique &#8211; Warshalls and Floyds algorithm &#8211; Greedy method &#8211; Dijkstras algorithm &#8211; applications of graphs. Implementation of graph, graph traversal methods, finding shortest path using Dijkstras algorithm in C.<\/p>\n<h4>Course Outcome:<\/h4>\n<p>At the end of this course, the students should be able to:<\/p>\n<ul>\n<li>Implement linear data structures and solve problems using them.<\/li>\n<li>Implement and apply trees and graphs to solve problems.<\/li>\n<li>Implement the various searching and sorting algorithms.<\/li>\n<\/ul>\n<h4>Text Books:<\/h4>\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<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>For detail syllabus of all other subjects of BE E&amp;Tc, 2017 regulation do visit <a href=\"https:\/\/www.inspirenignite.com\/anna-university\/etc-7th-sem-syllabus-for-be-2017-regulation-anna-univ\/\">E&amp;Tc 7th Sem syllabus for 2017 Regulation<\/a>.<\/p>\n<p>Dont forget to <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">download iStudy<\/a> for latest syllabus and results, class timetable and more.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Data Structures and Algorithms E&amp;TC 7th Sem Syllabus for BE 2017 Regulation Anna Univ (Open Elective II) detail syllabus for Electronics &amp; Communication Engineering (E&amp;Tc), 2017 regulation is collected from [&hellip;]<\/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":[50,70],"tags":[],"class_list":["post-27654","post","type-post","status-publish","format-standard","hentry","category-7th-sem","category-etc"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/27654","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=27654"}],"version-history":[{"count":2,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/27654\/revisions"}],"predecessor-version":[{"id":27752,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/27654\/revisions\/27752"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/media?parent=27654"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/categories?post=27654"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/tags?post=27654"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}