Data Structures PYQ 2020-21 AKTU Question Paper

AKTU · BTECH · Semester 3 · Data Structures · Session 2020-21 · PYQ

AKTU Data Structures previous year question paper 2020-21 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 2020-21

  1. Q1a. Define Time-Space trade-off. (2 marks, 2020-21)
  2. Q1b. Differentiate Array and Linked list. (2 marks, 2020-21)
  3. Q1c. Explain Tail Recursion with suitable example. (2 marks, 2020-21)
  4. Q1d. Write the full and empty condition for a circular queue data structure. (2 marks, 2020-21)
  5. Q1e. Examine the minimum number of interchanges needed to convert the array 90, 20, 41,18, 13, 11, 3, 6, 8,12, 7, 71, 99 into a maximum heap. (2 marks, 2020-21)
  6. Q1f. Differentiate sequential search and binary search. (2 marks, 2020-21)
  7. Q1g. Compute the Transitive closure of following graph. (2 marks, 2020-21)
  8. Q1h. Write short notes on adjacency multi list representation a Graph. (2 marks, 2020-21)
  9. Q1i. What is the importance of threaded binary tree? (2 marks, 2020-21)
  10. Q1j. Write short notes on min heap. (2 marks, 2020-21)
  11. Q2a. Consider a multi-dimensional Array A[90] [30] [40] with base address starts at 1000. Calculate the address of A[10] [20] [30] in row major order and column major order. Assume the first element is stored at A[2][2][2] and each element take 2 byte. (10 marks, 2020-21)
  12. Q2b. Evaluate the following postfix expression using stack. 2 3 9 * + 2 3 ^ - 6 2 / + , show the contents of each and every steps. also find the equivalent prefix form of above expression. Where ^ is an exponent operator. (10 marks, 2020-21)
  13. Q2c. Explain any three commonly used hash function with the suitable example? A hash function H defined as H(key) =key%7, with linear probing, is used to insert the key 37,38,72,48,98,11,66 into a table indexed from 0 to 6. what will be the location of key 11? Justify your answer, also count the total… (10 marks, 2020-21)
  14. Q2d. Write an algorithm for Breadth First search (BFS) and explain with the help of suitable example. (10 marks, 2020-21)
  15. Q2e. If the in order of a binary tree is B,I,D,A,C,G,E,H,F and its post order is I,D,B,G,C H,F,E,A then draw a corresponding binary tree with neat and clear steps from above assumption. (10 marks, 2020-21)
  16. Q3a. Consider the two dimensional lower triangular matrix (LTM) of order N ,Obtain the formula for address calculation in the address of row major and column major order for location LTM[j][k], if base address is BA and space occupied by each element is w byte. (10 marks, 2020-21)
  17. Q3b. Write a C program to insert a node at kth position in single linked list. (10 marks, 2020-21)
  18. Q4a. Convert the following infix expression to reverse polish notation expression using stack. x = (-b + sqrt(b^2 - 4ac)) / 2a (10 marks, 2020-21)
  19. Q4b. Write a C program to implement stack using single linked list. (10 marks, 2020-21)
  20. Q5a. Write an algorithm for merge sort and apply on following elements 45,32,65,76,23,12,54,67,22,87. (10 marks, 2020-21)
  21. Q5b. Write a C program for Index Sequential Search. (10 marks, 2020-21)
  22. Q6a. Describe Prim`s algorithm and find the cost of minimum spanning tree using Prim`s Algorithm. (10 marks, 2020-21)
  23. Q6b. Apply the Floyd warshall’s algorithm in above mentioned graph (i.e. in Q.no 6a) (10 marks, 2020-21)
  24. Q7a. Write Short notes of following (a) Extended Binary Trees (b) Complete Binary Tree (c) Threaded Binary Tree. (10 marks, 2020-21)
  25. Q7b. Insert the following sequence of elements into an AVL tree, starting with empty tree 71,41,91,56,60,30,40,80,50,55 also find the minimum array size to represent this tree. (10 marks, 2020-21)

AKTU paper codes: BCS301, KCS301, BCS301H, KCS301H

Data Structures previous year papers

More Data Structures resources

Browse all notes · Semester 3 notes