{"id":17541,"date":"2020-09-09T11:13:36","date_gmt":"2020-09-09T11:13:36","guid":{"rendered":"https:\/\/www.inspirenignite.com\/mh\/ec-35-a-data-structure-syllabus-for-et-6th-sem-2017-dbatu-elective-vii\/"},"modified":"2020-09-09T11:13:36","modified_gmt":"2020-09-09T11:13:36","slug":"ec-35-a-data-structure-syllabus-for-et-6th-sem-2017-dbatu-elective-vii","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/mh\/ec-35-a-data-structure-syllabus-for-et-6th-sem-2017-dbatu-elective-vii\/","title":{"rendered":"EC 35 A: Data Structure Syllabus for ET 6th Sem 2017 DBATU (Elective-VII)"},"content":{"rendered":"

Data Structure detailed syllabus scheme for Electronics & Telecommunication Engineering (ET), 2017 onwards has been taken from the DBATU<\/a> official website and presented for the Bachelor of Technology students. For Subject Code, Course Title, Lecutres, Tutorials, Practice, Credits, and other information, do visit full semester subjects post given below. <\/p>\n

For 6th Sem Scheme of Electronics & Telecommunication Engineering (ET), 2017 Onwards, do visit ET 6th Sem Scheme, 2017 Onwards<\/a>. For the Elective-VII scheme of 6th Sem 2017 onwards, refer to ET 6th Sem Elective-VII Scheme 2017 Onwards<\/a>. The detail syllabus for data structure is as follows.<\/p>\n

Data Structure Syllabus for Electronics & Telecommunication Engineering (ET) 3rd Year 6th Sem 2017 DBATU<\/h2>\n

Data Structure<\/title><\/p>\n<h4>Pre-requisite:<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a 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 pdf platform to make students’s lives easier.<\/b><br \/><a 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>Course Objectives:<\/h4>\n<ul>\n<li>To assess how the choice of data structures and algorithm design methods impacts the performance of programs.<\/li>\n<li>To choose the appropriate data structure and algorithm design method for a specified application.<\/li>\n<li>To study the systematic way of solving problems, various methods of organizing large amounts of data.<\/li>\n<li>To solve problems using data structures such as linear lists, stacks, queues, binary trees, binary search trees, and graphs and writing programs for these solutions.<\/li>\n<li>To employ the different data structures to find the solutions for specific problems<\/li>\n<\/ul>\n<h4>Course Outcomes:<\/h4>\n<p> On completion of the course, student will be able to:<\/p>\n<ol>\n<li>Discuss the computational efficiency of the principal algorithms such as sorting andsearching.<\/li>\n<li>Write and understand the programs that use arrays and pointers in C.<\/li>\n<li>Describe how arrays, records, linked structures are represented in memory and use them in algorithms.<\/li>\n<li>Implement stacks and queues for various applications.<\/li>\n<li>Understand various terminologies and traversals of trees and use them for various applications.<\/li>\n<li>Understand various terminologies and traversals of graphs and use them for various applications.<\/li>\n<\/ol>\n<h4>Unit 1<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a 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 pdf platform to make students’s lives easier.<\/b><br \/><a 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 2<\/h4>\n<p> <strong>Searching and Sorting<\/strong><br \/>\n Need of searching and sorting, why various methods of searching and sorting, Sorting methods: Linear, binary search and Fibonacci Search. Sorting methods: Bubble, insertion, selection, merge, Time complexity of each searching and sorting algorithm, Hashing Techniques.<\/p>\n<h4>Unit 3<\/h4>\n<p> <strong>Stack and Queues<\/strong><br \/>\n Stacks: Concept, Basic Stack operations, Array representation of stacks, Stack as ADT, Stack Applications: Reversing data, Arithmetic expressions conversion and evaluation. Queues: Concept, Queue operations, Array representation of queues, Queue as ADT, Circular queues, Application of queues: Categorizing data, Simulation of queues.<\/p>\n<h4>Unit 4<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a 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 pdf platform to make students’s lives easier.<\/b><br \/><a 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 5<\/h4>\n<p> <strong>Trees<\/strong><br \/>\n Introduction to trees: Basic Tree Concepts, Binary Trees: Concept and Terminologies, Representation of Binary Tree in memory, Traversing a binary tree, Binary Search Trees (BST): Basic Concepts, BST operations.<\/p>\n<h4>Unit 6<\/h4>\n<p> <strong>Graphs<\/strong><br \/>\n Basic Concepts and terminology, Sequential representation of graphs; Adjacency matrix, Path matrix, Linked representation of a graph, Operations on graph, Traversing a graph, Spanning trees; Minimum Spanning tree, Kruskals Algorithm, Prims Algorithm. Dijkstra’s Shortest Path Algorithm.<\/p>\n<h4>Reference\/Text Book:<\/h4>\n<ol>\n<li>Ellis Horowitz, Sartaj Sahni, Fundamentals of Data Structures, Galgotia Books Source. ISBN 10: 0716782928.<\/li>\n<li>Richard F. Gilberg and Behrouz A. Forouzan, Data Structures A Pseudocode Approach with C, Cengage Learning, second edition. ISBN-10: 0534390803.<\/li>\n<li>Seymour Lipschutz, Data Structure with C, Schaums Outlines, Tata Mc Graw Hill. ISBN-10: 1259029964.<\/li>\n<li>E Balgurusamy – Programming in ANSI C, Tata McGraw-Hill, Third Edition. ISBN-10: 1259004619.<\/li>\n<li>Yedidyah Langsam, Moshe J Augenstein, Aaron M Tenenbaum – Data structures using C and C++ – PHI Publications, Second Edition) ISBN 10: 8120311779.<\/li>\n<\/ol>\n<p align=\"justify\">For detail syllabus of all subjects of Electronics & Telecommunication Engineering (ET) 6th Sem 2017 onwards, visit <a href=\"..\/category\/dbatu\/6th-sem-dbatu\">ET 6th Sem Subjects <\/a>of 2017 Onwards.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Data Structure detailed syllabus scheme for Electronics & Telecommunication Engineering (ET), 2017 onwards has been taken from the DBATU official website and presented for the Bachelor of Technology students. For […]<\/p>\n","protected":false},"author":2351,"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":[108],"tags":[],"class_list":["post-17541","post","type-post","status-publish","format-standard","hentry","category-et-dbatu"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/posts\/17541","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/users\/2351"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/comments?post=17541"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/posts\/17541\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/media?parent=17541"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/categories?post=17541"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/tags?post=17541"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}