{"id":18614,"date":"2020-09-11T15:11:48","date_gmt":"2020-09-11T15:11:48","guid":{"rendered":"https:\/\/www.inspirenignite.com\/mh\/btitc402-data-structures-and-applications-syllabus-for-it-4th-sem-2018-19-dbatu\/"},"modified":"2020-09-11T15:11:48","modified_gmt":"2020-09-11T15:11:48","slug":"btitc402-data-structures-and-applications-syllabus-for-it-4th-sem-2018-19-dbatu","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/mh\/btitc402-data-structures-and-applications-syllabus-for-it-4th-sem-2018-19-dbatu\/","title":{"rendered":"BTITC402: Data Structures and Applications Syllabus for IT 4th Sem 2018-19 DBATU"},"content":{"rendered":"

Data Structures and Applications detailed syllabus scheme for B.Tech Information Technology (IT), 2018-19 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 all other DBATU Syllabus for Information Technology 4th Sem 2018-19, do visit IT 4th Sem 2018-19 Onwards Scheme<\/a>. The detailed syllabus scheme for data structures and applications is as follows.<\/p>\n

Data Structures and Applications Syllabus for Information Technology (IT) 2nd Year 4th Sem 2018-19 DBATU<\/h2>\n

Data Structures and Applications<\/title><\/p>\n<h4>Prerequisites:<\/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<ol>\n<li>To assess how the choice of data structures and algorithm design methods affects 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 solve problems using data structures such as linear lists, stacks, queues, hash tables, binary trees, heaps, tournament trees, binary search trees, and graphs and writing programs for these solutions.<\/li>\n<li>To solve problems using algorithm design methods such as the greedy method, divide and conquer, dynamic programming, backtracking, branch and bound and writing programs for these solutions.<\/li>\n<\/ol>\n<h4>Course Outcomes:<\/h4>\n<p> After learning the course, the students should be able:<\/p>\n<ol>\n<li>To write neat code by selecting appropriate data structure and demonstrate a working solution for a given problem.<\/li>\n<li>To think of all possible inputs to an application and handle all possible errors properly.<\/li>\n<li>To analyze clearly different possible solutions to a program and select the most efficient one.<\/li>\n<li>To write an application requiring an effort of at least 1000 lines of code to demonstrate a good working solution.<\/li>\n<li>To demonstrate the ability to write reusable code and abstract data types in C, using object-based way of thinking.<\/li>\n<\/ol>\n<h4>UNIT I<\/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 II<\/h4>\n<p> Stack and Queue: Stack: Representation, Stack operation, Application. Queue: Representation, Queue operation, Circular and priority queue, Applications.<\/p>\n<h4>UNIT III<\/h4>\n<p> Linked list: Operation on linked list, Linked stacks and Queues, Array implementation of linked list, Linked list using dynamic variable, doubly linked list, Circular linked list.<\/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 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 V<\/h4>\n<p> Graphs: Basics concepts of graphs, Representation of graphs, Graph traversals BFS and DFS, Minimum spanning tree algorithms: Kruskals algorithm and Prims algorithm, Applications of graphs.<\/p>\n<h4>UNIT VI<\/h4>\n<p> Searching Techniques and Hashing: Linear search and binary search, Hashing: Direct-address tables, Hash tables, Open addressing, Perfect Hashing, Sorting techniques: Various sorting methods and their time complexity analysis: Insertion sort, Selection sort, Merge sort, Quick sort, Heap sort.<\/p>\n<h4>Text Books:<\/h4>\n<ol>\n<li>E. Horowitz, D. Mehta, S. Sahni, Fundamentals of Data Structures in C++, Silicon Press, 2nd Edition, 2008.<\/li>\n<li>R.S. Bichkar, Programming with C and Data structures, Universities Press, 1st Edition, 2014.<\/li>\n<\/ol>\n<h4>Reference Books:<\/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<p align=\"justify\">For detail syllabus of all other subjects of Information Technology (IT) 4th Sem 2018-19 regulation, visit <a href=\"..\/category\/dbatu\/4th-sem-dbatu\">IT 4th Sem Subjects<\/a> syllabus for 2018-19 regulation.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Data Structures and Applications detailed syllabus scheme for B.Tech Information Technology (IT), 2018-19 onwards has been taken from the DBATU official website and presented for the Bachelor of Technology students. […]<\/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":[96,109],"tags":[],"class_list":["post-18614","post","type-post","status-publish","format-standard","hentry","category-4th-sem-dbatu","category-it-dbatu"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/posts\/18614","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=18614"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/posts\/18614\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/media?parent=18614"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/categories?post=18614"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/tags?post=18614"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}