DBATU · Second Year B.Tech Computer Engineering · NEP 2020
Data Structures
25AF1245PC302 · Semester III · 3 credits · Continuous assessment 20 + mid-semester 20 + end-semester 60
Unit 1: Introduction, Arrays and Hash Tables
6 hoursData types, data structures and ADTs; characteristics and analysis of algorithms; sequential organisation, array storage and sparse matrices; direct-address and hash tables, hash functions, open addressing and perfect hashing.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
Unit 2: Stacks and Queues
6 hoursStacks and queues as ADTs with sequential and linked implementations; circular queues; expression evaluation and conversion; recursion; priority queues.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
Unit 3: Linked Lists
6 hoursLinked organisation; singly, doubly and circular linked lists with insertion, deletion, concatenation and traversal; dynamic storage management and garbage collection.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Singly linked lists
- Circular and doubly linked lists
- Dynamic memory management and garbage collection
Unit 4: Trees and Graphs
7 hoursBinary trees and their representation; insertion and deletion; binary search trees and traversal; threaded binary trees; heaps and balanced trees; graph terminology, adjacency-matrix representation and Warshall's algorithm.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Trees and binary trees
- Binary tree traversals: recursive and non-recursive
- Binary search trees
- Threaded binary trees
- Heaps and balanced trees
- Graph representation
- Warshall's algorithm for path matrices
Unit 5: Searching and Sorting
7 hoursSequential and binary search; skip lists and dictionaries with insertion, deletion and search; insertion, selection and radix sort; file handling.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Searching: linear, binary, Fibonacci and indexed sequential search
- Skip lists and dictionaries
- Bubble, insertion and selection sort
- Radix sort
- File handling and file organisation
Unit contents are summarised from the official DBATU syllabus . AiCanCode.org is not affiliated with Dr. Babasaheb Ambedkar Technological University (DBATU).