Data Structures PYQ 2025-26 AKTU Question Paper

AKTU · BTECH · Semester 3 · Data Structures · Session 2025-26 · PYQ

AKTU Data Structures previous year question paper 2025-26 for B.Tech Semester 3. Covers Introduction, Arrays & Linked Lists, Stacks, Recursion & Queues…

Open the interactive reader to study this resource on AcademicArk.

Data Structures AKTU syllabus

  1. Unit 1: Introduction, Arrays & Linked Lists
  2. Unit 2: Stacks, Recursion & Queues
  3. Unit 3: Searching, Hashing & Sorting
  4. Unit 4: Trees
  5. Unit 5: Graphs

Questions in Data Structures AKTU PYQ 2025-26

  1. Q1a. What is data structure? Give the classification of data structure in brief. (2 marks, 2025-26)
  2. Q1b. What is the difference between array implementation and linked list implementation? (2 marks, 2025-26)
  3. Q1c. What do you understand by polish notion? (2 marks, 2025-26)
  4. Q1d. Write the difference between stack and Queue in Data Structure. (2 marks, 2025-26)
  5. Q1e. Explain the term Complete Binary Tree. (2 marks, 2025-26)
  6. Q1f. What do you mean by recursion? Discuss advantages and disadvantages of recursion. (2 marks, 2025-26)
  7. Q1g. Define the Minimum spanning tree. (2 marks, 2025-26)
  8. Q2a. What do you mean by complexity? Describe the asymptotic notation with a suitable diagram. (7 marks, 2025-26)
  9. Q2b. Write an algorithm for converting infix expression into postfix expression. Trace your algorithm for infix expression Q into its equivalent postfix expression P, Q: A + ( B * C – ( D / E ^ F) * G ) * H (7 marks, 2025-26)
  10. Q2c. Write the algorithm of Insertion sort & sort the following list of numbers using insertion sort. 70, 17, 30, 80, 55, 1, 29, 67, 15. (7 marks, 2025-26)
  11. Q2d. What 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. (7 marks, 2025-26)
  12. Q2e. Explain linear probing and quadratic probing in hashing with examples. (7 marks, 2025-26)
  13. Q3a. Discuss doubly linked list. Write an algorithm to insert a node after a given node in a singly linked list. (7 marks, 2025-26)
  14. Q3b. Suppose a three-dimensional array A is declared using A[1:10, -5:5, -10: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. (7 marks, 2025-26)
  15. Q4a. Write an algorithm for finding a solution to the Tower of Hanoi problem. Explain the working of your algorithm (with 4 disks) with diagrams. (7 marks, 2025-26)
  16. Q4b. Write a C program to implement a stack using a single linked list. (7 marks, 2025-26)
  17. Q5a. What is Hashing? Explain division method to compute the hash function and also explain the collision resolution strategies used in hashing. (7 marks, 2025-26)
  18. Q5b. Write an algorithm for Heap Sort. Use Heap sort algorithm, sort the following sequence: 18, 25, 45, 34, 36, 51, 43, and 24. (7 marks, 2025-26)
  19. Q6a. Write Short notes of following (a) Binary Search Trees (b) Complete Binary Tree (c) Extended Binary Tree (7 marks, 2025-26)
  20. Q6b. Insert the following sequence of elements into an AVL tree, starting with empty tree 71,41,91,56,60,30,40,80,50,55 (7 marks, 2025-26)
  21. Q7a. Use Prim’s Algorithm to compute MST for the given weighted graph (7 marks, 2025-26)
  22. Q7b. Write 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: (7 marks, 2025-26)

AKTU paper codes: BCS301, KCS301, BCS301H, KCS301H

Data Structures previous year papers

More Data Structures resources

Browse all notes · Semester 3 notes · Data Structures notes