SITE18

April -2021
II B.Tech II Semester Regular Examinations
Algorithms Design And Analysis

Subject Code: 18CSCST4040

Time: 3hrs. Max Marks: 70

___________________________________________________________________
Instructions:
1. Answer all the questions from Part-A. Each question carries one mark.
2. Answer one full question from each unit in Part-B. Each full question carries 12 marks

PART – A

1 (a) State the Greedy Knapsack Problem. [1M]

(b) Define Principles of optimality. [1M]
(c) Define graph coloring [1M]

(d) Explain about Branch and Bound method. [1M]

(e) Explain about single source shortest path problem. [1M]
(f) Draw a strongly connected graph with n=4. [1M]
(g) Define NPH. [1M]
(h) What is tractable problem. [1M]
(i) Define Travelling Sales Person problem [1M]
(j) Discuss the technique for quick sort [1M]
2 a) Explain the general principle of Greedy method and also list the [5M]
applications of Greedy method.
b) Identify the solution generated by function Job Sequencing algorithm [7M]
when n=6 (P1…p6) = (3, 5, 20, 18, 1, 6), and (d1..d6) = (1, 3, 4, 3, 2, 1).

1
 OR
3 Construct an Optimal Binary Search Tree for n=4 identifiers (a1,a2,a3,a4) [12M]
= ( do,if, read, while) P(1:4)=(3,3,1,1) and Q(0:4)=(2,3,1,1,1)
4 a) Discuss the 4 – queen’s problem. Draw the portion of the state space tree [8M]
for n = 4 queens using backtracking algorithm.
b) Explain the basic principle of Backtracking and list the applications of [4M]
backtracking
OR
5 a)Explain the Graph – coloring problem. And draw the state space tree for m= [4M]
3 colors n=4 vertices graph
b) Explain the FIFO BB 0/1 Knapsack problem procedure with the knapsack [8M]
instance for n=4.m=15,(p1,p2,p3,p4)=(10,10,12,18) (w1,w2,w3,w4) =(2,
4, 6, 9).
6 a) Explain differences between Prim’s and Kruskal’s Minimum spanning [5M]
Tree algorithm.
b) Discuss the Dijkstra’s single source shortest path algorithm [7M]
OR
7 a) Explain Floyd warshall algorithm with an example graph n=5 [12M]
8 a) How are P and NP problems related? Give the relation between NP-hard [6M]
and NP problems
b) Explain about different types of NP problems. [6M]
OR
9 a) Explain non deterministic algorithms? Give some examples [6M]
b) Explain the P, NP, NP-Hard and NP-complete classes? Give relationship [6M]
between them
10 a) Explain load balancing problem with suitable example. [6M]
b) Explain median finding algorithm with an example group. [6M]
OR
11 a) Explain about approximation algorithms [4M]
b) Give an efficient greedy algorithm that finds an optimal vertex cover for a [8M]
tree in linear time.
>>>>>>>>>>>>>>>