{"id":19191,"date":"2019-12-10T05:46:04","date_gmt":"2019-12-10T05:46:04","guid":{"rendered":"https:\/\/www.inspirenignite.com\/anna-university\/data-structures-it-3rd-sem-syllabus-for-be-2017-regulation-anna-univ\/"},"modified":"2019-12-10T05:46:04","modified_gmt":"2019-12-10T05:46:04","slug":"data-structures-it-3rd-sem-syllabus-for-be-2017-regulation-anna-univ","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/anna-university\/data-structures-it-3rd-sem-syllabus-for-be-2017-regulation-anna-univ\/","title":{"rendered":"Data Structures It 3rd Sem Syllabus for BE 2017 Regulation Anna Univ"},"content":{"rendered":"<p>Data Structures detail syllabus for Information Technology (It), 2017 regulation is taken from <a href=\"https:\/\/www.annauniv.edu\/\" target=\"_blank\" rel=\"noopener\">Anna University<\/a> official website and presented for students of Anna University. The details of the course are: course code (CS8391), Category (PC), 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 it 3rd sem syllabus for be 2017 regulation anna univ you can visit <a href=\"..\/it-3rd-sem-syllabus-for-be-2017-regulation-anna-univ\">It 3rd Sem syllabus for BE 2017 regulation Anna Univ Subjects<\/a>. The detail syllabus for data structures is as follows.&#8221;<\/p>\n<p><h4>Course Objective:<\/h4>\n<ul>\n<li>To understand the concepts of ADTs<\/li>\n<li>To Learn linear data structures &#8211; lists, stacks, and queues<\/li>\n<li>To understand sorting, searching and hashing algorithms<\/li>\n<li>To apply Tree and Graph structures<\/li>\n<\/ul>\n<p><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<p><h4>Unit II<\/h4>\n<p><strong> Linear Data Structures &#8211; Stacks, Queues<\/strong><br \/>\nStack ADT &#8211; Operations &#8211; Applications &#8211; Evaluating arithmetic expressions- Conversion of Infix to postfix expression &#8211; Queue ADT &#8211; Operations &#8211; Circular Queue &#8211; Priority Queue &#8211; deQueue -applications of queues.\n<\/p>\n<p><h4>Unit III<\/h4>\n<p><strong> Non Linear Data Structures &#8211; Trees<\/strong><br \/>\nTree ADT &#8211; tree traversals &#8211; Binary Tree ADT &#8211; expression trees &#8211; applications of trees &#8211; binary search tree ADT -Threaded Binary Trees- AVL Trees &#8211; B-Tree &#8211; B+ Tree &#8211; Heap &#8211; Applications of heap.\n<\/p>\n<p><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<p><h4>Unit V<\/h4>\n<p><strong> Searching, Sorting and Hashing Techniques<\/strong><br \/>\nSearching- Linear Search &#8211; Binary Search. Sorting &#8211; Bubble sort &#8211; Selection sort &#8211; Insertion sort &#8211; Shell sort &#8211; Radix sort. Hashing- Hash Functions &#8211; Separate Chaining &#8211; Open Addressing &#8211; Rehashing -Extendible Hashing.\n<\/p>\n<p><h4>Course Outcome:<\/h4>\n<p>At the end of the course, the student should be able to:<\/p>\n<ul>\n<li>Implement abstract data types for linear data structures.<\/li>\n<li>Apply the different linear and non-linear data structures to problem solutions.<\/li>\n<li>Critically analyze the various sorting algorithms.<\/li>\n<\/ul>\n<p><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>Reema Thareja, Data Structures Using C, Second Edition , Oxford University Press, 2011<\/li>\n<\/ol>\n<p><h4>References:<\/h4>\n<ol>\n<li>Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, Introduction to Algorithms&#8221;, Second Edition, Mcgraw Hill, 2002.<\/li>\n<li>Aho, Hopcroft and Ullman, Data Structures and Algorithms, Pearson Education,1983.<\/li>\n<li>Stephen G. Kochan, Programming in C, 3rd edition, Pearson Education.<\/li>\n<li>Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed, Fundamentals of Data Structures in C, Second Edition, University Press, 2008<\/li>\n<\/li>\n<\/ol>\n<p>For detail syllabus of all other subjects of BE It, 2017 regulation do visit <a href=\"..\/category\/it+3rd-sem\">It 3rd 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 detail syllabus for Information Technology (It), 2017 regulation is taken from Anna University official website and presented for students of Anna University. The details of the course are: [&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":[46,72],"tags":[],"class_list":["post-19191","post","type-post","status-publish","format-standard","hentry","category-3rd-sem","category-it"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/19191","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=19191"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/19191\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/media?parent=19191"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/categories?post=19191"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/tags?post=19191"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}