Scribd
Upload
43 views

DAA Important Question

Uploaded by

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

DAA Important Question

Uploaded by

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

DAA Important Question

1. What is Algorithm? Why we need to design Algorithm?


2. What is complexity? Different types of Complexity?
3. What are the different Asymptotic Notation to calculate time complexity?
What is the time Complexity of Algorithms (all cases Best, Worst and Average):-
a. Merge Sort --O(logn) logn logn
b. Bubble sort
c. Selection Sort
d. Binary Search.
e. Linear Search.
f. Quick Sort
4.
Do as Directed.
1) What do you understand by Space complexity?
2) Define Optimal Solution.
3) What do you mean by pruning?
4) What is the worst case complexity of a Binary Search algorithm?
5) Define residual capacity.
6) Which algorithm uses union-find data structure to find the Minimum Spanning tree of a
graph?
7) What is the difference between Fractional Knapsack and 0-1 Knapsack problem?
8) What do you understand by amortized analysis?
5. Explain different basic and most common time complexity of Algorithm?
6. Explain Divide and conquer technique? Which algorithm is best suited for D&C
technique
7. Explain minimum spanning tree. Which two algorithms used for minimum spanning tree
8. Advantage and Disadvantage of D&C?
9. Advantage and Disadvantage of Greedy Algorithm?
10. Rod cutting problem
11. Dynamic Programming Problem with Advantages and Disadvantages?
12. What is recurrence relation?List the Different ways of solving recurrence relation?
13. What data structure is best suited for DFS and BFS?
14. Advantages and disadvantage of DFS and BFS?
15. Binary Search of an ordered array. Iterative and Recursive algorithms are possible.
16. Find Factorial of n. Iterative and recursive algorithms are possible.

17. Explain difference between divide and conquer method and dynamic programming.
Explain Stressen’s Multiplication and compare the time Complexity of that algorithm
with regular matrix multiplication.
18. Explain how multiplication of large integers can be done efficiently by using divide and
conquer method.
19. Explain Merge sort using divide and conquer method and computer its worst case running
time.
20. Compare DFS And BFS algorithms. Write an algorithm of BFS.

21.
What is divide and conquer Approach? Explain in context of binary search method .
22.
Explain Dijkstra's shortest path algorithm.
23.
What are minimum spanning trees? Explain with a suitable example Kruskal’s
Method to find minimum spanning tree.
24. Explain Prim’s Algorithm.

25.
Explain knapsack problem. Discuss how greedy strategy can be used to solve it. Explain
with appropriate example.
26.
Give the difference between Prims and Kruskal’s Algorithm to find MST. Also explain the
Prim’s algorithm with the appropriate example.
27. Explain how multiplication of large integers can be done efficiently by using divide and
conquer method.
28.
Write a note on order notations.
29.
Write a note on BFS algorithm. Also give the difference between DFS and BFS.
30. Explain accounting method.

31. Explain Activity selection problem.

32. Explain Huffman code with example.

33. Explain Aggregate Analysis.

34. Explain how to find out Longest Common Subsequence of two strings using Dynamic
Programming method.
35. Explain Substitution method for solving recurrences.

36. Explain master Theorem

37. Explain recursion tree method

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy