RTMNU · Second Year B.Tech Computer Engineering · NEP 2020
Data Structure
BCME3T10 · Semester III · 3 credits · College 30 + university 70
Unit 1: Introduction to Algorithm; Sorting and Searching
8 hoursGeneral concepts and types of data structures with their properties and operations; time and space analysis of algorithms with big-O, theta and omega notation; selection, insertion, radix and shell sort; linear and binary search.
Examined in the 70-mark end-semester paper
Unit 2: Stacks and Queues
7 hoursStack operations and implementation, multiple stacks and stack applications; prefix and postfix expressions, infix-to-prefix and infix-to-postfix conversion and their evaluation; simple, circular, double-ended and priority queues and their applications.
Examined in the 70-mark end-semester paper
Unit 3: Linked Lists
7 hoursLinked-list operations and representation; singly, circular and doubly linked lists; polynomial addition and multiplication with linked lists.
Examined in the 70-mark end-semester paper
- Singly linked lists
- Circular and doubly linked lists
- Polynomial manipulation with linked lists
Unit 4: Trees
7 hoursTree terminology and properties; binary trees and binary search trees and their operations; threaded binary trees; AVL trees and rotations, red–black trees, B-trees and B+ trees; tree traversals and their applications.
Examined in the 70-mark end-semester paper
- Trees and binary trees
- Binary tree traversals: recursive and non-recursive
- Binary search trees
- Threaded binary trees
- AVL trees and rotations
- Red–black trees
- B-trees and B+ trees
Unit 5: Graphs and Hashing
7 hoursGraph representation and applications, DFS and BFS traversal; hash functions and hash tables, simple hash functions and collision handling.
Examined in the 70-mark end-semester paper
Unit contents are summarised from the official RTMNU syllabus . AiCanCode.org is not affiliated with Rashtrasant Tukadoji Maharaj Nagpur University (RTMNU).