Data Structure (BCS301) - AKTU Question Paper 2023-24
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 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
Data Structure (BCS301) — complete question paper · 70 marks · 3 Hours
- aWhat are the various asymptotic notations? 2 1
- bWhy are parentheses needed to specify the order of operations in infix expressions but not in postfix operations?
- cHow the choice of pivot element effects the running time of qu ick sort algorithm?
- dWhat are the 2 different forms of hashing? 2 3
- eWhat is the significance of bina ry tree in Huffman algorithm? 2 4
- fWhat is the number of edges i n a regular graph of degree d and n vertices. 2 5
- gWrite an algorithm t o obtain the connected components of a graph. 2 5
- aWrite a Pseudo code that will concatenate two linked lists. Function should have two parameters, pointers to the beginning of the lists and the function should link second list at the end of the first list
- bWrite an algorithm to convert a valid arithmetic infix expre ssion into an equivalent postfix expression. Trace your algorithm for followi ng infix expression
- cWhat are the disadvantages of linear probing in hashing? Dis cuss how quadratic probing can be used to solve some of these problems
- dWrite C function for non-recu rsive post order traversal. 7 4
- eConsider the following graph and using Dijkstra Algorithm find the shortest path
- aEach element of an array Data [20][50] requires 4 bytes of s torage. Base address of Data is 2000. Determine the location of Data [10][10 ] when the array is stored as: (i) Row major (ii) Column ma
- bHow will you create link list representation of a polynomial . Explain it with the suitable example
- aWrite an algorithm to evaluate an arithmetic expression usin g stack and show how the expression 3*(5-3) will be evaluate
- bA double ended Queue (deque) is a linear list in which addit ions may be made at either end. Obtain a data representation mapping a deque int o one dimensional array. Write C function to add and delete elements from either end of deque
- aWrite a C program for sorting 100 integer numbers wring sele ction sort procedure. Discuss the worst-case time complexity of the algorithms
- bWrite a program in C language to implement binary search alg orithm. Also discuss the average behavior of the algorithm
- aIf E and I denotes the external and internal path length of a binary tree having n internal nodes then show that E=I+2n
- bSuppose character a, b, c, d,e,f has probabilities 0.07, 0.0 9, 0.12, 0.22, 0.23, 0.27 respectively. Find an optional Huffman code and draw the Huffman tree. What is the average code length?
- aFind the minimum spanning tree using Prim’s algorithm for th e graph shown below
- bWrite a program in C language to compute the indegree and ou tdegree of every vertex of a directed graph when the graph is represented by an adjacency matrix
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 to convert a valid arithmetic infix expre ssion into an equivalent postfix expression. Trace your algorithm for followi ng infix expression
Appeared in: 2023-24 · 2025-26
Data Structure — Other Year Papers
AKTU Data Structure 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