CY-502 RGPV B.Tech
Design& Analysis of Algorithms (DAA)
Previous year papers and the official syllabus are free to read, no account needed.
Previous Year Papers
5 papers, latest Dec 2025
- CY-502 paper, Dec 2025
- CY-502 paper, Jun 2025
- CY-502 paper, Dec 2024
- CY-502 paper, Nov 2023
- CY-502 paper, Nov 2022
Syllabus, notes and important questions for CY-502
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
- Data Transfer Optimization
- Logic Optimization
Unit 2 Greedy Algorithms 8 topics
- Greedy algorithm strategy
- Optimal merge patterns
- Huffman coding
- Minimum spanning trees
- Knapsack problem
- Job sequencing with deadlines
- Single‑source shortest‑path algorithm
- Correctness proofs of greedy algorithms
Unit 3 Dynamic Programming 5 topics
- Dynamic‑programming characteristics
- 0/1 knapsack problem
- Multistage graph problem
- Reliability design problem
- Floyd‑Warshall algorithm
Unit 4 Backtracking 8 topics
- Backtracking concept
- 8‑queen’s problem
- Hamiltonian cycle
- Graph colouring problem
- Branch‑and‑bound method
- Traveling salesman problem
- Lower‑bound theory and its use in solving algebraic problems
- Introduction to parallel algorithms
Unit 5 Advanced Tree and Graph Algorithms 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 5 past CY-502 papers.
Marks asked per paper, by unit
-
Unit 1 Definitions of algorithms and complexity 34 marks
-
Unit 2 Greedy Algorithms 21 marks
-
Unit 3 Dynamic programming 15 marks
-
Unit 4 Backtracking 27 marks
-
Unit 5 Advanced tree and graph algorithms 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
-
Define time complexity and explain the asymptotic notations $O$, $\Omega$ and $\Theta$ with examples.
Asked 3 times: 2025, 2024, 2023
-
Compute the optimal solution for the fractional knapsack problem using the greedy method given number of items, capacity, profits and weights.
Asked 3 times: 2024, 2023, 2022
-
Compare and contrast NP-hard vs NP-complete classes.
Asked 3 times: 2024, 2023, 2022