Scribd
Upload
24 views8 pages

Fallsem2023-24 CBS3003 Eth VL2023240101316 Cat-2-Qp - Key

This document provides information for a continuous assessment test for an undergraduate algorithms course. It includes 5 questions worth a total of 50 marks on topics related to algorithms design and analysis: 1) Dynamic programming and matrix chain multiplication (10 marks) 2) Graph traversals on a sample graph (10 marks) 3) Network flow problems including Ford-Fulkerson algorithm (10 marks) 4) Kruskal's minimum spanning tree algorithm and topological sorting on sample graphs (10 marks) 5) Explanation of complexity classes such as tractable vs intractable problems and NP-hard vs NP-complete problems (10 marks)

Uploaded by

radhe krishna
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
24 views8 pages

Fallsem2023-24 CBS3003 Eth VL2023240101316 Cat-2-Qp - Key

This document provides information for a continuous assessment test for an undergraduate algorithms course. It includes 5 questions worth a total of 50 marks on topics related to algorithms design and analysis: 1) Dynamic programming and matrix chain multiplication (10 marks) 2) Graph traversals on a sample graph (10 marks) 3) Network flow problems including Ford-Fulkerson algorithm (10 marks) 4) Kruskal's minimum spanning tree algorithm and topological sorting on sample graphs (10 marks) 5) Explanation of complexity classes such as tractable vs intractable problems and NP-hard vs NP-complete problems (10 marks)

Uploaded by

radhe krishna
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/ 8

School of Computer Science and Engineering

Fall Semester 2023-24 UG Seniors (B.Tech 2021 Batch)


Continuous Assessment Test – II
Programme Name &Branch: B.Tech BBS SLOT:G1 and G2
Course Name & code: CBS3003 – Design and Analysis of Algorithms
Class Numbers: 1317, 1316, 1318, 1319
Faculty Names: Prof.Saravanan.R, Prof.Thangaramya.K, Prof.Iyappan.P, Prof.Srivani.A
Exam Duration: 90 Min. Maximum Marks: 50
Q.No. Questions Max
Marks
1. Given a sequence of matrices <8,5,10,20,5>. Using Dynamic 10
programming find the minimum number of scalar multiplications needed and also
write the optimal multiplication order.
2. Traverse the given graph with the necessary traversals by taking vertex 1 as start vertex. 10
If several nodes can be chosen at some steps of the traversal, pick the vertex in
ascending order. Use appropriate data structures and show all possible intermediate steps
diagrammatically.

1 6

2 7

3. Discuss about augmenting path with suitable example. Consider the given network flow 10
graph and apply Ford Fulkerson algorithm to compute the max-flow using augmenting
paths in the given network where the weighted edges indicate the capacity of the
channel. Discuss its time complexity. (Step by step solution is required).
4. i) Write kruskal’s algorithm and draw the minimum cost spanning tree for the given 5
graph using the same. (show all the stages)

ii) Arrange the vertices of the given digraph in topological ordering . If not possible then 5
justify your answer with proper explanation

5. Elaborate in detail about the following with proper explanation. 10

i) Tractable Problems ii) Intractable Problems iii)NP Hard Problems

iv)NP Complete Problems

You might also like