Design And Analysis Of Algorithm (KCS-503) - AKTU Question Paper 2021-22
B.Tech · Semester 5 · Free PDF Download
This is the official AKTU Design And Analysis Of Algorithm Previous Year Question Paper for B.Tech Semester 5, academic session 2021-22. Published by Dr. A.P.J. Abdul Kalam Technical University (AKTU/UPTU), Lucknow. Free PDF download — no login required.
Course:B.Tech
Semester:Semester 5
Session:2021-22
University:AKTU / UPTU
Rate this paper
Questions Asked in 2021-22
Design And Analysis Of Algorithm (KCS-503) — extracted question text
Section AAttempt all q u e s t i o n s i n b r i e f . 2 x 10 = 20
- aHow analyze the performance of an algorithm in different cases?
- bDerive the time compl exity of Merge sort
- cExplain left rotation in RB tree
- dWrite down the propert ies of Fibonacci Heap
- eExplain Greedy programming in brief
- fWhat do you mean by convex hull?
- gWrite down the Floyd Warshal algorithm
- hExplain Branch and Bound method in brief. i. Explain Randomized algorithm in brief. j. Explain NP-complete and NP-Hard
Section BAttempt any three o f t h e f o l l o w i n g : 10 x 3 = 30
- aSolve the recurrence i) T (n) =3T (n/4) + cn2 using recursion tree method. ii) T (n) = n + 2T (n/2) using Iteration method. (Given T(1)=1)
- bWhat is Binomial Heap? Write down the algorithm for Decrease k ey operation in Binomial Heap also write its time complexity
- cWrite and explain the Kruskal algorithm to find the Minimum Sp anning Tree of
- agraph with suitable example
- dWhat is N queens problem? Draw a state space tree for 4 queens problem using backtracking
- eWrite Rabin Karp string matching algorithm. Working modulo q=11, how many spurious hits does the Rabin karp matcher in the text T= 3141592653589793, when looking for the pattern P=26
Section CAttempt any one p a r t o f t h e f o l l o w i n g : 10 x 1 = 10
- aWrite Merge sort algorithm and sort the following sequence {23, 11, 5, 15, 68, 31, 4, 17} using merge sort
- bWhat do you understand by stable and unstable sorting? Sort the following sequence {25, 57, 48, 36, 12, 91, 86, 32} using heap sort
- aDiscuss the various cases f or 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}
- bWhat is skip list? Explain the Search operation in Skip lis t with suitable example also write its algorithm
- aWhat is Knapsack problem? Solve 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 - bWrite down the Bellman Ford algorithm to solve the single s ource shortest path problem also write its time complexity
- aWhat is travelling salesman p roblem (TSP)? Find the solution of following TSP using Branch & Bound method
- bExplain the method of finding Hamiltonian cycles in a graph using backtracking method with suitable example
- aWrite and explain the algorith m to solve vertex cover probl em using approximation algorithm
- bExplain and Write the Knuth-Morris-Pratt algorithm for patt ern matching also write its time complexity
Question text is extracted from the official AKTU question paper PDF above. Check the original PDF for equations, diagrams and complete wording. Extracted: 2026-08-23.
Design And Analysis Of Algorithm — Other Year Papers
AKTU Design And Analysis Of Algorithm PYQs from other sessions
More B.Tech Semester 5 (2021-22) Papers
Other subjects from same semester and session
Advance Welding2021-22Ic Engine Fuel And Lubrication2021-22Application Of Soft Computing2021-22Optical Communication2021-22Web Technology2021-22Vlsi Technology2021-22Heat And Mass Transfer2021-22Compiler Design2021-22
View all B.Tech Semester 5 2021-22 papers →Syllabus & More PYQs
Paper solve karne se pehle unit-wise syllabus dekh lo