Scribd
Upload
18 views2 pages

DAA

The document contains a series of short, medium, and long answer type questions related to algorithms, including definitions, characteristics, complexities, and specific algorithmic strategies. Topics covered include asymptotic notation, greedy methods, dynamic programming, and various algorithmic problems such as the 0/1 Knapsack and Dijkstra's algorithm. The questions are designed to test understanding and application of algorithmic concepts and techniques.

Uploaded by

jagmeetsingh71204
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views2 pages

DAA

The document contains a series of short, medium, and long answer type questions related to algorithms, including definitions, characteristics, complexities, and specific algorithmic strategies. Topics covered include asymptotic notation, greedy methods, dynamic programming, and various algorithmic problems such as the 0/1 Knapsack and Dijkstra's algorithm. The questions are designed to test understanding and application of algorithmic concepts and techniques.

Uploaded by

jagmeetsingh71204
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

2 Marks Questions (Short Answer Type):

1. Define an algorithm. List any two characteristics of a good algorithm.

2. What is asymptotic notation? Give an example.

3. Differentiate between time complexity and space complexity.

4. What is the best-case and worst-case time complexity?

5. Write the recurrence relation for the merge sort algorithm.

6. Define the brute-force algorithmic strategy with one example.

7. What is the greedy method in algorithm design?

8. List two differences between dynamic programming and greedy algorithms.

9. What is backtracking? Give a brief example.

10. Mention two real-world applications of heuristics.

11. What is the difference between DFS and BFS?

12. Define a Minimum Spanning Tree with an example.

13. What is the time complexity of Dijkstra’s shortest path algorithm?

14. Define the classes P and NP.

15. What is an approximation algorithm?

16. List the data structure used by BFS and DFS.

!7. Differentiate between prior and posterior analysis.

18. Why we choose prior analysis to calculate time complexity.

19. What are the two features of Dynamic Programming?

20. What is the worst-case time complexity of Quick Sort?

5 Marks Questions (Medium Answer Type):

1. Explain the different types of asymptotic notations with examples.

2. State and Prove with the help of example Big Oh notation.

3. Solve the recurrence relation: T(n) = T(n/2) + 1 using the recursion tree method.

4. Analyse the average-case time complexity of linear search.

5. Explain the Master’s Theorem and state its three cases.

6. Explain the greedy approach with an example.

7. Compare branch-and-bound and backtracking techniques.

8. Describe the 0/1 Knapsack problem and show how it is solved using dynamic programming.
9. Write a brief note on heuristics and their characteristics.

10. Illustrate the brute-force method using the Travelling Salesman Problem (TSP).

11. Explain the process of topological sorting with a suitable example.

12. Differentiate between NP-complete and NP-hard problems with examples.

13. Describe Kruskal’s algorithm for finding a minimum spanning tree. Write its pseudocode.

14. Explain the concept of transitive closure of a graph.

15. Write a short note on Cook’s Theorem and its significance.

10 Marks Questions (Long Answer Type):

1. Discuss the characteristics of an algorithm and explain the performance measurements used to
evaluate it.

2. Solve the recurrence relation T(n) = 2T(n/2) + n using:

Recursion tree method

Master’s theorem

3. Discuss the application of the greedy strategy to the fractional knapsack problem with a step-by-
step solution.

4. Solve the 0/1 Knapsack problem using dynamic and explain the steps.

5. Describe the branch-and-bound strategy with an illustration of how it applies to solving TSP.

6. Explain BFS and DFS traversal techniques. Illustrate both with examples.

7. Describe Dijkstra’s algorithm for finding the shortest path and trace it for a given graph.

8. What is NP-complete problems? Explain with any two standard NP-complete examples and the
idea of reduction.

9. What do you mean by Huffman coding? Consider the following message and find no of bits
required by Huffman Coding.

aabbbbabbbcccdddeeeccceeeddee

10. Why Dijkstra’s algorithm fails. Explain Bellman Ford Algorithm with the help of example and
pseudocode.

11. Consider the two strings:

Str1 = s t o n e

Str 2 = l o n g e s t.

Find the longest common subsequence.

12. Discuss approximation and randomized algorithms in detail with one example each. Also,
comment on their importance in solving intractable problems.

You might also like