MCASemester 22024-25Data Structures Analysis Of AlgorithmsBMC205
View PDFDownload

Data Structures Analysis Of Algorithms (BMC205) - AKTU Question Paper 2024-25

MCA · Semester 2 · Free PDF Download

This is the official AKTU Data Structures Analysis Of Algorithms Previous Year Question Paper for MCA Semester 2, academic session 2024-25. Published by Dr. A.P.J. Abdul Kalam Technical University (AKTU/UPTU), Lucknow. Free PDF download — no login required.

Course:MCA
Semester:Semester 2
Session:2024-25
University:AKTU / UPTU

Rate this paper

Questions Asked in 2024-25

Data Structures Analysis Of Algorithms (BMC205) — complete question paper · 70 marks · 3 Hours

Section AAttempt all questions in brief. 02 x 7 = 14
  • a
    Define abstract data type (ADT)
  • b
    Mention one key difference betw een an algorithm and a program. 1 K 1
  • c
    What is tail recursion?
  • d
    What is the worst-case time com plexity of sequential search? 2 K 1
  • e
    What is the basic idea be hind counting sort?
  • f
    Define complete binary tree. Give example
  • g
    What is the basic idea behind divide and conquer strategy? 5 K 1
Section BAttempt any three of the following: 07 x 3 = 21
  • a
    Define data structure. Describe about its need and types
  • b
    What is a Stack? Describe t he array and linked list implementation of a stack in C. Compare both in terms of memory usage and flexibility
  • c
    Explain the working of Inser tion Sort with an example. What is its time complexity in the best, average, and worst cases?
  • d
    Draw a binary tree with following traversal : Inorder : D B H E A I F J C G Preorder : A B D E H C F I J G
  • e
    Define spanning tree. Find the minimal spanning tree for the following graph using Prim’s algorithm
Section CAttempt any one part of the following: 07 x 1 = 07
  • a
    Define array. Explain Row Maj or Order and Column Major Order representations of a 2-D array with suitable examples
  • b
    Explain the concept of asymp totic notations. Compare and contrast Big O, Theta (Θ), and Omega (Ω) notations with appropriate examples for each
  • a
    Explain circular queue. What is the condition if circular queue is full?
  • b
    What is hashing? How is it u sed in search operations? Explain the importance of a good hash function
  • a
    Explain Depth First Search ( DFS) and Breadth First Search (BFS) algorithms with examples. How are they used to identify connected components in a graph?
  • b
    Describe the Heap Sort algori thm. How is a max-heap constructed, and how does it help in sorting an array?
  • a
    Define binary search tree. Create BST for the following data , show all steps
  • b
    What is a B-Tree? Construct a B-tree on following sequence o f inputs. Assume that the order of the B-tree is 3
  • a
    Explain the Divide and Conquer strategy with examples. How do Merge Sort and Quick Sort apply this technique, and how do they differ in terms of time complexity and space usage?
  • b
    Explain Dijkstra’s algorithm with suitable 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.

Data Structures Analysis Of Algorithms — Other Year Papers

AKTU Data Structures Analysis Of Algorithms PYQs from other sessions

Data Structures Analysis Of Algorithms2021-22Data Structures Analysis Of Algorithms2022-23Data Structures Analysis Of Algorithms2023-24Data Structures Analysis Of Algorithms2024-25

More MCA Semester 2 (2024-25) Papers

Other subjects from same semester and session

Operating Systems2024-25Database Management Systems2024-25Theory Of Automata Formal Languages2024-25Object Oriented Programming2024-25Web Technology2024-25Database Management Systems2024-25Operating Systems2024-25Object Oriented Programming2024-25
View all MCA Semester 2 2024-25 papers →