Data Structures detailed syllabus scheme for B.Tech Computer Engineering (CE), 2017-18 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 4th Sem 2017-18, do visit CE 4th Sem 2017-18 Onwards Scheme. The detailed syllabus scheme for data structures is as follows.
Data Structures Syllabus for Computer Engineering (CE) 2nd Year 4th Sem 2017-18 DBATU
Course Objectives and Outcomes:
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 I
Introduction: Data, Data types, Data structure, Abstract Data Type (ADT), representation of Information, characteristics of algorithm, program, analyzing programs.
Unit II
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 III
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 IV
Linked Lists: Concept of linked organization, singly and doubly linked list and dynamic storage management, circular linked list, operations such as insertion, deletion, concatenation, traversal of linked list, dynamic memory management, garbage collection.
Unit V
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 VI
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++, Second Edition, Pearson Education.
- S. Lipschutz, Data Structures, McGraw-Hill Publication.
- Y. Langsm, M. Augenstin, A. Tanenbaum, Data Structure using C and C+ + , Pearsons Education Asia Publication.
- Trembley and Sorenson, Introduction to Data Structures, PHI Publication.
Reference Book:
- E. Horowitz, S. Sahani, Data Structure and Algorithms, Galgotia Publication.
- Thomas Cormen, Introduction to Algorithms, PHI Publication.
- Venkatesan and Rose, Data Structure, Wiley Publication.
- Goodrich and Tamassia, Data Structure and Algorithm in C++, Wiley Publication.
- Rod Stephens, Learning Data Structures and Algorithms: Implementation and Analysis for Increased Software Performance, O’Reilly Media.
- Kyle Loudon, Mastering Algorithms with C: Useful Techniques from Sorting to Encryption, O’Reilly Media.
For detail syllabus of all other subjects of Computer Engineering (CE) 4th Sem 2017-18 regulation, visit CE 4th Sem Subjects syllabus for 2017-18 regulation.