Sri Balaji College of Engineering & Technology, Jaipur

Department of Computer Science & Engineering

B.Tech. III Year (V Sem.)
II Mid Term Exam Dec-2021
Subject (Subject Code): Analysis of Algorithms (5CS4-05)
Max. Marks: - 50 Max. Time: - 1.5 Hour
NOTE: - Question Paper is divided into three parts. Attempt all parts.
Part A
Attempt any six questions (Short answer question up to 25 words)
1. What are the graph traversal techniques? [2]
2. How do you compare the performance of various algorithms? [2]
3. Give example of NP complete problem. [2]
4. Distinguish between deterministic and non-deterministic algorithms. [2]
5. Differentiate between decision problems and approximation problems. [2]
6. What is promising and non-promising nodes? [2]
7. What is the time complexity of conventional matrix multiplication method and Strassen's
matrix multiplication method? [2]
8. State Sum of Subsets problem. [2]
Part B
Attempt any four questions
9. Let S = {4,6,7,8} and m=18. Find all possible subsets of s that sum to m. Draw the state space
tree that is generated. [5]
10. Write the KMP string matching algorithm and also find the prefix function for the following
pattern (a b a b b a b a a) and implement the algorithm for the one step. [5]
11. What is job scheduling problem? Schedule two jobs on 4 machine using flow shop scheduling
technique. The time required by each operation of these jobs is given by the followings [5]
Job 1 Job 2
M1 3 0
M2 0 3
M3 4 2
M4 5 2
12. Explain Randomized algorithm and give advantage and disadvantage of it. [5]
13. Explain Cook’s Theorem. [5]
14. Explain Flow shop Scheduling with suitable example. [5]
Part C
Attempt any two questions
15. Solve the assignment problem by branch and bound method. [9]
Job 1 Job 2 Job 3 Job 4
Person 1 9 2 7 8
Person 2 6 4 3 7
Person 3 5 8 1 8
Person 4 7 6 2 4

16. What is dynamic programming? How is this approach different from recursion? Explain. [9]
17. What is multicommodity flow? Explain with suitable example. [9]