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. For Subject Code, Course Title, Lecutres, Tutorials, Practice, Credits, and other information, do visit full semester subjects post given below.
For all other DBATU Syllabus for Information Technology 4th Sem 2018-19, do visit IT 4th Sem 2018-19 Onwards Scheme. The detailed syllabus scheme for data structures and applications is as follows.
Data Structures and Applications Syllabus for Information Technology (IT) 2nd Year 4th Sem 2018-19 DBATU
Prerequisites:
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.
.
Course Objectives:
- To assess how the choice of data structures and algorithm design methods affects the performance of programs.
- To choose the appropriate data structure and algorithm design method for a specified application.
- 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.
- 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.
Course Outcomes:
After learning the course, the students should be able:
- To write neat code by selecting appropriate data structure and demonstrate a working solution for a given problem.
- To think of all possible inputs to an application and handle all possible errors properly.
- To analyze clearly different possible solutions to a program and select the most efficient one.
- To write an application requiring an effort of at least 1000 lines of code to demonstrate a good working solution.
- To demonstrate the ability to write reusable code and abstract data types in C, using object-based way of thinking.
UNIT I
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier..
UNIT II
Stack and Queue: Stack: Representation, Stack operation, Application. Queue: Representation, Queue operation, Circular and priority queue, Applications.
UNIT III
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.
UNIT IV
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier..
UNIT V
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.
UNIT VI
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.
Text Books:
- E. Horowitz, D. Mehta, S. Sahni, Fundamentals of Data Structures in C++, Silicon Press, 2nd Edition, 2008.
- R.S. Bichkar, Programming with C and Data structures, Universities Press, 1st Edition, 2014.
Reference Books:
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier..
For detail syllabus of all other subjects of Information Technology (IT) 4th Sem 2018-19 regulation, visit IT 4th Sem Subjects syllabus for 2018-19 regulation.