IT-303 RGPV B.Tech
Data Structure (DS)
Previous year papers and the official syllabus are free to read, no account needed.
Previous Year Papers
6 papers, latest Dec 2025
- IT-303 paper, Dec 2025
- IT-303 paper, Dec 2024
- IT-303 paper, Jun 2024
- IT-303 paper, Dec 2023
- IT-303 paper, Jun 2023
- IT-303 paper, Nov 2022
Syllabus, notes and important questions for IT-303
Syllabus units
Topics as the official RGPV syllabus lists them.
Unit 1 Introduction 12 topics
- Data and data types
- Data objects
- Primitive and non‑primitive data structures
- Linear and non‑linear data structures
- Traversing operations on data structures
- Searching operations on data structures
- Insertion operations on data structures
- Deletion operations on data structures
- Complexity analysis (worst case, best case, average case)
- Time‑space trade‑off
- Algorithm efficiency
- Asymptotic notations (big‑O, \Omega, \Theta)
Unit 2 Arrays & Structure 22 topics
- Declaration of arrays
- Insertion, deletion and merging of arrays
- One‑dimensional and two‑dimensional arrays
- Row‑major and column‑major representation
- Address calculation in arrays
- Storing values in arrays
- Polynomial evaluation using arrays
- Introduction to searching and sorting
- Sequential search
- Binary search
- Fibonacci search
- Indexed sequential search
- Hashed search
- Bubble sort
- Heap sort
- Insertion sort
- Selection sort
- Quick sort
- Shell sort
- Bucket sort
- Radix sort
- Merge sort
Unit 3 Stacks & Queues 10 topics
- Basic concepts of stacks and queues
- Array representation of stacks
- Stack operations: push, pop, create, getTop, empty
- Linked representation of stacks
- Multiple stacks
- Applications of stacks: infix, prefix, postfix conversion and arithmetic expression evaluation
- Linked representation of queues
- Queue operations: insertion, deletion
- Types of queues: circular, dequeue, priority queue
- Applications of queues: job scheduling, Josephus problem
Unit 4 Linked List 9 topics
- Basic terminology of linked lists
- Memory allocation and deallocation for linked lists
- Variants: head pointer, head node
- Linear and circular linked lists
- Doubly linked list creation, deletion, insertion, traversal
- Singly circular linked list
- Circular linked list with header node
- Doubly circular linked list
- Applications: polynomial representation, garbage collection
Unit 5 Trees and Graphs 7 topics
- General tree terminology and representation
- Types of trees
- Binary tree realization and properties
- Binary tree traversals: inorder, preorder, postorder
- Applications of trees
- Graph basic terminology and representations
- Graph search and traversal algorithms
Exam insights
Counted from 4 past IT-303 papers.
Marks asked per paper, by unit
-
Unit 1 Introduction 14 marks
-
Unit 2 Arrays & Structure 32 marks
-
Unit 3 Stacks & Queues 26 marks
-
Unit 4 Linked List 10 marks
-
Unit 5 Trees 30 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
-
Show the steps of inserting given keys one at a time into an initially empty binary heap / constructing a heap.
Asked 3 times: 2025, 2020, 2019
-
Define data structure and describe its classification with a diagram.
Asked 2 times: 2024, 2023
-
Write the algorithm for evaluating a postfix expression using a stack and apply it to evaluate a given postfix expression showing stack contents at each step.
Asked 2 times: 2024, 2023