Roll No.

___________________

KIET Group of Institutions

CT Examination (2022-2023) ODD Semester

Department: CSE Course: B.Tech

Year: 3rd Year Semester: V
Subject Name: Design and Analysis of Algorithms Subject Code: KCS-503

Duration: 2 Hrs Max. Marks: 60

Note: Attempt all the questions of each section
Section-A (2X10=20)
Q. 1 Attempt all Questions Competitive
Exam# CO BL/ KC*
a Compare the performance of various Algorithms? GPAT 2017 1 2F/C
b Explain Asymptotic Notation. 2 2F/C
c Illustrate the properties of Binomial tree? 1 3F/C
d Describe the mean of convex hull? GATE 2002 1 1F/C
e Derive the complexity of Merge Sort? GATE 1996 1 3F
f Explain searching technique using divide and conquer approach. 1 2C
g Define stable and unstable sorting? GATE 2001 2 2F
h Explain Skip list in brief. 2 2C
i Describe the Order of Algorithm? UGC NET
1 1F/C
2003
j Compare time Complexity of different sorting techniques? TOFEL
1 2P
2020
Section-B (5X4=20)
Explain the different conditions of getting union of two binomial heap. CAT 1995
Q. 2 OR 1 2F/C
Compare the various differences in Binomial and Fibonacci Heap? Explain. CAT 2003
Design an algorithm to count the number of leaf node in a binary tree t. What is its
computing time?
Q. 3 OR 1 5C
Design an algorithm to find the sum of smallest log2n elements in an unsorted array of
n distinct element in O(n) time.
Show the result of inserting the keys F, S, Q,K, C,L, H, T,V, W, M, R, N, P, A, B,X, Y,
D, Z, E in order into an empty B tree. Only draw the configurations of the tree just TOFEL
before some node must split and also draw the final configuration. 2020
Q. 4 Use t=4, where t is minimum degree of B Tree. 1 3F/C
OR
Demonstrate the algorithm to delete a given element in a binomial heap. Give an
example for the same.
Solve the following recurrence relation:
i. T (n) = T (n-1) + n4 GPAT 2003
Q. 5 ii. T (n) = T (n/4) + T (n/2) + n2 1 3F/C
OR
Demonstrate heap sort on the following sequence {25, 57, 48, 36, 12, 91, 86, 32}
Section-C (10X2=20)
Illustrate an algorithm for quick sort. Find the time complexity of quick sort in all
GATE 2020
cases.
Q. 6 1 4C/P
OR
Illustrate an algorithm for shell sort. Find the time complexity of shell sort in all cases.
Q. 7 Examine algorithm for insertion of key in the Red-Black Tree. Discuss the various 1/2 4C/P
cases for insertion of key in the Red-Black tree for the given sequence of key in an
empty red black tree 5,16, 22, 25, 2, 10, 18, 30, 50,12,1.

● 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. ___________________
OR
Investigate HEAP-SORT on the array. Illustrate the operation of HEAP-SORT on the CSIR NET
array A= {6, 14, 3, 25, 2, 10, 20, 7, 6} 2006

● 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. )