{"id":19424,"date":"2020-09-13T07:49:55","date_gmt":"2020-09-13T07:49:55","guid":{"rendered":"https:\/\/www.inspirenignite.com\/mh\/btexpe506c-data-structure-algorithms-using-java-programming-syllabus-for-et-5th-sem-2019-20-dbatu-elective-i-labs\/"},"modified":"2020-09-13T07:49:55","modified_gmt":"2020-09-13T07:49:55","slug":"btexpe506c-data-structure-algorithms-using-java-programming-syllabus-for-et-5th-sem-2019-20-dbatu-elective-i-labs","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/mh\/btexpe506c-data-structure-algorithms-using-java-programming-syllabus-for-et-5th-sem-2019-20-dbatu-elective-i-labs\/","title":{"rendered":"BTEXPE506C: Data Structure & Algorithms Using Java Programming Syllabus for ET 5th Sem 2019-20 DBATU (Elective-I Labs)"},"content":{"rendered":"

Data Structure & Algorithms Using Java Programming detailed syllabus scheme for Electronics & Telecommunication Engineering (ET), 2019-20 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 5th Sem Scheme of Electronics & Telecommunication Engineering (ET), 2019-20 Onwards, do visit ET 5th Sem Scheme, 2019-20 Onwards<\/a>. For the Elective-I Labs scheme of 5th Sem 2019-20 onwards, refer to ET 5th Sem Elective-I Labs Scheme 2019-20 Onwards<\/a>. The detail syllabus for data structure & algorithms using java programming is as follows.<\/p>\n

Data Structure & Algorithms Using Java Programming Syllabus for Electronics & Telecommunication Engineering (ET) 3rd Year 5th Sem 2019-20 DBATU<\/h2>\n

Data Structure & Algorithms Using Java Programming<\/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<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>To impart the basic concepts of data structures and algorithms.<\/li>\n<li>To understand concepts about searching and sorting techniques<\/li>\n<li>Describe how arrays, records, linked structures are represented in memory and use them in algorithms.<\/li>\n<li>To understand basic concepts about stacks, queues, lists trees and graphs.<\/li>\n<li>To enable them to write algorithms for solving problems with the help of fundamental data structures.<\/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> Stacks and Queues ADT Stack and its operations: Algorithms and their complexity analysis, Applications of Stacks: Expression Conversion and evaluation – corresponding algorithms and complexity analysis. ADT queue, Types of Queue: Simple Queue, Circular Queue, Priority Queue; Operations on each type of Queues: Algorithms and their analysis.<\/p>\n<h4>UNIT – 3<\/h4>\n<p> Linked Lists Singly linked lists: Representation in memory, Algorithms of several operations: Traversing, Searching, Insertion into, Deletion from linked list; Linked representation of Stack and Queue, Header nodes, doubly linked list: operations on it and algorithmic analysis; Circular Linked Lists: all operations their algorithms and the complexity analysis.<\/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> Sorting and Hashing Objective and properties of different sorting algorithms: Selection Sort, Bubble Sort, Insertion Sort, Quick Sort, Merge Sort, Heap Sort; Performance and Comparison among all the methods, Hashing.<\/p>\n<h4>UNIT – 6<\/h4>\n<p> Graph Basic Terminologies and Representations, Graph search and traversal algorithms and complexity analysis.<\/p>\n<h4>Text Books:<\/h4>\n<ol>\n<li>Algorithms, Data Structures, and Problem Solving with C++, Illustrated Edition by Mark Allen Weiss, Addison-Wesley Publishing Company<\/li>\n<li>How to Solve it by Computer, 2nd Impression by R. G. Dromey, Pearson Education.<\/li>\n<li>Ellis Horowitz, Sartaj Sahni, Fundamentals of Data Structures, Galgotia Books Source. ISBN 10: 0716782928.<\/li>\n<li>Richard F. Gilberg & 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) 5th Sem 2019-20 onwards, visit <a href=\"..\/category\/dbatu\/5th-sem-dbatu\">ET 5th Sem Subjects <\/a>of 2019-20 Onwards.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Data Structure & Algorithms Using Java Programming detailed syllabus scheme for Electronics & Telecommunication Engineering (ET), 2019-20 onwards has been taken from the DBATU official website and presented for the […]<\/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-19424","post","type-post","status-publish","format-standard","hentry","category-et-dbatu"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/posts\/19424","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=19424"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/posts\/19424\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/media?parent=19424"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/categories?post=19424"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/tags?post=19424"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}