Basic Data Structure And Algorithms (KOE-035) - AKTU Question Paper 2021-22
B.Tech · Semester 3 · Free PDF Download
This is the official AKTU Basic Data Structure And Algorithms Previous Year Question Paper for B.Tech Semester 3, academic session 2021-22. 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 2021-22
Basic Data Structure And Algorithms (KOE-035) — complete question paper
- aWhat is big oh in asymptotic notation? 1
- bWrite the application of sparse matrix. 1
- cWhat is the condition if circular queue is full? 2
- dWrite the two advantages of circular singly linked list ove r singly linked list
- eDifferentiate internal sorting and external sorting also enlist s the name of one sorting techniques of each
- fWhat is difference between tree and graph? 4
- gShow the maximum number of node in a binary tree of height h is 2h+1
- hWhat is difference betwee n polish notation and reverse polish notation? 2 (i) Write the advantages of B+ tree? 3 (j) How to select Pivot e lement in quick short? 5
- aWhat is difference betwee n static and dynamic memory allocation? 1
- bWrite an algorithm to evalu ate postfix expression using stack. 2
- cHow to delete a node in binary search tree? Explain with th e help of example
- dExplain Dijiskatra Algorith m with the help of example. 4
- eBinary search is more effic ient than Linear search. Justify your answer. 5
- aIn 2-D array, each element of an array X [5] [4] requires 4 bytes of storage. Base address of X is 80. Determine the location of X [ 3] [2]. When the array is stored at Row major order and column major order
- bWrite a program in ‘C’ to imp lementation of reverse singly linked list. 2
- aConvert the following infix expression into postfix express ion using stack
- bWrite a program in ‘C’ to implementation of QUEUE. 2
- aWrite an algorithm to in-order tree traversal of binary tre e . A l s o Construct the binary tree of the following given traversal order In-order : M, E, P, A, Q, T, R, C, F, K. Post-order: M, P, E, Q, R, C, T, K, F, A
- bConstruct the steps to configure a B- tree of order 5 for t he following data
- aDiscuss the breadth first s earch traversal algorithm with example. 4
- b) W h a t is M i n im um c o s t o f s p a n n in g tre e ? E x p l a in k ru s k a l ’ s a lgorithm with example
- aWrite a quick sort algorithm. Use quick sort algorithm to s ort the following element: 15, 22, 30, 10, 15, 64, 1, 3, 9, and 52
- bWrite short notes on the following: (i) Priority Queue. (ii) Threaded binary tree
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 — KOE-035
Questions that appeared in more than one session, found by comparing 2 years of Basic Data Structure And Algorithms papers (2021-22, 2022-23)
What is the condition if circular queue is full? 2
Appeared in: 2021-22 · 2022-23
Write an algorithm to evalu ate postfix expression using stack. 2
Appeared in: 2021-22 · 2022-23
Basic Data Structure And Algorithms — Other Year Papers
AKTU Basic Data Structure And Algorithms PYQs from other sessions
More B.Tech Semester 3 (2021-22) Papers
Other subjects from same semester and session
Syllabus & More PYQs
Paper solve karne se pehle unit-wise syllabus dekh lo