CY-303 RGPV B.Tech
Data Structures (DS)
Previous year papers and the official syllabus are free to read, no account needed.
Previous Year Papers
6 papers, latest Dec 2025
- CY-303 paper, Dec 2025
- CY-303 paper, Dec 2024
- CY-303 paper, Jun 2024
- CY-303 paper, Dec 2023
- CY-303 paper, Jun 2023
- CY-303 paper, Nov 2022
Syllabus, notes and important questions for CY-303
Syllabus units
Topics as the official RGPV syllabus lists them.
Unit 1 Introduction to Data Structure 11 topics
- Concepts of Data and Information
- Classification of Data structures
- Abstract Data Types
- Implementation aspects: Memory representation
- Data structures operations and cost estimation
- Linear data structures – Arrays
- Linked List – representation in memory
- Different implementations of linked list
- Circular linked list
- Doubly linked list
- Application of linked list – polynomial manipulation
Unit 2 Stacks and Queue 12 topics
- Stacks as ADT
- Different implementations of stack
- Multiple stacks
- Application of stack – infix to postfix conversion
- Evaluation of postfix expression
- Recursion using stack
- Queues as ADT
- Different implementations of queue
- Circular queue
- Deque and Priority Queue concepts
- Queue simulation
- Applications of queues
Unit 3 Tree 9 topics
- Definitions – height, depth, order, degree
- Binary Search Tree – operations, traversal, search
- AVL Tree
- Heap
- Comparison of various tree types
- Introduction to forest
- Multi‑way tree
- B‑tree, B+‑tree, B*‑tree
- Red‑black tree
Unit 4 Graphs 10 topics
- Introduction to graphs
- Classification – directed and undirected graphs
- Graph representation
- Graph traversal – Depth First Search (DFS)
- Graph traversal – Breadth First Search (BFS)
- Minimum Spanning Tree – Kruskal’s algorithm
- Minimum Spanning Tree – Prim’s algorithm
- Dijkstra’s shortest path algorithm
- Comparison of graph algorithms
- Applications of graphs
Unit 5 Sorting 15 topics
- Introduction to sorting
- Bubble Sort
- Quick Sort
- Selection Sort
- Heap Sort
- Insertion Sort
- Shell Sort
- Merge Sort
- Radix Sort
- Comparison of sorting techniques
- Searching – sequential search
- Searching – binary search
- Comparison of search methods
- Hashing & indexing
- Case study – applications in OS and DBMS
Exam insights
Counted from 6 past CY-303 papers.
Marks asked per paper, by unit
-
Unit 1 Introduction to Data Structure 35 marks
-
Unit 2 Stacks and Queue 13 marks
-
Unit 3 Tree 24 marks
-
Unit 4 Graphs 18 marks
-
Unit 5 Sorting and Searching 16 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
-
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
-
Explain how to measure / demonstrate the efficiency and complexity of an algorithm, including asymptotic notations.
Asked 3 times: 2024, 2022