Scribd
Upload
21 views3 pages

DAA Endsem

DAA Endsem Paper

Uploaded by

rushiraut7532
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
21 views3 pages

DAA Endsem

DAA Endsem Paper

Uploaded by

rushiraut7532
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/ 3

Total No.

of Questions : 8]
SEAT No. : TI900`709
P.7621 [Total No. of Pages . 3
l6189)-i41
T.E. (Information Technology)
DESIGN &NANYSIS OF ALGORITHMS
(2019 Pattern) (Semnester 1) (314445A) (Elective.)
Time: 2's Hours) .Mer. Marks : "
Instructions to the andidates:
l) Ansiver Qlor 92, Q3 or 04, 05 or Q6, Q7or 08.
2) Nea diagrans must be drawn wherever necessary;.
3) Figures,fo the right side indicate full marks.
4) Assymé suitable data, if necessary.

Q) a) Discuss the dynamic programmingapproach to solving the coin change


making problem. Explain how problém can be formulated as a
dynamic programming task arni provide'a step-by-step explanation of
the algorithm. (10]
b) Explain the Bellman-Fordalyorithn for finding the shortest paths in a
weighted directed graph DËscusstheproblem it solves, its applications,
and its time complexiN) [8]
OR
Q2) a) Solve the TSP problem using Dynamic Programming.
0 f 4 2 29
0 3[10]
:2 3
9)

0 10 15 20| G0
P 4
J4 |
5 0 9 10
6 13 0 12
|8 8 9 0

b)
End the minimum cost path trom source s t_ihk of the foliowing
multistage graph. [8]

P.T.0.
Q:) a) Write recursive and iterative algorithm for backtracking method. [8]
b) Construct planar graph for foJowing map. Explain how to ind
m -colouring of this planar grapth by using m-colouring Backtracking
algorithm. (9]

OR

04) a) Definehe n-Queen problem and its objective. Explain the rules and
consràlints associated with placing n queens on an n xnchessboard
without attacking each other. [8]
b) Discuss how the backtracking algorithm can be applied to solve the
(EGP
sum of subsets problem. Explain he deciaion space exploration process
with some examples. [9)

Q5) Construct the solution of following Travelling Salesperson problem using


Branch and Bound.
[18]
0:

20 30 10 11 e E G P O I 0(4
049 1

15 16 4 2 |2023

3 4

19 6 18 o
7 9
16 4 16

OR

Q6) a) Write an algorithm for FIFO branch and bound. [9]

b) Explain FIFO branch andbound method of problem solving. Explain


its advantages and limitations. [9]

[61801-141 2
Prove that Satisfiability problem in NP complete. (8]
07) a)
b)
Discuss the proof for the NPçompleteness of the Vertex Cover
problem. (9)

OR
the complexity çlasses P, NP, NP-complete, and NP-hard.
08) a) Define classes and their significance
Explain the relationships between these
CEGR theory. [9)
in computationalcômplexity
15.248.146.117
b) Prove tha clique problem is NP complete.
[8]

09:39:24

CEGPO10441
2/2023

09/1

|17

U5.248.146.

09:39:24

CEGPO0441
09/|2,2023

|46.1|7

15.248.

3
|6180]-141

You might also like