RTMNU · Second Year B.Tech Artificial Intelligence · NEP 2020
Data Structure
BAI4T12 · Semester IV · 3 credits · College 30 + university 70
Unit 1: Introduction to Algorithms; Sorting and Searching
6 hoursTypes of data structures, their properties and operations; time and space analysis, big-oh, theta and omega notations and best, average and worst cases; selection, insertion, heap and shell sort; linear and binary search.
Examined in the 70-mark end-semester paper
- Data structures and their types
- Asymptotic notations
- Insertion, bubble and selection sort
- Heaps
- Shell sort
- Sequential and binary search
Unit 2: Stacks and Queues
8 hoursStacks and queues using arrays, applications of stacks, infix to postfix and prefix conversion and postfix evaluation; linear, circular and priority queues.
Examined in the 70-mark end-semester paper
- Stack ADT and operations
- Expression conversion and evaluation
- Queue ADT and operations
- Circular queues
- Deques and priority queues
Unit 3: Linked Lists
6 hoursOrdered lists in arrays; singly linked lists with static and dynamic allocation and their operations; polynomials as linked lists; circular and doubly linked lists.
Examined in the 70-mark end-semester paper
- Arrays and sparse matrices
- Static and dynamic memory allocation
- Singly linked lists
- Polynomial addition with linked lists
- Circular linked lists
- Doubly linked lists
Unit 4: Trees
8 hoursGeneral and binary trees, their representations and traversals, binary search trees, threaded binary trees, balancing, AVL trees, B-trees and B+ trees.
Examined in the 70-mark end-semester paper
- Tree terminology and representation
- Binary tree traversals
- Binary search trees
- Threaded binary trees
- AVL trees
- B-trees and B+ trees
Unit 5: Graphs and Hashing
8 hoursMatrix and list representations of graphs and digraphs, breadth- and depth-first search and spanning trees; hash tables, hash functions, hashing techniques, collision resolution and overflow handling.
Examined in the 70-mark end-semester paper
- Graph representation
- DFS and BFS
- Prim's and Kruskal's algorithms
- Hash functions and their applications
- Hashing and collision resolution
- Open addressing and perfect hashing
Unit contents are summarised from the official RTMNU syllabus . AiCanCode.org is not affiliated with Rashtrasant Tukadoji Maharaj Nagpur University (RTMNU).