Design Analysis Of Algorithm (KCS503) - AKTU Question Paper 2022-23
B.Tech · Semester 5 · Free PDF Download
This is the official AKTU Design Analysis Of Algorithm Previous Year Question Paper for B.Tech Semester 5, academic session 2022-23. 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:2022-23
University:AKTU / UPTU
Rate this paper
Questions Asked in 2022-23
Design Analysis Of Algorithm (KCS503) — extracted question text
Section AAttempt all questions in brief. 2x10 = 20
- aDiscuss the basic steps in the complete development of an a lgorithm
- bExplain and compare best and worst time complexity of Quick Sort
- cDiscuss Skip lis t and its operations
- dDiscuss the properties of binomial trees
- eIllustrate the applicatio ns of Graph Coloring Problem
- fDefine principle of optimality
- gDifferentiate Backtracking and Branch and Bound Techniques
- hDiscuss backtracking problem solving approach. (i) Define NP, NP hard and NP complete. Give example of each. (j) Explain Randomized algorithms
Section BAttempt any three of the following: 10x3 = 30
- aExplain Merge sort algorithm and sort the following sequenc e {23, 11, 5, 15, 68,31, 4, 17} using merge sort
- bWhat are the various differe nces in Binomial and Fibonacci Heap? Explain
- cProve that if the weights on the edge of the connected undi rected graph are distinct then there is a unique Minimum Spanning Tree. Give a n example in this regard. Also discuss Kruskal’s Minimum Spanning Tree in detail
- dDiscuss LCS algorithm to comp ute Longest Common Subsequence of two givenstrings and time complexity analysis
- eExplain and Write the Naïv e-String string matching algorithm: Suppose the given pattern p= aa b and given text T = a c a a b c. Apply Naïve-String Mat ching algorithm on above Pattern (P) and Text (T) to find the number of occurrences of P in T
Section CAttempt any one part of the following: 10*1 = 10
- aExamine the following recurrence relation
- bExplain algorithm for counti ng 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}
- aDiscuss 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}. Also show that a red-black tree with n internal nodes has height at most 2lg(n+1)
- bExplain and write an algorith m for union of two binomial heaps and write its time complexity
- aExplain “greedy algorithm” Write its pseudo code to prove that fractional Knapsack problem has a greedy-choice property
- bWhat are single source short est paths? Write down Dijkstra’s algorithm for it
- aWhat is the sum of subsets problem? Let w={5,7,10,12,15,18,20} and m=35. Find all possible subsets of w that sum to m using recursive backtracking algorithm for it. Draw the portion of the state-space tree that is generated
- bIllustrate n queen’s problem . Examine 4 queen’s problem usi ng back tracking method
- aWhat is string matching algorithm? Explain Rabin-Karp method with examples
- bExplain approximation algorit hm. Explore set cover problem using approximation algorithm
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.
More B.Tech Semester 5 (2022-23) Papers
Other subjects from same semester and session
Electronics Switching2022-23Computer Integrated Manufacturing2022-23Modern Construction Materials2022-23Object Oriented System Design With C++2022-23Digital Signal Processing2022-23Finite Element Methods2022-23Advance Digital Design Using Verilog2022-23Business Intelligence And Analytic2022-23
View all B.Tech Semester 5 2022-23 papers →Syllabus & More PYQs
Paper solve karne se pehle unit-wise syllabus dekh lo