B.TechSemester 52024-25Design And Analysis Of AlgorithmBCS503

Design And Analysis Of Algorithm (BCS503) - AKTU Question Paper 2024-25

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 2024-25. 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:2024-25
University:AKTU / UPTU

Rate this paper

Questions Asked in 2024-25

Design And Analysis Of Algorithm (BCS503) — complete question paper · 70 marks · 3 Hours

Section AAttempt all questions in brief. 2 x 07 = 14
  • a
    With example define algorithm. List few algorithm design techniques
  • b
    Briefly discuss the basic steps taken to design an algorithm
  • c
    Derive the time complexity of Heap Sort
  • d
    List the properties of Binomial Heap
  • e
    With a suitable example explain the concept of Convex –Hull Problem
  • f
    With a suitable example explain “Branch and Bound”
  • g
    Describe “Randomized algorithms”. List few randomized algorithms
Section BAttempt any three of the following: 07 x 3 = 21
  • a
    Illustrate the operation of Merge –Sort on array A= (38, 27, 43 , 3, 9, 82, 10). Also drive the time complexity of Merge Sort
  • b
    Define Binomial Heap. Write an al gorithm for union of two binom ial heaps. Also take a suitable example which clearly illustrates merging operation of tw o binomial heaps
  • c
    Apply the greedy single source shortest path algorithm on the g raph given below
  • d
    Write Floyd’s and Warshal’s algo rithm to find all pair shortest path in a graph. Discuss its time complexity
  • e
    Explain Vertex Cover Problem. Solve vertex cover problem using approximation algorithm
Section CAttempt any one part of the following: 07 x 1 = 07
  • a
    Write Quick –Sort partition algorithm. Drive best and worst cas e tim e complexity of quick sort
  • b
    Find out Upper, Lower and Average bounds for the function f (n) = 3n+2
  • a
    Insert the following string in the initially empty tries: DOG, DONE, CAT, CAN, RIGHT, DO, JUG, DAA, CA, CAME. Also make a compress tries of it
  • b
    Design a Binomial Heap for the following A.
      A= {7, 2, 4, 17, 1, 11, 6, 8, 15, 10, 20}
  • a
    Write and explain the Kruskal’s algorithm to find Minimum Sp anning Tree of a graph with a suitable example
  • b
    Find the optimal solution of the fractional Knapsack problem wi th n= 7 and the knapsack capacity of m=15. The profits and weights of t he items are given below. Objects: 1 2 3 4 5 6 7 Profit (P): 5 10 15 7 8 9 4 Weight (w): 1 3 5 4 1 3 2
  • a
    Illustrate the N-queens problem? Draw “State Space Tree” for 4 queen’s problem using backtracking
  • b
    Find the optimal solution to the 0/1 Knapsack instances wit h n=4 and
    Knapsack capacity m=8 where prof its and weights as follows : P= {1, 2,
    5,6} and W={2, 3, 4, 5}
  • a
    Explain P, NP, NP –Complete and NP-Hard complexity classes. How they are related to each other
  • b
    Write Knuth-Morris-Pratt stri ng matching algorithm. Take a s uitable example Compute the prefix function π for the pattern ababbabbabbababbabb when the alphabet is ∑ = {a, b}

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.