RTMNU · Second Year B.Tech Artificial Intelligence & Machine Learning · NEP 2020
Data Structures
BAM4T12 · Semester IV · 2 credits · College 30 + university 70
A 2-credit course in the Semester IV scheme (the course page prints 3).
Unit 1: Introduction and Searching
7 hoursBasic terminology, analysis of algorithms, asymptotic notations and the time-space trade-off; linear and binary search and their complexity.
Examined in the 70-mark end-semester paper
- Data structures and their types
- Asymptotic notations
- Time and space complexity
- Sequential and binary search
Unit 2: Stacks and Queues
7 hoursThe stack ADT and its operations, expression conversion and evaluation; the queue ADT, simple, circular and priority queues, with algorithms and their analysis.
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
7 hoursSingly linked lists in static and dynamic memory, traversal, search, insertion and deletion; linked stacks and queues; header nodes; doubly and circular linked lists with their algorithms and complexity.
Examined in the 70-mark end-semester paper
- Static and dynamic memory allocation
- Singly linked lists
- Linked stacks and queues
- Doubly linked lists
- Circular linked lists
Unit 4: Trees
8 hoursTree terminology; binary, threaded binary, binary search and AVL trees with their operations and complexity; applications of binary trees; B-trees and B+ trees; binary heaps.
Examined in the 70-mark end-semester paper
- Tree terminology and representation
- Binary tree traversals
- Threaded binary trees
- Binary search trees
- AVL trees
- B-trees and B+ trees
- Heaps
Unit 5: Graphs
7 hoursTerminology and representations; breadth- and depth-first search, connected components, spanning trees, single-source and all-pairs shortest paths, topological sort and Hamiltonian paths, with their complexity.
Examined in the 70-mark end-semester paper
- Graph representation
- DFS and BFS
- Prim's and Kruskal's algorithms
- Dijkstra's algorithm
- Floyd-Warshall algorithm
- Topological sorting
- Euler and Hamiltonian paths
Unit contents are summarised from the official RTMNU syllabus . AiCanCode.org is not affiliated with Rashtrasant Tukadoji Maharaj Nagpur University (RTMNU).