Data Structures PYQ 2019-20 AKTU Question Paper

AKTU · BTECH · Semester 3 · Data Structures · Session 2019-20 · PYQ

AKTU Data Structures previous year question paper 2019-20 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 2019-20

  1. Q1a. How can you represent a sparse matrix in memory? (2 marks, 2019-20)
  2. Q1b. List the various operations on linked list. (2 marks, 2019-20)
  3. Q1c. Give some applications of stack. (2 marks, 2019-20)
  4. Q1d. Explain Tail recursion. (2 marks, 2019-20)
  5. Q1e. Define priority queue. Given one application of priority queue. (2 marks, 2019-20)
  6. Q1f. How does bubble sort work? Explain. (2 marks, 2019-20)
  7. Q1g. What is Minimum cost spanning tree? Give its applications. (2 marks, 2019-20)
  8. Q1h. Compare adjacency matrix and adjacency list representations of graph. (2 marks, 2019-20)
  9. Q1i. Define extended binary tree, full binary tree, strictly binary tree and complete binary tree. (2 marks, 2019-20)
  10. Q1j. Explain threaded binary tree. (2 marks, 2019-20)
  11. Q2a. What are the merits and demerits of array? Given two arrays of integers in ascending order, develop an algorithm to merge these arrays to form a third array sorted in ascending order. (10 marks, 2019-20)
  12. Q2b. Write algorithm for Push and Pop operations in stack. Transform the following expression into its equivalent postfix expression using stack: A + (B * C - (D / E ↑ F) * G) * H (10 marks, 2019-20)
  13. Q2c. How binary search is different from linear search? Apply binary search to find item 40 in the sorted array: 11, 22, 30, 33, 40, 44, 55, 60, 66, 77, 80, 88, 99. Also discuss the complexity of binary search. (10 marks, 2019-20)
  14. Q2d. Find the minimum spanning tree in the following graph using Kruskal's algorithm: (10 marks, 2019-20)
  15. Q2e. What is the difference between a binary search tree (BST) and heap? For a given sequence of numbers, construct a heap and a BST. 34, 23, 67, 45, 12, 54, 87, 43, 98, 75, 84, 93, 31 (10 marks, 2019-20)
  16. Q3a. What is doubly linked list? What are its applications? Explain how an element can be deleted from doubly linked list using C program. (10 marks, 2019-20)
  17. Q3b. Define the following terms in brief: (i) Time complexity (ii) Asymptotic Notation (iii) Space complexity (iv) Big O Notation (10 marks, 2019-20)
  18. Q4a. (i) Differentiate between iteration and recursion. (ii) Write the recursive solution for Tower of Hanoi problem. (10 marks, 2019-20)
  19. Q4b. Discuss array and linked representation of queue data structure. What is dequeue? (10 marks, 2019-20)
  20. Q5a. Why is quick sort named as quick? Show the steps of quick sort on the following set of elements: 25, 57, 48, 37, 12, 92, 86, 33. Assume the first element of the list to be the pivot element. (10 marks, 2019-20)
  21. Q5b. What is hashing? Give the characteristics of hash function. Explain collision resolution technique in hashing. (10 marks, 2019-20)
  22. Q6a. Explain warshall's algorithm with the help of an example. (10 marks, 2019-20)
  23. Q6b. Describe the Dijkstra algorithm to find the shortest path. Find the shortest path in the following graph with vertex 'S' as source vertex. (10 marks, 2019-20)
  24. Q7a. Can you find a unique tree when any two traversals are given? Using the following traversals construct the corresponding binary tree: INORDER: H K D B I L E A F C M J G PREORDER: A B D H K E I L C F G J M Also find the Post Order traversal of obtained tree. (10 marks, 2019-20)
  25. Q7b. What is a B-Tree? Generate a B-Tree of order 4 with the alphabets (letters) arrive in the sequence as follows: a g f b k d h m j e s i r x c l n t u p (10 marks, 2019-20)

AKTU paper codes: BCS301, KCS301, BCS301H, KCS301H

Data Structures previous year papers

More Data Structures resources

Browse all notes · Semester 3 notes