BCASemester 22024-25Data StructureBBC203
View PDFDownload

Data Structure (BBC203) - AKTU Question Paper 2024-25

BCA · Semester 2 · Free PDF Download

This is the official AKTU Data Structure Previous Year Question Paper for BCA 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:BCA
Semester:Semester 2
Session:2024-25
University:AKTU / UPTU

Rate this paper

Questions Asked in 2024-25

Data Structure (BBC203) — complete question paper · 70 marks · 3 Hours

Section AAttempt all questions in brief. 02 x 7 = 14
  • a
    Differentiate between linear and non-linear data structures
  • b
    What is a sparse matrix? Give an example
  • c
    What is over flow and under flow in the context of queues?
  • d
    What is a threaded binary tree?
  • e
    Convert the expression ((A+B)* (C-D))to a binary expression tree
  • f
    Construct a Max-Heap from the elements: [10,15,20,17, 8]
  • g
    State the applications of B-Trees in databases
Section BAttempt any three of the following: 07 x 3 = 21
  • a
    Describe stack operations with algorithms for push and pop. What are the applications of stacks?
  • b
    What is the limitation of a linear queue implemented using arrays? How does the circular queue resolve this?
  • c
    Discuss binary search tree. Construct a binary search tree using the following elements: 50, 30, 70, 20, 40, 60, 80. Perform in order traversal. Explain the working of merge sort with suitable example. Provide its divide-and-conquer approach and discuss its time complexity in best, average, and worst cases
  • e
    What is a B-Tree? How is it different from a binary tree? Create a B-tree of order 3 using the keys: 10, 20, 5, 6, 12, 30, 7, 17
Section CAttempt any one part of the following: 07 x 1 = 07
  • a
    Convert the in fix expression A*(B+C)/D-E in to post fix and prefix Notation .Show all steps
  • b
    Write detailed notes on recursion. Explain Tower of Hanoi problem using Recursion
  • a
    Differentiate between static and dynamic memory allocation. How is it Implemented using linked lists?
  • b
    Given a linked list:10→20→30→40,insert 25 between 20 and 30. Write algorithm and show memory diagram
  • b
    Create a hash table of size 10 using modulo division. Insert the following elements using linear probing: 23, 43, 13, 27, 98, 62
  • a
    Describe the binary search algorithm. How is it different from linear search? Discuss their time complexities
  • b
    Construct an AVL Tree by inserting:50,30,70,10,40,60,80. Show the Rotations performed to balance the tree
  • a
    Define graph, multi graph, and weighted graph with real-life examples. Differentiate between directed and undirected graphs with diagrams. Differentiate between spanning tr e e a n d m i n i m u m s p a n n i n g t r e e using suitable diagram. What is Kruskal’s algorithm? Explain the step -by-step procedure used to construct a minimum spanning tree using 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 Structure — Other Year Papers

AKTU Data Structure PYQs from other sessions

Data Structure2021-22Data Structure2022-23Data Structure2023-24Data Structure2024-25Data Structure2025-26

More BCA Semester 2 (2024-25) Papers

Other subjects from same semester and session

Digital Electronics2024-25Professional Communication2024-25Discrete Mathematics2024-25Information Systems2024-25
View all BCA Semester 2 2024-25 papers →