Basics Data Structure Algorithms (BOE306) - AKTU Question Paper 2024-25
B.Tech · Semester 3 · Free PDF Download
This is the official AKTU Basics Data Structure Algorithms 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
Basics Data Structure Algorithms (BOE306) — complete question paper · 70 marks · 3 Hours
Section AAttempt all questions in brief. 2 x 07 = 14
- aDefine the term Data Structure. Why do we need of data structure
- bDifferentiate the Static and Dynamic memory allocation
- dExplain the concept of Queue data structure
- eRecursion is the application of which data structure and how i s it applied with example
- fDiscuss the properties of minimum spanning tree
- gDifferentiate between tree and graph
Section BAttempt any three of the following: 07 x 3 = 21
- aWrite an algorithm or program to demonstrate insert the node in the beginning of the singly linked list
- bImplement C language to print Fibonacci series using recursive and non-recursive function
- cWhat is Stack? Write a C program or algorithm for linked lis t implementation of stack
- dWrite an algorithm for Quick sort. Use Quick sort algorithm to sort the following elements: 2, 8, 7, 1, 3, 5, 6, 4
- eWrite 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
Section CAttempt any one part of the following: 07 x 1 = 07
- aAn array A[50][60] is stored i n row major order with each element occupying 2 Bytes of memory. Consider Base address as 1000. Calculate the address of A[34][56]
- bExplain Asymptotic notation. I llustrate the various asymptot ic notations
- aWrite an algorithm for conver ting infix expression into post fix expression. Trace your algorithm for infix expression Q into it s equivalent postfix expression P
- bTo implement the Queue data structure using linked list, wri te the algorithm for Enqueue(x)
- aWhat is circular Queue? Write a C code or Algorithm to inser t an element in circular queue?
- bWrite an algorithm for Heap Sort. Use Heap sort algorithm, s ort the following sequence: 18, 25, 45, 34, 36, 51, 43, and 24
- aExplain the scenario of Tow er of Hanoi. Write the algorithm to solve the tower of Hanoi using recursion
- bExplain the concept of tail r ecursion. Write the algorithm t o find the factorial of a number ‘n’ using recursion
- aThe order of nodes of a binary tree in inorder and postorder traversal are as follows: In order : B, I, D, A, C, G, E, H, F. Post order: I, D, B, G, C, H, F, E, A. (i) Draw the corresponding binary tree. (ii) Write the pre order traversal of the same tree
- bWhat is spanning tree? Write down the Prim’s algorithm to ob tain minimum cost spanning tree. Use Prim’s algorithm to find the minimum cost spanning tree 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.
Basics Data Structure Algorithms — Other Year Papers
AKTU Basics Data Structure Algorithms PYQs from other sessions
More B.Tech Semester 3 (2024-25) Papers
Other subjects from same semester and session
Energy Science Engineering2024-25Food Science And Nutrition2024-25Data Structure2024-25Cyber Security2024-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