Data Structures detailed syllabus scheme for B.Tech Computer Engineering (CE), 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 Computer Engineering 3rd Sem 2018-19, do visit CE 3rd Sem 2018-19 Onwards Scheme. The detailed syllabus scheme for data structures is as follows.
Data Structures Syllabus for Computer Engineering (CE) 2nd Year 3rd Sem 2018-19 DBATU
Unit 1
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 2
Arrays and Hash Tables: Concept of sequential organization, linear and non-linear data structure, storage representation, array processing sparse matrices, transpose of sparse matrices. Hash Tables, Direct address tables, Hash tables, Hash functions, Open addressing, Perfect hashing.
Unit 3
Searching and Sorting: Sequential, binary searching, skip lists – dictionaries, linear list representation, skip list representation, operations – insertion, deletion and searching. Insertion sort, selection sort, radix sort, File handling.
Unit 4
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 5
Stacks and Queues: Introduction, stack and queue as ADT, representation and implementation of stack and queue using sequential and linked allocation, Circular queue and its implementation, Application of stack for expression evaluation and expression conversion, recursion, priority queue.
Unit 6
Trees and Graphs: Basic terminology, binary trees and its representation, insertion and deletion of nodes in binary tree, binary search tree and its traversal, threaded binary tree, Heap, Balanced Trees. Terminology and representation of graphs using adjacency matrix, Warshalls algorithm.
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..
Text Books:
- Mark Allen Weiss, Data structures and algorithms analysis in C+ + , Pearson Education, 4th Edition, 2013.
- S. Lipschutz, Data Structures, McGraw-Hill Publication, Revised 1st Edition, 2014.
- Y. Langsm, M. Augenstin, A. Tanenbaum, Data Structure using C and C+ + , Prentice Hall India Learning Private Limited, 2nd Edition, 1998.
- Trembley and Sorenson, Introduction to Data Structures, PHI Publication, 2nd Revised Edition, 1983.
- Vishal Goyal, Lalit Goyal, A Simplified Approach To Data Structure, SPD Publication, 1st Edition, 2014.
For detail syllabus of all other subjects of Computer Engineering (CE) 3rd Sem 2018-19 regulation, visit CE 3rd Sem Subjects syllabus for 2018-19 regulation.