IT-403 RGPV B.Tech
Analysis and Design of Algorithm (ADA)
Previous year papers and the official syllabus are free to read, no account needed.
Previous Year Papers
7 papers, latest Jun 2026
- IT-403 paper, Jun 2026
- IT-403 paper, Jun 2025
- IT-403 paper, Dec 2024
- IT-403 paper, Jun 2024
- IT-403 paper, Nov 2023
- IT-403 paper, Jun 2023
Syllabus, notes and important questions for IT-403
Syllabus units
Topics as the official RGPV syllabus lists them.
Unit 1 Algorithms, Design and Analysis 10 topics
- Algorithms
- Designing algorithms
- Analyzing algorithms
- Asymptotic notations
- Heap and heap sort
- Divide and conquer technique
- Binary search
- Merge sort
- Quick sort
- Strassen’s matrix multiplication
Unit 2 Greedy Algorithms 7 topics
- Greedy strategy
- Optimal merge patterns
- Huffman coding
- Minimum spanning trees
- Knapsack problem
- Job sequencing with deadlines
- Single source shortest path algorithm
Unit 3 Dynamic Programming 5 topics
- Dynamic programming
- 0/1 knapsack problem
- Multistage graph
- Reliability design
- Floyd‑Warshall algorithm
Unit 4 Backtracking and Branch & Bound 8 topics
- Backtracking concept
- 8‑queen’s problem
- Hamiltonian cycle
- Graph coloring problem
- Branch and bound method
- Traveling salesman problem
- Lower bound theory
- Parallel algorithms
Unit 5 Tree Data Structures and NP‑Completeness 6 topics
- Binary search trees
- Height balanced trees
- 2‑3 trees
- B‑trees
- Search and traversal techniques for trees and graphs (in‑order, pre‑order, post‑order, DFS, BFS)
- NP‑completeness
Exam insights
Counted from 5 past IT-403 papers.
Marks asked per paper, by unit
-
Unit 1 Algorithms 38 marks
-
Unit 2 Greedy strategy 15 marks
-
Unit 3 Dynamic programming 15 marks
-
Unit 4 Backtracking and Branch & Bound 22 marks
-
Unit 5 Trees and NP-completeness 14 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
-
Explain the 8-queens / N-queens problem and solve it using backtracking, including algorithm and state-space tree.
Asked 5 times: 2026, 2023, 2020, 2019
-
Apply Floyd-Warshall / Floyd's algorithm to compute all-pairs shortest-path distances for a given weighted graph / cost matrix.
Asked 3 times: 2026, 2022, 2020
-
Solve a 0/1 Knapsack instance using dynamic programming to find the optimal solution.
Asked 3 times: 2026, 2023, 2020