PART A
1) Design an algorithm for checking whether the given word is a palindrome
2) What is algorithm visualization ?
3) Write the pseudo code for greedy method
4) State the basic principle of divide and conquer strategy with the pseudocode
5) State TSP
6) State multistage graph problem give an application of this problem
7) What is meant by branch and bound tech
8) Write down the adjacency matrix of the following graph(refer graph from paper)
9) Define articulation point and biconnected component with example
10) State the properties of NP hard problem
No comments:
Post a Comment