Scribd
Upload
76 views3 pages

One Mark Questions Design and Analysis of Algorithms (VR17)

The document outlines 50 questions related to algorithms design and analysis. It covers various algorithm design techniques like greedy algorithms, dynamic programming, divide and conquer, branch and bound and backtracking. Some key topics include asymptotic analysis, graph algorithms, shortest path problems, sorting algorithms, knapsack problems and NP-complete problems. The document also lists the chapter outlines covering recursive algorithms, graph searches, sorting, dynamic programming, optimization problems and complexity analysis of algorithms.

Uploaded by

Manohar Datt
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
76 views3 pages

One Mark Questions Design and Analysis of Algorithms (VR17)

The document outlines 50 questions related to algorithms design and analysis. It covers various algorithm design techniques like greedy algorithms, dynamic programming, divide and conquer, branch and bound and backtracking. Some key topics include asymptotic analysis, graph algorithms, shortest path problems, sorting algorithms, knapsack problems and NP-complete problems. The document also lists the chapter outlines covering recursive algorithms, graph searches, sorting, dynamic programming, optimization problems and complexity analysis of algorithms.

Uploaded by

Manohar Datt
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

One mark Questions Design and Analysis of Algorithms (VR17)

1. What is principle of optimality?


2. Give example for 3-SAT problem
3. Write control abstractions for Greedy, divide and conquer and backtracking methods
4. What is control abstraction?
5. State cooks theorem
6. Compare backtracking and branch and bound
7. Compare dynamic programming and divide and conquer
8. What is time complexity?
9. What is space complexity?
10. Write recurrence relation for merge/quick sort and binary search methods
11. What is recurrence relation?
12. Define E-node live node and dead nodes
13. What is state space tree?
14. Define connected graph and bi-connected graph
15. Articulation point
16. Connected component and example
17. Bi-connected components and example
18. What are asymptotic notations?
19. What is attack in n-queens problem?
20. Write time complexities of following
 Binary search
 Strassens matrix multiplication
 Floyd warshal algorithm (All pairs shortest path)
 Dijkstras algorithm (single source shortest path)
 Matrix multiplication
 prims and kruskals algorithms
 Merge/quick sort
 Travelling salesmen problem
21. Define DFN tree edge and back edge
22. Write Union and Find algorithms
23. Compare prims and kruskals algorithms
24. Give example for hamiltion cycle
25. State graph coloring problem
26. Decision problem
27. Polynomial and non polynomial algorithms
28. Give example for non deterministic algorithm
29. What is deterministic algorithm?
30. What are different areas of algorithm?
31. Define algorithm and write criteria
32. Algorithm for sum of array elements
33. Algorithm for Towers of Hanoi
34. Weighted rule for union
35. Explicit and implicit constraints in backtracking
36. What are types of branch and bound?
37. What is performance analysis?
38. Define optimal solution and feasible solution
39. Define set how it can be represented
40. Give examples for subset paradigm and ordered paradigm
41. What is divide and conquer
42. What is greedy method
43. What is backtracking
44. What is branch and bound
45. What is dynamic programming
46. What is dominance rule and weight rule
47. Define chromatic number of graph
48. What is LC search
49. What is reducibility
50. Give example for CNF

UNIT-I

1. Recursive Algorithms
2. Asymptotic Notation (Big ―oh, Omega, Theta, Little ―oh).
3. Breadth First Search and Traversal
4. Depth First Search and Traversal
5. Connected components and Spanning trees
6. Bi-connected components and DFS.

UNIT-II

7. Binary search algorithm and time complexity


8. Merge sort algorithm and time complexity
9. Quick sort algorithm and time complexity
10. Strassen‘s matrix multiplication.
11. knapsack problem
12. Job Sequencing with deadlines,
13. Prim‘s and Kruskal‘s algorithms
14. Single source shortest path problem algorithm

UNIT-III

15. Multistage graph problem


16. All pairs shortest Path problem
17. 0/1 knapsack problem
18. Travelling sales person problem
19. 8-queens problem
20. Sum of subsets problem
21. Graph coloring and Hamiltonian cycles problems

UNIT-IV

22. Cooks Theorem


23. TSP by LCBB
24. Illustrate the terms P, NP, NP-Hard and NP-Complete. Also represent the relationship among
these problems.
25. 0/1 Knapsack problem by LCBB

You might also like