DBATU · Second Year B.Tech Artificial Intelligence & Allied · 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 of algorithms and analysing programs; sequential organisation, linear and non-linear structures, sparse matrices and their transpose; 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
- Data structures and their types
- Abstract data types
- Time and space complexity
- Arrays and sparse matrices
- Hashing and collision resolution
- Open addressing and perfect hashing
Unit 2: Stacks and Queues
6 hoursStack and queue as ADTs with sequential and linked implementations; circular queues; stacks for expression evaluation and conversion and for recursion; priority queues.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Stack ADT and operations
- Queue ADT and operations
- Circular queues
- Expression conversion and evaluation
- Recursion
- Deques and priority queues
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
- Doubly linked lists
- Circular linked lists
- Static and dynamic memory allocation
- Garbage collection
Unit 4: Trees and Graphs
6 hoursTree terminology; binary trees, their representation and node 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
- Tree terminology and representation
- Binary tree traversals
- Binary search trees
- Threaded binary trees
- Heaps
- AVL trees
- Graph representation
- Warshall's algorithm for transitive closure
Unit 5: Searching and Sorting
6 hoursSequential and binary search; skip lists as dictionaries and their operations; 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
- Sequential and binary search
- Skip lists
- Insertion, bubble and selection sort
- Radix sort
- File handling
Unit contents are summarised from the official DBATU syllabus . AiCanCode.org is not affiliated with Dr. Babasaheb Ambedkar Technological University (DBATU).