SRKR ENGINEERING COLLEGE ::BHIMAVARAM

Department of Computer Science and Engineering

3/4 B.Tech,2ND Semester, CLASS TEST

Academic Year: 2019-20 Program: B.Tech (CSE)

Year/Semester : III/II Sections: A,B,C,D,E
Name of the Course: DESIGN AND ANALYSIS OF ALGORITHMS Course Code: B17CS3203
Max Marks :30 Max Time :90 Minutes
Time: 10.00-11.30 a.m.

Instructions: 1. Answer all the Questions

2. All Questions carry equal marks

Q.N KL,CO,PO,PSO Question Marks

O

1. K3,CO3,PO3,PSO1 Apply dynamic programming (sets method) for solving the following 0/1
knapsack problem
Let knapsack capacity m=5
itemi 1 2 3 4
Profiti 100 20 60 40
K3,CO3,PO3,PSO1 Weighti 3 2 4 1

(OR)

Solve the following travelling salesperson problem using dynamic programming 10

Let the source and destination vertex be 1. The distance matrix is given by

1 0 2 9 10
2
3
4
[ 1
15
6
0
7
3
6
0
12
4
8
0
]
2. K3,CO4,PO3-PSO1 Apply backtracking algorithm to solve the following graph coloring problem and
draw its state space tree.

10

(OR)

Compare FIFOBB and LCBB with the help of state space tree for the following
K4,CO4,PO3,PSO1 knapsack intance n=4, (p1,p2,p3,p4)=(10,10,12,18),(w1,w2,w3,w4)=(2,4,6,9) and
m=15.

10
3. K6,CO5,PO4 Estimate lower bounds for ordered searching, sorting, merging, finding largest and
second largest elements
 (OR)

Demonstrate the applicability of modular arithmetic for large integer

K2,CO5,PO4 multiplication with an example.