Scribd
Upload
5 views2 pages

Daa Imp Questions

The document outlines various computational problems and algorithms, including articulation points, knapsack problems, and the traveling salesperson problem. It discusses techniques such as backtracking, branch and bound, and provides examples for clarity. Additionally, it differentiates between complexity classes like P, NP, NP-hard, and NP-complete, and includes algorithms for graph traversal and optimization problems.

Uploaded by

abhiraamuppari
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
5 views2 pages

Daa Imp Questions

The document outlines various computational problems and algorithms, including articulation points, knapsack problems, and the traveling salesperson problem. It discusses techniques such as backtracking, branch and bound, and provides examples for clarity. Additionally, it differentiates between complexity classes like P, NP, NP-hard, and NP-complete, and includes algorithms for graph traversal and optimization problems.

Uploaded by

abhiraamuppari
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

1 Demonstrate the procedure to identify the articulation point with an example.

2 Discuss the knapsack problem with suitable example using Backtracking


Technique.
3 Explain the method of reduction to solve travelling sales person problem
using branch and bound.
4 a) State and Prove the computing transitive closure
4 b) State and Prove Inverting Lower Triangular Matrices
5 a) Differentiate the P-class and NP-class
b) Differentiate the NP-hard and NP-Complete with an example
6 a) Illustrate the decision problems with an example
b) Demonstrate the optimization problems with an example

1 (A) Develop an algorithm for connected components and spanning trees.


1 (B) Summarize the procedure to identify the connected components.
2 (A) Explain the basic principle of Backtracking and list the applications
of Backtracking.
2 (B) Write an algorithm for Hamiltonian cycle with an example.
3 (A) Write a control abstraction of Branch and bound.
3 (B) Explain the general method of Branch and Bound.
4 (A) State and Prove that M (n) =O (Mt (n)).
4 (B) State and Prove that M (n) = θ(It (n)).
5 (A) Judge the Cook’s theorem.
5 (B) Compare the decision problem and optimization problem.
6 (A) Elucidate the Clique decision problem.
6 (B) Illustrate the non-deterministic algorithm for searching.

1 (A) Discuss iterative versions of binary tree traversal algorithms


(inorder, preorder and post order).
1 (B) Compare Prim’s and Kruskal’s algorithms.
2 (A) Explain subset-sum problem and discuss the possible solution strategies
using backtracking.
2 (B) Describe graph coloring problem and write an algorithm for m-coloring
problem
3 (A) State and Prove Mt(n)=ΩM(n).
3 (B) Explain in detail about Lower bound through reductions with an example.
4 Describe the 0/1 Knapsack Problem and discuss how to solve it using Branch
Bound Technique?
5 (A) Differentiate deterministic and non-deterministic algorithms.
5 (B) Explain chromatic number decision problem and clique decision problem.
6 (A) Write an algorithm for sorting by using nondeterministic method.
6 (B) Discuss the relationship between P and NP-Class.

1 (A) Define Graph Traversal? Explain BFS with an example.


1 (B) Give brief description about DFS with an example.
2 (A) Explain the basic principle of Backtracking and list the applications
of Backtracking.
2 (B) Elucidate the 4-Queens problem with an example.
3 (A) Explain principle of FIFO branch and bound.
3 (B) Describe control abstraction for LC Search.
4 (A) Describe the comparison trees with sorting.
4 (B) Discuss the comparison trees with ordered searching.
5 (A) Prove that CNF-SAT problem in NP.
5 (B) Explain the Halting Problem.
6 (A) Judge the Cook’s theorem.
6 (B) Prove that 3SAT problem in NP.

You might also like