Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
99 views1 page

DAA 2nd Sessional

This document outlines the questions for a 2nd sessional test on the design and analysis of algorithms. It is divided into 4 units. For unit 1, there are 4 questions defined covering topics like the N-queen problem, decision vs optimization problems, and backtracking vs branch and bound techniques. Units 2 and 3 define questions on topics like m-coloring problems, traveling salesman problems, and using branch and bound strategies. Finally, unit 4 defines questions on P vs NP vs NP-hard vs NP-complete problems and NP scheduling problems. The test allows 1 hour and carries a maximum of 15 marks.

Uploaded by

Dr. Mohd Shahid
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
99 views1 page

DAA 2nd Sessional

This document outlines the questions for a 2nd sessional test on the design and analysis of algorithms. It is divided into 4 units. For unit 1, there are 4 questions defined covering topics like the N-queen problem, decision vs optimization problems, and backtracking vs branch and bound techniques. Units 2 and 3 define questions on topics like m-coloring problems, traveling salesman problems, and using branch and bound strategies. Finally, unit 4 defines questions on P vs NP vs NP-hard vs NP-complete problems and NP scheduling problems. The test allows 1 hour and carries a maximum of 15 marks.

Uploaded by

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

B. Tech.

(CSE, Semester- 5)
Design and Analysis of Algorithms (PCC-CSE-307-G)
Allowed Time: 1 Hour 2nd Sessional Test Max. Marks: 15
Note: Q.1 is Compulsory. Attempt any one question from each unit. All questions carry equal marks.
Q.1(a) What is N-Queen problem?
(b) Differentiate between Decision and Optimization Problem.
(c) Differentiate between Backtracking and Branch & Bound technique.
(d) What is Sum of Subset problem?
Unit-3
Q.2) Explain m-coloring problem for n= 3 and m= 3 and also draw the state space tree.
Q.3) Explain Branch and Bound strategy to solve Travelling Salesman Problem (TSP) for the given graph. Also draw
state space tree that is generated

Unit-4
Q.4) Explain P, NP, NP Hard and NP complete Problems.
Q.5) Explain NP Scheduling problems.

B. Tech. (CSE, Semester- 5)


Design and Analysis of Algorithms (PCC-CSE-307-G)
Allowed Time: 1 Hour 2nd Sessional Test Max. Marks: 15
Note: Q.1 is Compulsory. Attempt any one question from each unit. All questions carry equal marks.
Q.1(a) What is N-Queen problem?
(b) Differentiate between Decision and Optimization Problem.
(c) Differentiate between Backtracking and Branch & Bound technique.
(d) What is Sum of Subset problem?
Unit-3
Q.2) Explain m-coloring problem for n= 3 and m= 3 and also draw the state space tree.
Q.3) Explain Branch and Bound strategy to solve Travelling Salesman Problem (TSP) for the given graph. Also draw
state space tree that is generated

Unit-4
Q.4) Explain P, NP, NP Hard and NP complete Problems.
Q.5) Explain NP Scheduling problems.

B. Tech. (CSE, Semester- 5)


Design and Analysis of Algorithms (PCC-CSE-307-G)
Allowed Time: 1 Hour 2nd Sessional Test Max. Marks: 15
Note: Q.1 is Compulsory. Attempt any one question from each unit. All questions carry equal marks.
Q.1(a) What is N-Queen problem?
(b) Differentiate between Decision and Optimization Problem.
(c) Differentiate between Backtracking and Branch & Bound technique.
(d) What is Sum of Subset problem?
Unit-3
Q.2) Explain m-coloring problem for n= 3 and m= 3 and also draw the state space tree.
Q.3) Explain Branch and Bound strategy to solve Travelling Salesman Problem (TSP) for the given graph.
Also draw state space tree that is generated.

Unit-4
Q.4) Explain P, NP, NP Hard and NP complete Problems.
Q.5) Explain NP Scheduling problems.

You might also like