MCASemester 22024-25Data Structures Analysis Of AlgorithmsKCA205
View PDFDownload

Data Structures Analysis Of Algorithms (KCA205) - 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 (KCA205) — complete question paper · 100 marks · 3 Hours

Section AAttempt all questions in brief. 2 x 10 = 20
  • a
    What is Theta (Θ) notation used for?
  • b
    If A[3][4]is stored in column-major order and each element takes 2 bytes, what is the address of A[1][2] if the base address is 500?
  • c
    How is tail recursion different from normal recursion?
  • d
    A linear queue is implemented using an array Q[5]. If front=1 and rear=3, how many elements are in the queue?
  • e
    How many passes are required to sort an array of 5 elements using bubble sort?
  • f
    What is an adjacency matrix?
  • g
    List the three main types of binary tree traversals
  • h
    How does a B-Tree differ from a binary search tree? 4 K2 i. How many comparisons are needed in quick sort to sort an array of 5 distinct elements in the worst case? j. What is the key difference between Bellman-Ford and Dijkstra’s algorithms?
Section BAttempt any three of the following: 10 x 3 = 30
  • a
    A 2D array B[6][5] is stored in column-major order. The base address is 2000, and each element occupies 2 bytes. (i) Derive the index formula to find the address of B[i][j] in column-major order. (ii) Use this formula to calculate the address of B[4][3]. (iii) Compare the memory location of B[4][3] in column-major vs. row-major order
  • b
    What is a circular queue? How does it overcome the limitations of a linear queue? Write C functions (or full program) for the following operations in a circular queue (using array) (i) Enqueue (ii) Dequeue
  • c
    What is Selection Sort? Write the algorithm and its C implementation. Sort the array [20, 12, 10, 15, 2] step-by-step using Selection Sort
  • d
    Insert the following keys into an initially empty AVL Tree: 20, 4, 15, 70, 50, 100, 80. Perform the following tasks:  Show the tree after each insertion.  Identify the type of rotation applied (if any).  Show the final balanced AVL Tree
  • e
    Define spanning tree. Also, construct a minimum spanning tree using Prim’s algorithm for the given graph
Section CAttempt any one part of the following: 10 x 1 = 10
  • a
    How to represent the polynomial using linked list? Write a C pr ogram to add two polynomials using linked list
  • b
    What are the various asymptotic notations? Explain Big O notation
  • a
    Write algorithm for Push and Pop operations in stack. Transform following expression into its equivalent postfix expression using stack: A+ (B*C –
  • b
    What is Hashing? Explain division method to compute the hash function and also explain the collision resolution strategies used in hashing
  • a
    Compare adjacency matrix and adjacency list representations of a graph
  • b
    Differentiate between DFS and BFS. Draw the breadth First Tree for the graph
  • a
    Draw a binary tree with the following traversals: Inorder: BCAEGDHFIJ Preorder: ABCDEGFHIJ
  • b
    What is a Threaded Binary Tree? Explain the advantages of using Threaded Binary Tree
  • a
    Explain Strassen’s matrix multip lication concept with an exampl e, derive its time complexity
  • b
    Write the Dijkstra algorithm for shortest path in a graph and also find the shortest path from ‘S’ to all remaining vertices of graph in the following graph

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 →