Top 20 Questions of DAA (B-TECH Information Technology 4th)
Most Repeated Questions
Top 20 Questions of Design and Analysis of Algorithms
Previous year question paper with solutions for Top repeated questions of Design and Analysis of Algorithms
PTU • B-TECH • Information Technology • 4th
Browse Top 20 questions of DAA (B-TECH Information Technology 4th) previous year question papers for Top repeated questions of Design and Analysis of Algorithms. This page helps DAA students find semester-wise papers for revision, exam practice, and understanding previous exam patterns. These are the top twenty repeated questions identified from previous year papers for DAA (B-TECH Information Technology 4th), helping students focus on the most frequently asked topics.
Top repeated questions
Top 20-
1.
Explain the general principle of Greedy method and also list the applications of Greedy method.
Appeared 2 times
Appeared in: May 2025, May 2023
-
2.
What is Minimum cost spanning tree? Explain an algorithm for generating minimum cost spanning tree.
Appeared 2 times
Appeared in: May 2025, May 2023
-
3.
Define an Algorithm. Discuss the key characteristics of algorithm.
Appeared 2 times
Appeared in: May 2025, May 2023
-
4.
Asymptotic analysis
Appeared 1 times
Appeared in: May 2023
-
5.
Recurrence relation
Appeared 1 times
Appeared in: May 2023
Login to see the full list of questions for this subject.
Login to see all