Data Structures and Applications detailed syllabus scheme for B.Tech Information Technology (IT), 2017 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 2017, do visit IT 4th Sem 2017 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 2017 DBATU
Course Objectives:
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 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
Introduction to Data Structures and Analysis of Algorithms: Need of data structures, Types of data structures, Recursion, ADT (Abstract Data Types), Basics of algorithm, Analysis of algorithm through time complexity and space complexity, Asymptotic notations, Pseudo code analysis, Recurrence relations and solving recurrences using substitution, Recursion tree and master method.
Unit II
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 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
Binary Tree: Basic tree concept, Binary tree operations, Binary tree representation, Binary tree traversals, Binary search tree and operations on it, Balanced tree: AVL trees and operations, Applications of binary trees, implementing priority queue using binary heap data structure.
Unit V
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 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 Book:
- Goodrich, Tamassia, Data Structures and Algorithm in Java, Wiley publication, 6th edition, 2014.
- T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, Introduction to Algorithms, MIT Press, 3rd edition, 2009.
- Y. Langsam, M. J. Augenstein and A. M. Tanenbaum, Data structures using Java, Pearson Education, 2003.
- J. Murach, Murachs Java Programming, Shroff Publishers, 4th edition, 2012.
- V. Goyal, L. Goyal, P. Kumar, A Simplified Approach to Data Structures, Shroff Publishers, 1st edition, 2014
For detail syllabus of all other subjects of Information Technology (IT) 4th Sem 2017 regulation, visit IT 4th Sem Subjects syllabus for 2017 regulation.