Design And Analysis Of Algorithm (KCS503) - AKTU Question Paper 2023-24
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 2023-24. Published by Dr. A.P.J. Abdul Kalam Technical University (AKTU/UPTU), Lucknow. Free PDF download — no login required.
Rate this paper
Questions Asked in 2023-24
Design And Analysis Of Algorithm (KCS503) — complete question paper · 100 marks · 3 Hours
- aWhat do you mean by algorithm? Writ e the characteristic of algorithm
- bShow that equation are correct : 10n 2+9 = O(n2)
- cWrite short note on Fibonacci Heap
- dExplain Binary Search Tree
- eDefine fractional Knap-Sack problem
- fWrite name of Spanning tree algorithm with complexity
- gDefine the term “Graph Coloring”
- hWhat do you mean by Activit y selection problem? i. What do you mean by Boyer-M oore Algorithm? j. Write short note on Fast Fourier Transform
- aSort the followin g array by counting sort A={2,5,3,0,2,3,0,3}
- bProve all the four propert ies of Binomial Tree
- cDescribe DFS with its algor ithm. How DFS can be used to solve the problem
- dApply Floyd-Warshall algorithm for constructing shortest path
- eWrite short notes on the following: i) Randomized Algorithm. ii) Approximation algorithm
- aWhat is stable sorting algorithm? Which of the sorting algor ithms we have seen are stable and which are unstable? Give name with explanation
- bWrite an algorithm of merge s ort and prove its worst time complexity
- aInsert the following element s using the property of RB tree
- bExplain B-Tree and its proper ties. Also write B-Tree deletio n cases with example
- aDetermine an LCS of X={A,B,C, B,D,A,B} and Y={B,D,C,A,B,A}
- bExplain Backtracking. Let set S= {1,3,4,5}and X=8, we have t o find subset sum problem using backtracking approach
- aWrite an algorithm of Dijkstr a and implement it by taking any example
- bApply Branch and Bound technique to solve travelling salesma n problem for the graph whose cost matrix given below: Cost matrix= 15 18 ∞ 16 28
- aExplain P, NP, NP Hard and NP Co mplete Classes with example
- bExplain KMP matcher and also implement it by an algorithm, w here P=a,a,b,a,b,b,a and T=b,a,b,a,a,b,a,b,b,a
Question text is extracted from the official AKTU question paper PDF above. Hindi translations are omitted — every question is printed in English in the original paper. Last verified: 2026-08-23.
Repeated Questions — KCS503
Questions that appeared in more than one session, found by comparing 3 years of Design And Analysis Of Algorithm papers (2021-22, 2022-23, 2023-24)
Write short note on Fibonacci Heap
Appeared in: 2021-22 · 2023-24
Prove all the four propert ies of Binomial Tree
Appeared in: 2022-23 · 2023-24
Design And Analysis Of Algorithm — Other Year Papers
AKTU Design And Analysis Of Algorithm PYQs from other sessions
More B.Tech Semester 5 (2023-24) Papers
Other subjects from same semester and session
Syllabus & More PYQs
Paper solve karne se pehle unit-wise syllabus dekh lo