1) Explain tractable and intractable problems.
2) What do you mean by articulation point?
3) Describe class P problems in detail with appropriate example.
4) Describe undecidable problems with appropriate example.
5) Describe the halting problem.
6) Describe class NP problems in detail with appropriate example.
7) Describe NP-complete problems.
8) When a decision problem is said to be polynomially reducible?
9) What do you mean by a Heuristic.
10) Describe NP-Hard problems.
11) What do you mean by Traversals.
12) Write down the techniques for traversals in graph. Explain them in detail.
13) Describe the theory of computational complexity.