Data Structures PYQ 2022-23 AKTU Question Paper

AKTU · BTECH · Semester 3 · Data Structures · Session 2022-23 · PYQ

AKTU Data Structures previous year question paper 2022-23 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 2022-23

  1. Q1a. Define best case, average case and worst case for analyzing the complexity of a program. (2 marks, 2022-23)
  2. Q1b. Differentiate between binary search tree and a heap. (2 marks, 2022-23)
  3. Q1c. Write the condition for empty and full circular queue. (2 marks, 2022-23)
  4. Q1d. What do you understand by tail recursion? (2 marks, 2022-23)
  5. Q1e. Construct an expression tree for the following algebraic expression: (a - b) / ((c * d) + e) (2 marks, 2022-23)
  6. Q1f. Differentiate between internal sorting and external sorting. (2 marks, 2022-23)
  7. Q1g. What are the advantages and disadvantages of array over linked list? (2 marks, 2022-23)
  8. Q1h. Write an algorithm for Breadth First Search (BFS) traversal of a graph. (2 marks, 2022-23)
  9. Q1i. In a complete binary tree if the number of nodes is 1000000. What will be the height of complete binary tree. (2 marks, 2022-23)
  10. Q1j. Which data structure is used to perform recursion and why? (2 marks, 2022-23)
  11. Q2a. Assume that the declaration of multi-dimensional arrays X and Y to be, X (-2:2, 2:22) and Y (1:8, -5:5, -10:5) (i) Find the length of each dimension and number of elements in X and Y. (ii) Find the address of element Y (2, 2, 3), assuming Base address of Y = 400 and each element occupies 4 memory… (10 marks, 2022-23)
  12. Q2b. What is Stack? Write a C program for linked list implementation of stack. (10 marks, 2022-23)
  13. Q2c. Write an algorithm for Quick sort. Use Quick sort algorithm to sort the following elements: 2, 8, 7, 1, 3, 5, 6, 4 (10 marks, 2022-23)
  14. Q2d. Write 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: (10 marks, 2022-23)
  15. Q2e. The 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. (10 marks, 2022-23)
  16. Q3a. How to represent the polynomial using linked list ? Write a C program to add two polynomials using linked list. (10 marks, 2022-23)
  17. Q3b. Discuss doubly linked list. Write an algorithm to insert a node after a given node in singly linked list. (10 marks, 2022-23)
  18. Q4a. 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 (10 marks, 2022-23)
  19. Q4b. What is circular Queue? Write a C code to insert an element in circular queue? (10 marks, 2022-23)
  20. Q5a. What is Hashing? Explain division method to compute the hash function and also explain the collision resolution strategies used in hashing. (10 marks, 2022-23)
  21. Q5b. Write an algorithm for Heap Sort. Use Heap sort algorithm, sort the following sequence: 18, 25, 45, 34, 36, 51, 43, and 24. (10 marks, 2022-23)
  22. Q6a. What is spanning tree? Write down the Prim’s algorithm to obtain minimum cost spanning tree. Use Prim’s algorithm to find the minimum cost spanning tree in the following graph: (10 marks, 2022-23)
  23. Q6b. 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: (10 marks, 2022-23)
  24. Q7a. Discuss left skewed and right skewed binary tree. Construct an AVL tree by inserting the following elements in the order of their occurrence: 60, 2, 14, 22, 13, 111, 92, 86. (10 marks, 2022-23)
  25. Q7b. What is B-Tree? Write the various properties of B- Tree. Show the results of inserting the keys F, S, Q, K ,C, L, H, T, V, W, M, R, N, P, A, B in order into a empty B-Tree of order 5. (10 marks, 2022-23)

AKTU paper codes: BCS301, KCS301, BCS301H, KCS301H

Data Structures previous year papers

More Data Structures resources

Browse all notes · Semester 3 notes