UNIT 6

QUESTION BANK

1. Compare deterministic and non-deterministic computation algorithm.
2. What is polynomial time algorithm? Give example.
3. Explain classes in computational complexity.
4. Comparison between NP class and NP complete class.
5. Comparison between P class and NP complete class.
6. Comparison between NP class and NP hard class.
7. Write applications of NP classes of computational complexity.
8. What is max-clique? Write algorithm for clique with example.
9. Explain vertex cover algorithm with suitable example.
10. What is parallel computing?
11. Explain in brief models of parallel computing.
12. Explain algorithm for pointer jumping algorithm with example.