AL-402 RGPV B.Tech
Analysis & Design of Algorithms (ADA)
Previous year papers and the official syllabus are free to read, no account needed.
Previous Year Papers
7 papers, latest Jun 2026
- AL-402 paper, Jun 2026
- AL-402 paper, Jun 2025
- AL-402 paper, Dec 2024
- AL-402 paper, Jun 2024
- AL-402 paper, Nov 2023
- AL-402 paper, Jun 2023
Syllabus, notes and important questions for AL-402
Syllabus units
Topics as the official RGPV syllabus lists them.
Unit 1 Definitions of algorithms and complexity 15 topics
- Definitions of algorithms and complexity
- Time and Space Complexity
- Time–space tradeoff
- Various bounds on complexity
- Asymptotic notation
- Recurrences and recurrence solving techniques
- Introduction to divide and conquer technique
- Binary search
- Merge sort
- Quick sort
- Heap sort
- Strassen’s matrix multiplication
- Code tuning techniques: Loop Optimization
- Code tuning techniques: Data Transfer Optimization
- Code tuning techniques: Logic Optimization
Unit 2 Greedy strategy and its applications 8 topics
- Study of Greedy strategy
- Optimal merge patterns
- Huffman coding
- Minimum spanning trees
- Knapsack problem
- Job sequencing with deadlines
- Single source shortest path algorithm
- Correctness proof of greedy algorithms
Unit 3 Dynamic programming 5 topics
- Concept of dynamic programming
- 0/1 knapsack problem (dynamic programming solution)
- Multistage graph problem
- Reliability design using dynamic programming
- Floyd‑Warshall algorithm
Unit 4 Backtracking, branch & bound and parallel algorithms 8 topics
- Backtracking concept
- 8‑queen’s problem
- Hamiltonian cycle problem
- Graph colouring problem
- Introduction to branch & bound method
- Travelling salesman problem (branch & bound)
- Lower bound theory and its use in solving algebraic problems
- Introduction to parallel algorithms
Unit 5 Advanced algorithms and complexity classes 5 topics
- Advanced tree and graph algorithms
- NP‑hard and NP‑complete problems
- Approximation algorithms
- Data stream algorithms
- Design and complexity of parallel algorithms
Exam insights
Counted from 7 past AL-402 papers.
Marks asked per paper, by unit
-
Unit 1 Definitions of algorithms and complexity 26 marks
-
Unit 2 Study of Greedy strategy 24 marks
-
Unit 3 Concept of dynamic programming 21 marks
-
Unit 4 Backtracking concept and Branch & Bound 21 marks
-
Unit 5 Advanced tree and graph algorithms 17 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
-
Apply Kruskal's algorithm to a given weighted graph to construct the minimum cost spanning tree, illustrating with an example
Asked 4 times: 2026, 2025, 2024, 2023
-
Explain Floyd-Warshall algorithm with a suitable example.
Asked 4 times: 2026, 2024, 2023, 2022
-
Solve a given 0/1 Knapsack instance for maximum profit using dynamic programming / optimal selection.
Asked 4 times: 2023, 2022