Data Structures PYQ 2023-24 AKTU Question Paper

AKTU · BTECH · Semester 3 · Data Structures · Session 2023-24 · PYQ

AKTU Data Structures previous year question paper 2023-24 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 2023-24

  1. Qa. What are the various asymptotic notations? (2 marks, 2023-24)
  2. Qb. Why are parentheses needed to specify the order of operations in infix expressions but not in postfix operations? (2 marks, 2023-24)
  3. Qc. How the choice of pivot element effects the running time of quick sort algorithm? (2 marks, 2023-24)
  4. Qd. What are the 2 different forms of hashing? (2 marks, 2023-24)
  5. Qe. What is the significance of binary tree in Huffman algorithm? (2 marks, 2023-24)
  6. Qf. What is the number of edges in a regular graph of degree d and n vertices. (2 marks, 2023-24)
  7. Qg. Write an algorithm to obtain the connected components of a graph. (2 marks, 2023-24)
  8. Qa. Write 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. (7 marks, 2023-24)
  9. Qb. Write an algorithm to convert a valid arithmetic infix expression into an equivalent postfix expression. Trace your algorithm for following infix expression. A+B*C-D/F (7 marks, 2023-24)
  10. Qc. What are the disadvantages of linear probing in hashing? Discuss how quadratic probing can be used to solve some of these problems. (7 marks, 2023-24)
  11. Qd. Write C function for non-recursive post order traversal. (7 marks, 2023-24)
  12. Qe. Consider the following graph and using Dijkstra Algorithm find the shortest path. (7 marks, 2023-24)
  13. Qa. Each element of an array Data [20][50] requires 4 bytes of storage. Base address of Data is 2000. Determine the location of Data [10][10] when the array is stored as: (i) Row major (ii) Column major (7 marks, 2023-24)
  14. Qa. Write an algorithm to evaluate an arithmetic expression using stack and show how the expression 3*(5-3) will be evaluate. (7 marks, 2023-24)
  15. Qa. Write a C program for sorting 100 integer numbers wring selection sort procedure. Discuss the worst-case time complexity of the algorithms. (7 marks, 2023-24)
  16. Qa. If E and I denotes the external and internal path length of a binary tree having n internal nodes then show that E=I+2n. (7 marks, 2023-24)
  17. Qa. Find the minimum spanning tree using Prim’s algorithm for the graph shown below: - (7 marks, 2023-24)
  18. Qb. How will you create link list representation of a polynomial. Explain it with the suitable example. (7 marks, 2023-24)
  19. Qb. A double ended Queue (deque) is a linear list in which additions may be made at either end. Obtain a data representation mapping a deque into one dimensional array. Write C function to add and delete elements from either end of deque. (7 marks, 2023-24)
  20. Qb. Write a program in C language to implement binary search algorithm. Also discuss the average behavior of the algorithm. (7 marks, 2023-24)
  21. Qb. Suppose character a, b, c, d,e,f has probabilities 0.07, 0.09, 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? (7 marks, 2023-24)
  22. Qb. Write a program in C language to compute the indegree and outdegree of every vertex of a directed graph when the graph is represented by an adjacency matrix. (7 marks, 2023-24)

AKTU paper codes: BCS301, KCS301, BCS301H, KCS301H

Data Structures previous year papers

More Data Structures resources

Browse all notes · Semester 3 notes