CS-402 RGPV B.Tech
Analysis 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
- CS-402 paper, Jun 2026
- CS-402 paper, Jun 2025
- CS-402 paper, Dec 2024
- CS-402 paper, Jun 2024
- CS-402 paper, Nov 2023
- CS-402 paper, Jun 2023
Syllabus, notes and important questions for CS-402
Syllabus units
Topics as the official RGPV syllabus lists them.
Unit 1 Fundamentals of Algorithms and Asymptotic Analysis 6 topics
- Definition and classification of algorithms
- Designing algorithms
- Analyzing algorithms
- Asymptotic notations (O, Ω, Θ, o, ω)
- Heap data structure
- Heap sort algorithm
Unit 2 Divide and Conquer Techniques 5 topics
- Principles of divide and conquer
- Binary search algorithm
- Merge sort algorithm
- Quick sort algorithm
- Strassen’s matrix multiplication
Unit 3 Greedy Algorithms 7 topics
- Greedy strategy concept
- Optimal merge patterns
- Huffman coding
- Minimum spanning trees (Kruskal and Prim)
- Knapsack problem (greedy approach)
- Job sequencing with deadlines
- Single source shortest path algorithms (e.g., Dijkstra’s)
Unit 4 Dynamic Programming 5 topics
- Dynamic programming paradigm
- 0/1 knapsack problem using DP
- Multistage graph problems
- Reliability design problems
- Floyd‑Warshall all‑pairs shortest path algorithm
Unit 5 Backtracking, Branch & Bound and Parallel Algorithms 8 topics
- Backtracking technique
- 8‑Queens problem
- Hamiltonian cycle problem
- Graph coloring problem
- Branch and bound method
- Traveling salesman problem using branch‑and‑bound
- Lower bound theory for combinatorial problems
- Introduction to parallel algorithms
Unit 6 Tree and Graph Data Structures, Traversals and NP‑Completeness 6 topics
- Binary search trees
- Height‑balanced trees (AVL)
- 2‑3 trees and B‑trees
- Tree traversal techniques (in‑order, pre‑order, post‑order)
- Graph traversal algorithms (DFS, BFS)
- Fundamentals of NP‑completeness
Exam insights
Counted from 7 past CS-402 papers.
Marks asked per paper, by unit
-
Unit 1 Algorithms and Divide and Conquer Technique 26 marks
-
Unit 2 Greedy Strategy 22 marks
-
Unit 3 Dynamic Programming 19 marks
-
Unit 4 Backtracking and Branch & Bound 22 marks
-
Unit 5 Trees, Traversal Techniques and NP-Completeness 19 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
-
Find the optimal solution to a given 0/1 knapsack instance using dynamic programming.
Asked 5 times: 2025, 2024, 2023, 2022
-
Trace / apply the quick sort algorithm step-by-step to sort a given list/array.
Asked 4 times: 2026, 2023, 2020, 2019
-
Explain the Floyd-Warshall all-pairs shortest path algorithm with a suitable example, including pseudocode.
Asked 4 times: 2026, 2025, 2020, 2019