Basics Data Structure Algorithms (BOE306) - AKTU Question Paper 2023-24
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 2023-24. 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 2023-24
Basics Data Structure Algorithms (BOE306) — complete question paper · 70 marks · 3 Hours
- aDefine Data structure. Descr ibe various types of it. 2 1
- bWhat is big oh in asymp totic notation? 2 1
- cConvert the following arithmetic infix expression into its equ ivalent prefix expression. Expression: A-B/C+D*E+F
- dWhat do you understand by stable a nd in place sorting? Explain. 2 3
- eDefine complete binary tree with suitable example. 2 4
- fDefine Threaded binary tree wi th advantage over binary tree. 2 4
- gHow graphs are represented in memory? Explain with the help of example
- aExplain Sparse Matrix and its representation. 7 1
- bDefine queue. Explain vari ous operations performed on queue with suitable example
- cUse quick sort al gorithm to sort 15,22,30,10,15,64,1,3,9,2. Is it a stable sorting algorithm? – Justify
- dDefine spanning tree. Also construct minimum spanning tree u sing prim’s algorithm for given graph
- eInsert the following element s in initially empty B-tree of degree 5
- aWrite a C program to insert a node at starting and particular position of singly linked list with n numbers of nodes
- bWrite a C function to perf orm insertion and deletion in an array. 7 1
- aState Tower of Hanoi problem. Write recursive algorithm to s olve it. 7 2
- bTranslate the infix string (a+b^c^d)*(e+f/d) to reverse poli sh notation using stack by showing every step
- aConsider a hash table with 9 slots. The hash function is h(k )=kmod9. The collisions are Resolved by chaining. The following 9 keys a re inserted in the order 5,28,19,15,10,33,12, 17,10. What are the maximum, minimum and average chain lengths in the hash table
- bHow binary search is different from linear search. Perform b inary search to find element 30 in the list: 12, 16, 20,27,30,32,40
- aWhat is Binary Search Tree? Write the algorithm to delete an element from the Binary Search Tree
- bDraw a binary tree which following traversal with each and e very step: In order: DBHEAIF J CG Preorder: ABDEHCFIJG
- aWrite an algorithm for BFS Tr aversal. Consider the graph given in figure. Perform Breadth first search beginning at vertex 1. List the vertices in which they are visited
- bExplain Warshal’s algorithm with the help of example. 7 5
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 (2023-24) Papers
Other subjects from same semester and session
Syllabus & More PYQs
Paper solve karne se pehle unit-wise syllabus dekh lo