III [Link].
I Sem - 2025 - 2026
Tutorial
Design ana Analysis of Algorithms-DAA(J-23 Curriculum)
Time : 60 Minutes CSE and CSM Maximum : 10Marks
(Answer All Questions)
Date: 21-06-2025 Time:9:30AM-10:30AM
S. Mapping
Question Pattern Marks
No COs
1(a)
Explain Partition algorithm and trace this algorithm for n=8
Apply CO1 (2)
elements: 24, 12, 35, 23, 45, 34, 20, 48
1(b) Apply divide and conquer strategy for Strassen’s matrix
Apply CO1 (2)
multiplication and find time complexity.
Write an algorithm for Hamiltonian Cycle and draw the state
2(a) Apply CO2 (2)
space tree by taking a graph.
Write and explain find algorithm with collapsing rule with an
2(b) Apply CO2 (2)
example.
Consider the 4Elements a1<a2<a3<a4 with
q0=0.25,q1=3/16,q2=q3=q4=1/16,,p1=1/4,p2=1/8,p3=p4=1/
16
3 (A)Construct the OBST as a Min-Cost Tree. Apply CO3 (2)
(B)Construct the table of values W(i, j), C(i, j)&V(i,
j)computed by the algorithm to compute the roots of optimal
subtrees
Write Prim's and Kruskal's Algorithm for Minimum
4 Appy CO4 (2)
Spanning tree and Apply it on following graph step by step.
Define P and NP Class Problems with an example and
5(a) discuss relationship of P and NP-Class problems?
Understand CO5 (2)
(b)
State and prove Cook's Theorem