B.TechSemester 62021-22Design And Analysis Of AlgorithmKECZ603
View PDFDownload

Design And Analysis Of Algorithm (KECZ603) - AKTU Question Paper 2021-22

B.Tech · Semester 6 · Free PDF Download

This is the official AKTU Design And Analysis Of Algorithm Previous Year Question Paper for B.Tech Semester 6, 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 6
Session:2021-22
University:AKTU / UPTU

Rate this paper

Questions Asked in 2021-22

Design And Analysis Of Algorithm (KECZ603) — complete question paper

Section AAttempt all q u e s t i o n s i n b r i e f . 2*10 = 20
  • a
    Explain the reason behind the call of Heapify procedure onl y on first half elements of the given array while building a heap
  • b
    State the recurrence rela tion of Tower of Hanoi problem and solve it. 1
  • c
    Discuss the properties of Binomial Trees. 2
  • d
    Prove that a RB tree with n int ernal nodes has height atmost 2lg(n+1). 2
  • e
    Discuss that why a shortest path cannot contain a cycle? 3
  • f
    Differentiate between adjacency list and adjacency matrix representation of graphs
  • g
    What is branch and bound technique? 4
  • h
    Differentiate between Dynamic Programming and Divide & Conq uer approach. (i) Write down complexity of naïv e string matching algorithm. 5 (j) Differentiate between NP Ha rd and NP Complete problems. 5
Section BAttempt any three o f t h e f o l l o w i n g : 10*3 = 30
  • a
    Illustrate the working of t he counting sort algorithm on array A: {2, 0
  • b
    Show the final tree after inserting the following keys 22, 23, 44, 16, 43, 26, 11, 25, 36, 33, 18, in initially empty R-B tree in same sequence
  • c
    Define minimum cost spanning tree. Explain Prim’s algorithm for minimum spanning tree of a graph. Also write its Time-Complexity
  • d
    Illustrate the concept of backtracking on following sum-of- subset problem, 𝑛ൌ4 , Sum i.e. 𝑚ൌ1 3, and 𝑤𝑡ଵ ൌ3 , 𝑤 𝑡ଶ ൌ4 , 𝑤 𝑡ଷ ൌ 5, 𝑤𝑡ସ ൌ7 𝑎 𝑛 𝑑 𝑤 𝑡ହ ൌ8 . by building the search tree
  • e
    What is an approximation algorithm? What is meant by P(n) approximation algorithms? Discu ss approximation algorithm for vertex cover problem
Section CAttempt any one p a r t o f t h e f o l l o w i n g : 10*1 = 10
  • a
    Write Merge sort algorithm a nd discuss its time complexity. 1
  • b
    Apply quick sort to sort the keys as 12,13,10,5,7,3,2,17,23 ,16. Also write its algorithm and discuss the running time of the quick sort
  • a
    Illustrate the concept of t rie data structure by constructing trie after inserting following strings, “string, sting, streak, steak, stride, step, steep, ” in order and then delete “step, streak” in order
  • b
    Write the characteristics of a B-Tree of degree t. Create B -Tree of t=3 from the following lists of data items: 20, 30, 35, 85, 10, 55, 60, 25
  • a
    Define a Knapsack Problem and describe its formulation. Fin d the optimal solution by using Greedy Method to Knapsack Instance n= 5, w=[20,30,40,10,7], P=[700,800,900,100,600] and Capacity (C) of Knapsack is 80
  • b
    Show all steps of Strassen’s matrix multiplication algorith m using suitable example
  • a
    Define dynamic programming. Ho w this approach different fro m recursion? Explain with example
  • b
    Design an algorithm based upon dynamic programming for Lon gest Common Subsequence(LCS) and then calculate LCS of sequence X = <A, B, C, B, D, A, B > and Y=<B, D, C, A, B, A>
  • a
    Calculate the spurious hits in the text T= 3141592653589793 , pattern P = 26 and working modulo q=11, us ing Rabin-Karp string matching algorithm after writing algorithm for the same
  • b
    Demonstrate the concept of FFT (Fast Fourier Transformation ) with the help of an example

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.

Design And Analysis Of Algorithm — Other Year Papers

AKTU Design And Analysis Of Algorithm PYQs from other sessions

Design And Analysis Of Algorithm2023-24Design And Analysis Of Algorithm2021-22Design And Analysis Of Algorithm2023-24Design And Analysis Of Algorithm2024-25Design And Analysis Of Algorithm2025-26Design And Analysis Of Algorithm2025-26

More B.Tech Semester 6 (2021-22) Papers

Other subjects from same semester and session

Machine Design2021-22Repair And Rehabilitation Of Structures2021-22Idea To Business Model2021-22Control System2021-22Control System2021-22Microcontroller Embedded System Design2021-22Software Engineering2021-22Automotive Electrical And Electronics2021-22
View all B.Tech Semester 6 2021-22 papers →

Syllabus & More PYQs

Paper solve karne se pehle unit-wise syllabus dekh lo

AKTU 3rd Year PYQs — All Branches