6:16 AM
VAAGESWARI COLLEGES
- What do you mean by Algorithm? List some of the properties of it.
- Describe the performance analysis in detail.
- Define time complexity and describe different notations used to represent their complexities.
- Define theta notation. Explain the terms involved in it.Give an Example.
- Explain DFS algorithm with an example.
- Write an algorithm of biconnected components.
- Explain the inorder traversal of a tree with an example.
- Define biconnected components and Articulation point with an example
- Write and explain the divide-and-conquer merge sort algorithm and also compute its time complexity.
- Explain the strassen’s matrix multiplication concept with an example.
- Write and explain the quick-sort algorithm with an example.
- Write and explain the binary search with an example.
13. What is spanning tree? Explain the prim’s algorithm.
14. What is spanning tree? Explain the kruskal’s algorithm.
15. Write and explain the control abstraction for greedy method.
16. Write greedy algorithm to generate the shortest path.
