Scribd
Upload
60 views4 pages

17YCS601 - Design and Analysis of Algorithm - Set-1

Sandip Uni

Uploaded by

emmettsteveson2
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
60 views4 pages

17YCS601 - Design and Analysis of Algorithm - Set-1

Sandip Uni

Uploaded by

emmettsteveson2
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/ 4

Sr.

No: 225052/55/57/61
PRN

DEGREE EXAMINATION, DEC. 2022


(Regulations 2017)

17YCS601– DESIGN AND ANALYSIS OF ALGORITHM

Time: Three Hours Maximum Marks: 100

Instructions to the candidate:


 Figures to the right indicate full marks.
 Usage of non-programmable calculator is permitted.
 Draw neat sketches and diagram wherever is necessary.
 Part C is compulsory.
___________________________________________________________
Answer All Questions
PART A - (10 x 2 = 20 Marks)

1. Define the term Algorithm. (2) K1 CO1

2. Define Big ‘Oh’ notation. (2) K3 CO1

3. Define minimum spanning tree problem. (2) K2 CO2

4. Define time complexity and space complexity. (2) K1 CO2

5. Enlist the various application of Divide and conquer (2) K2 CO3

strategy.
6. State the various application of Greedy method. (2) K2 CO3

7. State the principal of optimality in dynamic (2) K2 CO4

programming.
8. Compare the greedy strategy and dynamic strategy. (2) K1 CO4

9. Define the state space tree. (2) K4 CO5

10. Discuss backtracking versus branch and bound. (2) K1 CO5

Page 1 of 4
PART B - (4 x 15 = 60 Marks)

11. (a) (i) Explain Merge sort algorithm with example. (8) K1 CO1

(ii) Explain Asymptotic Notations. (7) K2 CO1

(OR)
(b) (i) Illustrate Divide and Conquer strategy with (8) K3 CO1

algorithm.
(ii) Given the jobs, their deadlines and associated (7) K2 CO1

profits as shown-Find the solution :

Jobs J1 J2 J3 J4 J5 J6
Deadlines 5 3 3 2 4 2
Profits 200 180 190 300 120 100

12. (a) (i) Consider the following instances of (10) K1 CO2

Knapsack problem find the solution using


Greedy method IF M=20 and N=3. Profit P=
{30, 21, 18}, Weight W={18, 15, 10}
(ii) Write in detail about Hamiltonian cycles. (5) K4 CO2

Give example to it.


(OR)
(b) (i) Explain the graph coloring problem. And (7) K1 CO2

draw state space tree for m=3 colors , n=4


vertices graph.
(ii) Apply the kruskal’salgorithm to find (8) K1 CO2

Page 2 of 4
minimum spanning tree of the following
graph

13. (a) (i) Obtain the solution to knapsack problem by (8) K2 CO3

Dynamic Programming method n=6,


(p1p2,...p6)=(w1,w2,...w6)=(100,50,20,10,7,
3)and m=165.
(ii) Explain the binary search algorithm and find (7) K1 CO3

out its time complexity.


(OR)
(b) (i) Solve the 0/1 Knapsack Problem using (8) K3 CO3

dynamic programming: N=4 ,M=25


,(P1,P2,P3,P4)=(10,12,14,16) ,
(W!,W2,W3,W4)=(9,8,12,14)
(ii) Compare prims and Kruskal’s algorithm for (7) K2 CO3

finding the minimum spanning tree.

14. (a) (i) What is the optimal binary search tree (8) K2 CO4

problem? Explain how it is solved using


dynamic programming.
(ii) Explain the control abstractions for Greedy (7) K4 CO4

Approach.

Page 3 of 4
(OR)
(b) (i) Write Dijkstra's algorithm and apply the same (8) K4 CO4

to find single source problem for the


following graph taking vertex, a, as source?

(ii) Apply Branch Bound technique to Solve the (7) K1 CO4

TSP Problem with following instances.

PART C – Compulsory (1 x 20 = 20 Marks)

15. (i) Solve the 4-queen problem and draw its state (10) K1 CO5
space tree.
(ii) Explain LC Search, LIFO and FIFO branch and (10) K1 CO5
bound strategy.

Page 4 of 4

You might also like