AD-303 RGPV B.Tech
Data Structures (DS)
Previous year papers and the official syllabus are free to read, no account needed.
Previous Year Papers
7 papers, latest Dec 2025
- AD-303 paper, Dec 2025
- AD-303 paper, Dec 2024
- AD-303 paper, Jun 2024
- AD-303 paper, Dec 2023
- AD-303 paper, Jun 2023
- AD-303 paper, Dec 2022
Syllabus, notes and important questions for AD-303
Syllabus units
Topics as the official RGPV syllabus lists them.
Unit 1 Introduction to Data Structures 11 topics
- Concepts of Data and Information
- Classification of Data Structures
- Abstract Data Types (ADTs)
- Memory representation of data structures
- Cost estimation of data structure operations
- Linear data structures – Arrays
- Linked List – representation in memory
- Singly linked list
- Circular linked list
- Doubly linked list
- Applications of linked list (e.g., polynomial manipulation)
Unit 2 Stacks and Queues 10 topics
- Stack as an ADT
- Implementation techniques for stacks
- Multiple stacks
- Applications of stack – infix to postfix conversion, postfix evaluation, recursion
- Queue as an ADT
- Implementation techniques for queues
- Circular queue
- Deque and Priority Queue
- Queue simulation
- Applications of queues
Unit 3 Tree Data Structures 11 topics
- Tree definitions – height, depth, order, degree
- Binary Search Tree – operations, traversal, search
- AVL Tree
- Heap
- Forest
- Multi‑way tree
- B‑tree
- B$^+$‑tree
- B$^*$‑tree
- Red‑Black tree
- Comparison of various tree types
Unit 4 Graphs 7 topics
- Graph definitions and classification – directed and undirected graphs
- Graph representation
- Graph traversal – Depth‑First Search (DFS), Breadth‑First Search (BFS)
- Minimum Spanning Tree algorithms – Kruskal, Prim
- Shortest‑path algorithm – Dijkstra
- Comparison of graph algorithms
- Applications of graphs
Unit 5 Sorting, Searching and Hashing 6 topics
- Sorting techniques – Bubble sort, Quick sort, Selection sort, Heap sort, Insertion sort, Shell sort, Merge sort, Radix sort
- Comparison of sorting algorithms
- Searching techniques – Sequential search, Binary search
- Comparison of search methods
- Hashing and indexing
- Case studies – applications in operating systems, DBMS
Exam insights
Counted from 7 past AD-303 papers.
Marks asked per paper, by unit
-
Unit 1 Introduction to Data Structure 31 marks
-
Unit 2 Stacks and Queue 13 marks
-
Unit 3 Tree 27 marks
-
Unit 4 Graphs 18 marks
-
Unit 5 Sorting and Searching 21 marks
Average marks of the questions from each unit in one paper. You answer only some of them, so the total is more than the paper’s maximum.
Asked again and again
-
Define/explain AVL tree and construct AVL tree by inserting a given sequence of keys with rotations
Asked 4 times: 2024, 2023, 2022
-
Construct an AVL tree by inserting a given sequence of keys starting from an empty tree, performing rotations to maintain balance.
Asked 3 times: 2024, 2023, 2022
-
Define and distinguish tree terminologies: height vs depth, degree/order of a node, and forest
Asked 3 times: 2025, 2024, 2023