Muthurangam Govt. Arts College(Autonomous),Vellore – 2 Muthurangam Govt.

Arts College(Autonomous),Vellore – 2
PG and Research Department of Computer Science PG and Research Department of Computer Science
Model Theory Examinations – January 2022 Model Theory Examinations – January 2022
Subject Code :17P1CS1 Subject : Design and Analysis of Algorithms Subject Code :17P1CS1 Subject : Design and Analysis of Algorithms
Time : 3 Hours Marks : 75 Time : 3 Hours Marks : 75
PART – A ( 5 x 6 = 30) PART – A ( 5 x 6 = 30)
Answer ALL the Questions Answer ALL the Questions
1. a) Write notes on Time and Space Complexity. 1. a) Write notes on Time and Space Complexity.
(OR) (OR)
b)Discuss Randomized algorithms with example. b)Discuss Randomized algorithms with example.
2. a) Explain briefly about Strassen’s Matrix 2. a) Explain briefly about Strassen’s Matrix
Multiplication. (OR) Multiplication. (OR)
b) Find an optimal solution to the Knapsack b) Find an optimal solution to the Knapsack
instance n = 7, m= 15, (p1,p2,…p7) = (10,5,15, instance n = 7, m= 15, (p1,p2,…p7) = (10,5,15,
7,6,18,3) and (w1,w2,…w7) = (2,3,5,7,1,4,1). 7,6,18,3) and (w1,w2,…w7) = (2,3,5,7,1,4,1).
3. a) Discuss single source shortest path with 3. a) Discuss single source shortest path with
Bellman Ford algorithm. (OR) Bellman Ford algorithm. (OR)
b) Find the solution for the given matrix using b) Find the solution for the given matrix using
Travelling Salesperson problem. Travelling Salesperson problem.

0 10 15 20 0 10 15 20
5 0 9 5 5 0 9 5
6 13 0 12 6 13 0 12
8 8 19 0 8 8 19 0
4.a) Find all possible solution of w to the sum to m. 4.a) Find all possible solution of w to the sum to m.
W ={ 5,7,10,12,15,18,20} , m = 15 (OR) W ={ 5,7,10,12,15,18,20} , m = 15 (OR)

Muthurangam Govt. Arts College(Autonomous),Vellore – 2 Muthurangam Govt. Arts College(Autonomous),Vellore – 2

PG and Research Department of Computer Science PG and Research Department of Computer Science
Model Theory Examinations– January 2022 Model Theory Examinations – January 2022
Subject Code :17P1CS1 Subject : Design and Analysis of Algorithms
Subject Code :17P1CS1 Subject : Design and Analysis of Algorithms
Time : 3 Hours Marks : 75 Time : 3 Hours Marks : 75
PART – A ( 5 x 6 = 30) PART – A ( 5 x 6 = 30)
Answer ALL the Questions Answer ALL the Questions
1. a) Write notes on Time and Space Complexity. 1. a) Write notes on Time and Space Complexity.
(OR) (OR)
b)Discuss Randomized algorithms with example. b)Discuss Randomized algorithms with example.
2. a) Explain briefly about Strassen’s Matrix 2. a) Explain briefly about Strassen’s Matrix
Multiplication. (OR) Multiplication. (OR)
b) Find an optimal solution to the Knapsack b) Find an optimal solution to the Knapsack
instance n = 7, m= 15, (p1,p2,…p7) = (10,5,15, instance n = 7, m= 15, (p1,p2,…p7) = (10,5,15,
7,6,18,3) and (w1,w2,…w7) = (2,3,5,7,1,4,1). 7,6,18,3) and (w1,w2,…w7) = (2,3,5,7,1,4,1).
3. a) Discuss single source shortest path with 3. a) Discuss single source shortest path with
Bellman Ford algorithm. (OR) Bellman Ford algorithm. (OR)
b) Find the solution for the given matrix using b) Find the solution for the given matrix using
Travelling Salesperson problem. Travelling Salesperson problem.

0 10 15 20 0 10 15 20
5 0 9 5 5 0 9 5
6 13 0 12 6 13 0 12
8 8 19 0 8 8 19 0
4.a) Find all possible solution of w to the sum to m. 4.a) Find all possible solution of w to the sum to m.
W ={ 5,7,10,12,15,18,20} , m = 15 (OR) W ={ 5,7,10,12,15,18,20} , m = 15 (OR)
 b) Find the solution using Dynamic programming b) Find the solution using Dynamic programming
for Travelling Salesperson problem for Travelling Salesperson problem

∞ 7 3 12 8 ∞ 7 3 12 8
3 ∞ 6 14 9 3 ∞ 6 14 9
5 8 ∞ 6 18 5 8 ∞ 6 18
9 3 5 ∞ 11 9 3 5 ∞ 11
18 14 9 9 ∞ 18 14 9 9 ∞

5. a) Discuss Bi-connected Components and Bi- 5. a) Discuss Bi-connected Components and Bi-
connected Graph with examples. connected Graph with examples.
(OR) (OR)
b) Explain Depth First Search and Breadth First b) Explain Depth First Search and Breadth First
Search algorithms. Search algorithms.

PART - B ( 3 x 15 = 45) PART - B ( 3 x 15 = 45)

Answer any THREE Questions Answer any THREE Questions

6. Explain Binary Search algorithm with an example. 6. Explain Binary Search algorithm with an example.
7. Discuss Quick algorithm with an example. 7. Discuss Quick algorithm with an example.
8. What is Multistage Graph. Explain its algorithm 8. What is Multistage Graph. Explain its algorithm
for shortest path with an example. for shortest path with an example.
9. Explain 8-Queens algorithm. 9. Explain 8-Queens algorithm.
10.Explain Minimum Cost Spanning Tree with their 10.Explain Minimum Cost Spanning Tree with their
algorithms. algorithms.

b) Find the solution using Dynamic programming b) Find the solution using Dynamic programming
for Travelling Salesperson problem for Travelling Salesperson problem

∞ 7 3 12 8 ∞ 7 3 12 8
3 ∞ 6 14 9 3 ∞ 6 14 9
5 8 ∞ 6 18 5 8 ∞ 6 18
9 3 5 ∞ 11 9 3 5 ∞ 11
18 14 9 9 ∞ 18 14 9 9 ∞

5. a) Discuss Bi-connected Components and Bi- 5. a) Discuss Bi-connected Components and Bi-
connected Graph with examples. connected Graph with examples.
(OR) (OR)
b) Explain Depth First Search and Breadth First b) Explain Depth First Search and Breadth First
Search algorithms. Search algorithms.

PART - B ( 3 x 15 = 45) PART - B ( 3 x 15 = 45)

Answer any THREE Questions Answer any THREE Questions

6. Explain Binary Search algorithm with an example. 6. Explain Binary Search algorithm with an example.
7. Discuss Quick algorithm with an example. 7. Discuss Quick algorithm with an example.
8. What is Multistage Graph. Explain its algorithm 8. What is Multistage Graph. Explain its algorithm
for shortest path with an example. for shortest path with an example.
9. Explain 8-Queens algorithm. 9. Explain 8-Queens algorithm.
10.Explain Minimum Cost Spanning Tree with their 10.Explain Minimum Cost Spanning Tree with their
algorithms. algorithms.