B.TechSemester 32024-25Data StructureBCS301
View PDFDownload

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

B.Tech · Semester 3 · Free PDF Download

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

Rate this paper

Questions Asked in 2024-25

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

Section AAttempt all q u e s t i o n s i n b r i e f . 2 x 07 = 14
  • a
    Explain why do we need a pointer to maintain a linked list structure?
  • b
    If an array starts at address 2000 and each integer takes 4 byt es, evaluate the address of arr[5]?
  • c
    Explain Priority Queue and its significance?
  • d
    The following sequence of operations is performed on stack: PUS H (10), PUSH (20), POP, PUSH (10), PUSH (20), POP, POP, POP, PUSH (20), POP. Demonstrate the sequence of the value popped out? PUSH (20), POP, PUSH (10), PUSH (20), POP, POP, POP
  • e
    Illustrate the concept of Indexed Sequential search
  • f
    Explain the concept of NonLinear data structures with the help of example
  • g
    Illustrate the significance of Threaded Binary Tree
Section BAttempt any three o f t h e f o l l o w i n g : 07 x 3 = 21
  • a
    An array ARR[-5…15, 10…20] stores elements in Row Major Wise wi th each element requiring 2 bytes of storage. Evaluate the address of ARR[10][15] when the base address is 2500
  • b
    If a stack is implemented using Linked List, then show the logi cal representation of nodes as a stack. Illustrate PUSH and POP ope rations of this type of stack
  • c
    Construct a binary tree with the following traversals: Inorder: B C A E G D H F I J Preorder: A B C D E G F H I J
  • d
    Construct an AVL Tree by inserting following sequence of elemen ts, starting with an empty tree: 71,41,91,56,60,30,40,80,50,55
  • e
    Explain the Depth-First Search (DFS) algorithm with the help of an example graph. Which data structure is used for DFS and BFS?
Section CAttempt any one p a r t o f t h e f o l l o w i n g : 07 x 1 = 07
  • a
    Illustrate the following
  • a
    Asymptotic notations
  • b
    Illustrate how to represent the polynomial using linked list? C onstruct a C program to add two polynomials using linked list
  • a
    Construct a Queue using a linked list? Include functions insert (), delete(), print().Explain how a circular queue overcomes the limitations of a simple queue
  • b
    Construct a C program to check whether the parentheses are bala nced in an expression
  • a
    Construct a Hash table that contains 10 buckets and uses linear probing to resolve collisions. The key values are integers and the hash fu nction used is key % 10. Insert values 43, 165, 62, 123, 142 in the table. Sho w all the steps and find the location of the key value 142?
  • b
    Demonstratemerge sort algorithm to sort the following elements in ascending order : 11, 16, 13, 11, 4, 12, 6, 7. What is the time and space complexity of merge sort?
  • a
    Demonstrate B-Tree? Construct a B-Tree of order 4 with the alphabets (letters) arrive in the sequence as follows: a g f b k d h m j e s i r x c l n t u p
  • b
    Construct a Binary Search Tree (BST) using the following sequence of numbers: 50, 30, 70, 20, 40, 60, 80, 35, 45. Perform Inorder traversal of Tree
  • a
    Explain two ways to represent a graph in memory and compare the ir advantages: (i) Adjacency matrix (ii) Adjacency List
  • b
    Explain the following graph terminologies with examples: (i) Graph (ii) Weighted Graph (iii) Degree of a Vertex (iv) Connected and Disconnected Graph (v) Cycle in a Graph (vi) Directed and Undirected Graph (vii) MST

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.

Repeated Questions — BCS301

Questions that appeared in more than one session, found by comparing 3 years of Data Structure papers (2023-24, 2024-25, 2025-26)

2x

Construct an AVL Tree by inserting following sequence of elemen ts, starting with an empty tree: 71,41,91,56,60,30,40,80,50,55

Appeared in: 2024-25 · 2025-26

Data Structure — Other Year Papers

AKTU Data Structure PYQs from other sessions

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

More B.Tech Semester 3 (2024-25) Papers

Other subjects from same semester and session

Energy Science Engineering2024-25Food Science And Nutrition2024-25Cyber Security2024-25Basics Data Structure Algorithms2024-25Universal Human Values And Professional Ethics2024-25Automation And Robotics2024-25Sensor Instrumentation2024-25Computer Organization And Architecture2024-25
View all B.Tech Semester 3 2024-25 papers →

Syllabus & More PYQs

Paper solve karne se pehle unit-wise syllabus dekh lo

📘 Data Structure — Unit-wise SyllabusBCS301AKTU 2nd Year SyllabusAKTU 2nd Year PYQs — All BranchesCSE 2nd Year Syllabus