Algorithms Lab Viva Questions Prepared by : Prof.

Prasad B S SDMIT, Ujire

1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18.

What is an algorithm? What are the 3 ways of computing GCD? What is a pseudocode? What is a flow chart? Name some important problem types in algorithm What is an adjacency matrix? What is an adjacency Linked list Define weighted digraph What is a tree? What is forest? What is a Rooted tree? What is a free tree? Define ancestors,siblings,descendantsof a tree What is a binary tree and binary search tree? What are the two kinds of efficiency Define time and space efficiency What is a basic operation? How we estimate the running time

19. 20. 21. 22. 23. 24. 25. 26. 27. 28. 29. 30. 31. 32. 33. 34. 35. 36. 37. 38. 39. 40. 41.

Explain Brute force method. Give an example Explain Divide and conquer method. Give an example Explain Decrease and conquer method. Give an example Explain Dynamic programming method. Give an example Explain greedy technique. Give an example Define Order of growth What is an asymptotic notation? Explain basic efficiency classes? What is Master theorem? What is the time complexity for Mergesort, Quicksort, Binary search, Selection sort, DFS, BFS, heap sort Explain the 3 major variations of decrease and conquer What is DFS, BFS? What is a tree edge and back edge in DFS What is a tree edge and cross edge in BFS Worst case efficiency of Horspools algorithm What is the disadvantage of Horspools algorithm What is Boyer Moore algorithm What is transitive closure? Explain warshall & floyds algorithm? Explain DFS & BFS What is a Memory function? What is a spanning tree? Differentiate Prims , Kruskals & Dijskstras algorithm

42. 43. 44. 45. 46.

Explain Prims , Kruskals & Dijskstras algorithm What is P,NP and NP complete problem? What is Bactracking? What is Branch and bound technique? Explain n-queens & sum of subsets problem with respect to backtracking