Roll No.

___________________

KIET Group of Institutions

PUE Examination (2022-2023) ODD Semester

Department: CSE Course: B.Tech

Year: Third Semester: 5
Subject Name: Design and Analysis of Algorithm Subject Code: KCS-503

Duration: 3 Hrs Max. Marks: 100

Note: Attempt all the questions of each section
Section-A (2X10=20)
Q. 1 Competitive
Exam# CO BL/ KC*
Describe NP-complete and NP-Hard. Nielit Scientist 5
a B 2016 1F/C
b Enumerate Branch and Bound method. 4 2C/P
c Define convex hull? 3 1F/C
d Enumerate Randomized algorithm in brief. 5 2F/C
e Enumerate naive string matcher? 5 1F/P
f Define Skip List. 2 1F/C
g Write about stable sort? Name two stable sort algorithms. 1 2F/M
h Define Greedy approach. 3 1F/C
i Define principle of optimality. 3 2F/C
j Identify the running time complexity of 8 queen’s problem. 4 3F/C
Section-B (6X5=30)
Explain algorithm for counting sort? Illustrate the operation of counting
sort on the following array: A={0,1,3,0,3,2,4,5,2,4,6,2,2,3}
OR
Q. 2 1 4C/P
Examine the following recurrence relation:
ISRO CS
i. T (n) = T (n-1) + n4 2008
ii. T (n) = T (n/4) + T (n/2) + n2
Analyze B tree of degree 3 for the following sequence of keys. Examine
the structure in both cases after every insertion. 21, 30, 56, 17, 19, 48, 29,
24
Q. 3 2 4F/C
Illustrate Binomial Heap? Explain the algorithm for Decrease key
operation in Binomial Heap also write its time complexity.

Investigate greedy approach to an activity selection problem of

scheduling several competing activities. Apply following activity
selection problem S = {A1, A2, A3, A4, A5, A6, A7, A8, A9, A10}
Si = {1, 2, 3, 4, 7, 8, 9, 9, 11, 12} Fi = {3, 5, 4, 7, 10, 9, 11, 13, 12, 14}
OR
Q. 4 3 3F/C
Demonstrate Knapsack problem? Apply Fractional knapsack
problem using greedy programming for the following four items
with their weights w = {3, 5, 9, 5} and values P = {45, 30, 45, 10}
with knapsack capacity is 16.

Explain sum of subset problem? Discuss a state space tree for Sum of
subset problem using backtracking? Let n=6, m=30 and w [1:6] = {5, 10,
Q. 5
12, 13, 15, 18} 4 2F/P
OR
Explain the method of finding Hamiltonian cycles in a graph using
backtracking method with suitable example.

● CO -Course Outcome generally refer to traits, knowledge, skill set that a student attains after completing the course successfully.
● Bloom’s Level (BL) - Bloom’s taxonomy framework is planning and designing of assessment of student’s learning.
● *Knowledge Categories (KCs): F-Factual, C-Conceptual, P-Procedural, M-Metacognitive
● #Reference to Competitive Exams (GATE, GPAT, CAT, GRE, TOFEL, NET, etc. )
 Roll No. ___________________
Explain KMP algorithm for string matching? Compute the KMP
algorithm to search the occurrences of the pattern abaab in the text string
abbabaabaabab.
Q. 6 OR 5 2F/P
Summarize Rabin Karp string matching algorithm. Working modulo
q=11, Express spurious hits does the Rabin Karp matcher in the text
T= 3141592653589793, when looking for the pattern P=26.
Section-C (10X5=50)
Illustrate quick Sort on the array {7, 2, 3, 4, 9, 15, 6, 12, 11, 19,20}. Nielit Scientist
Analyze the worst-case time complexity of quick sort algorithm B CS 2016

Q. 7 1 4F/P
Discriminate stable and unstable sorting? Explore the following
sequence {25, 57, 48, 36, 12, 91, 86, 32} using heap sort.
Illustrate with the help of an example the consolidate operation in
Fibonacci heap.
Q. 8 2 4F/P
Diagram the various cases for insertion of key in red-black tree for
given sequence of key in an empty red-black tree- {15, 13, 12, 16,
19, 23, 5, 8}.
Illustrate minimum spanning tree (MST). Identify Prim’s algorithm to
generate a MST for any given weighted graph. Generate MST for the
following graph using Prim’s algorithm.

Q. 9 3 4F/P

OR
Illustrate Dijkstra’s algorithm to solve single source shortest path
problem with suitable example.
Illustrate travelling salesman problem (TSP)? Examine the solution of
following TSP using dynamic programming.
0 1 15 6
2 0 7 3
Q. 10 9 6 0 12 4 4F/P
10 4 8 0
OR
Illustrate n queen’s problem. Examine 4 queen’s problem using NIELIT
Scientist B
backtracking method? 2016

Investigate the following:

(i.) Randomized algorithm. (ii.) NP- complete and NP hard.
Q. 11 OR 5 4F/P
Explain approximation algorithm? Explore set cover problem using
approximation algorithm.

● CO -Course Outcome generally refer to traits, knowledge, skill set that a student attains after completing the course successfully.
● Bloom’s Level (BL) - Bloom’s taxonomy framework is planning and designing of assessment of student’s learning.
● *Knowledge Categories (KCs): F-Factual, C-Conceptual, P-Procedural, M-Metacognitive
● #Reference to Competitive Exams (GATE, GPAT, CAT, GRE, TOFEL, NET, etc. )