Design and Analysis of Algorithm Unit 5 – Selected Topics: AKTU previous year questions
37 AKTU questions from Unit 5 (Selected Topics) asked in 2019–2026, tagged by marks, year and topic. In short: about 29 marks of every paper come from this unit; the most asked topic is String Matching (13 times); 32 questions came back in a later year. The latest ones are listed below; on the page you can filter them by 2-mark or long questions, topic and repeats.
Unit 5 previous year questions
- Define Polynomial-time Verifiability. (2 marks, 2026, NP-Completeness Theory)
- Using Rabin-Karp algorithm, how many hash computations are needed to search for a pattern of length 4 in a text of length 15? (7 marks, 2026, String Matching)
- Describe the Boyer-Moore string matching algorithm. How do the bad character and good suffix heuristics work? (7 marks, 2026, String Matching)
- Describe “Randomized algorithms”. List few randomized algorithms. (2 marks, 2025, Randomized Algorithms)
- Explain Vertex Cover Problem. Solve vertex cover problem using approximation algorithm (7 marks, 2025, Approximation Algorithms)
- Explain P, NP, NP –Complete and NP-Hard complexity classes. How they are related to each other. (7 marks, 2025, NP-Completeness Theory)
- Write Knuth-Morris-Pratt string matching algorithm. Take a suitable example Compute the prefix function π for the pattern ababbabbabbababbabb when the alphabet is Σ = {a, b}. (7 marks, 2025, String Matching)
- What do you mean by Boyer-Moore Algorithm? (2 marks, 2024, String Matching)
- Write short note on Fast Fourier Transform. (2 marks, 2024, Fast Fourier Transform)
- Write short notes on the following: i) Randomized Algorithm. ii) Approximation algorithm. (10 marks, 2024, Randomized Algorithms)
- Explain P, NP, NP Hard and NP Complete Classes with example. (10 marks, 2024, NP-Completeness Theory)
- Explain KMP matcher and also implement it by an algorithm, where P=a,a,b,a,b,b,a and T=b,a,b,a,a,b,a,b,b,a (10 marks, 2024, String Matching)
Most asked Unit 5 topics
- String Matching – asked 13 times
- NP-Completeness Theory – asked 8 times
- Approximation Algorithms – asked 7 times
Unit 5 question pattern
- 2-mark questions: 13 asked in 2019–2026
- 7-mark questions: 12 asked in 2019–2026
- 10-mark questions: 12 asked in 2019–2026
- About 29 marks from Unit 5 in every paper
- 32 questions were asked again in a later year
Unit 5 questions year by year
- 2026: 3 Unit 5 questions asked (16 marks across that year's papers)
- 2025: 4 Unit 5 questions asked (23 marks across that year's papers)
- 2024: 5 Unit 5 questions asked (34 marks across that year's papers)
- 2023: 5 Unit 5 questions asked (34 marks across that year's papers)
- 2022: 5 Unit 5 questions asked (34 marks across that year's papers)
- 2021: 5 Unit 5 questions asked (34 marks across that year's papers)
- 2020: 5 Unit 5 questions asked (25 marks across that year's papers)
- 2019: 5 Unit 5 questions asked (30 marks across that year's papers)