Data Structure (BCS301) - AKTU Question Paper 2025-26
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 2025-26. Published by Dr. A.P.J. Abdul Kalam Technical University (AKTU/UPTU), Lucknow. Free PDF download — no login required.
Rate this paper
Questions Asked in 2025-26
Data Structure (BCS301) — complete question paper · 70 marks · 3 Hours
- aWhat is data structure? Give the classification of data structure in brief
- bWhat is the difference between array implementation and linked list implementation?
- cWhat do you understand by polish notion?
- dWrite the difference between stack and Queue in Data Structure
- eExplain the term Complete Binary Tree
- fWhat do you mean by recursion? Discuss advantages and disadvantages of recursion
- gDefine the Minimum spanning tree
- aWhat do you mean by complexity? Describe the asymptotic notation with a suitable diagram
- bWrite an algorithm for converting infix expression into postfix expression. Trace your algorithm for infix expression Q into its equivalent postfix expression P
- cWrite the algorithm of Insertion sort & sort the following list of numbers using insertion sort. 70, 17, 30, 80, 55, 1, 29, 67,15
- dWhat do you mean by Binary Search Tree? Construct a Binary Search Tree by inserting the following sequence of numbers. 10, 12, 5, 4, 20, 8, 7, 15 and 13
- eExplain linear probing and quadratic probing in hashing with examples
- aDiscuss doubly linked list. Write an algorithm to insert a node after a given node in a singly linked list
- bSuppose a three-dimensional array A is declared using A[1:10, -5:5, - (i) Find the length of each dimension and the number of elements in A (ii) Explain Row major order and Column Major Order in detail with explanation formula expression
- aWrite an algorithm for finding a solution to the Tower of Hanoi problem. Explain the working of your algorithm (with 4 disks) with diagrams
- bWrite a C program to implement a stack using a single linked list
- aWhat is Hashing? Explain division method to compute the hash function and also explain the collision resolution strategies used in hashing
- bWrite an algorithm for Heap Sort. Use Heap sort algorithm, sort the following sequence: 18, 25, 45, 34, 36, 51, 43, and 24
- aWrite Short notes of following
- bComplete Binary Tree
- cExtended Binary Tree
- a(Binary Search Trees)
- b(Complete Binary Tree)
- c(Extended Binary Tree)
- bInsert the following sequence of elements into an AVL tree, starting with empty tree 71,41,91,56,60,30,40,80,50,55
- aUse Prim’s Algorithm to compute MST for the given weighted graph
- bWrite and explain the Floyd Warshall algorithm to find the all-pair shortest path. Use the Floyd Warshall algorithm to find shortest path among all the vertices in the given 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.
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)
Write an algorithm for converting infix expression into postfix expression. Trace your algorithm for infix expression Q into its equivalent postfix expression P
Appeared in: 2023-24 · 2025-26
Insert the following sequence of elements into an AVL tree, starting with 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
More B.Tech Semester 3 (2025-26) Papers
Other subjects from same semester and session
Syllabus & More PYQs
Paper solve karne se pehle unit-wise syllabus dekh lo