Scribd
Upload
3K views2 pages

Algorithms Lab Viva Questions

The document contains a list of 54 algorithm-related questions that could be asked in a viva voce exam for an algorithms lab course. The questions cover topics like algorithm definition and analysis, data structures, graph algorithms, string matching algorithms, NP-complete problems, and algorithm design techniques like divide-and-conquer, dynamic programming, greedy algorithms, and backtracking. The list is from the website www.bookspar.com, which provides notes for students of Visvesvaraya Technological University (VTU).

Uploaded by

Naveen
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
3K views2 pages

Algorithms Lab Viva Questions

The document contains a list of 54 algorithm-related questions that could be asked in a viva voce exam for an algorithms lab course. The questions cover topics like algorithm definition and analysis, data structures, graph algorithms, string matching algorithms, NP-complete problems, and algorithm design techniques like divide-and-conquer, dynamic programming, greedy algorithms, and backtracking. The list is from the website www.bookspar.com, which provides notes for students of Visvesvaraya Technological University (VTU).

Uploaded by

Naveen
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

www.bookspar.

com | Website for students | VTU NOTES

Algorithms Lab Viva Questions

1. What is an algorithm?
2. What are the 3 ways of computing GCD?
3. What is a pseudocode?
4. What is a flow chart?
5. Name some important problem types in algorithm
6. What is an adjacency matrix?
7. What is an adjacency Linked list
8. Define weighted digraph
9. What is a tree?
10. What is forest?
11. What is a Rooted tree?
12. What is a free tree?
13. Define ancestors, siblings,descendantsof a tree
14. What is a binary tree and binary search tree?
15. What are the two kinds of efficiency
16. Define time and space efficiency
17. What is a basic operation?
18. How we estimate the running time
19. Explain Brute force method. Give an example
20. Explain Divide and conquer method. Give an example
21. Explain Decrease and conquer method. Give an example
22. Explain Dynamic programming method. Give an example
23. Explain greedy technique. Give an example
24. Define Order of growth
25. What is an asymptotic notation?
26. Explain basic efficiency classes?
27. What is Master theorem?
28. What is the time complexity for Mergesort, Quicksort, Binary search, Selection sort,
DFS, BFS, heap sort
29. Explain the 3 major variations of decrease and conquer
30. What is DFS, BFS?
31. What is a tree edge and back edge in DFS
32. What is a tree edge and cross edge in BFS
33. What are the algorithms for generating combinatorial objects?
34. What is Exhaustive search?
35. What is an AVL tree?
36. What is an 2-3 tree?
37. State the 2 different types of heap construction?
38. Worst case efficiency of Horspools algorithm

www.bookspar.com
www.bookspar.com | Website for students | VTU NOTES

39. What is the disadvantage of Horspools algorithm


40. What is Boyer Moore algorithm
41. What is hashing?
42. What is transitive closure?
43. Explain warshall & floyds algorithm?
44. Explain DFS & BFS
45. What is a Memory function?
46. What is a spanning tree?
47. Differentiate Prims , Kruskals & Dijskstras algorithm
48. Explain Prims , Kruskals & Dijskstras algorithm
49. What is Union find algorithm?
50. What is Huffman encoding?
51. What is P,NP and NP complete problem?
52. What is Bactracking?
53. What is Branch and bound technique?
54. Explain n-queens & sum of subsets problem with respect to backtracking

www.bookspar.com

You might also like