# Data Structures Past Papers Exam Questions

By: Prof. Fazal Rehman Shamil

## Guess Paper 1: Data Structures Fall – 2020 Past Papers

Time Allowed: 3 hours

Total Marks:    70, Passing Marks (35)

Q.1 Multiple Choice Questions (MCQs).
i. The situation when in a linked list START=NULL is ….
a. Underflow b. Overflow c. Houseful d. Saturated
ii. The operation of processing each elements in the list is known as……
a. sorting b. merging c. inserting d. traversal
iii. Which of the following is non-liner data structure?
a. Stacks b. List c. Strings d. Trees
iv. Stack is also Called as
a. Last in first out b. First in last out c. Last in last out d. First in first out
v. ………… is not the component of data structure.
a. Operations b. Storage Structures c. Algorithms d. None of above

Q.2 Define Queue and explain insertion, deletion and searching operations in the queue by giving an example.

Q.3 What is a Binary Search Tree (BST)? Make a BST for the following sequence of numbers.
45, 36, 76, 23, 89, 115, 98, 39, 41, 56, 69, 48
Traverse the tree in Preorder, Inorder and postorder.

Q.4 Write short note on linked list. Explain application of linked list.

Q.5 What is quick sort? Sort the following array using quick sort method.
24 56 47 35 10 90 82 31

Q.6 Define a stack. Describe ways to implement stack.

Q.7 Write a short note on abstract data type. Explain the properties of algorithm.

Q.8 Write short notes on any Two:-
(i) B Tree.
(ii) Time Complexity, Big O notation.
(iii) Merge Sort.
(iv) Depth First Traversal.

## Guess Paper 2: Data Structures Spring – 2020 Past Papers

Time Allowed: 3 hours

Total Marks:    70, Passing Marks (35)

Q.1 Multiple Choice Questions (MCQs).
1. Two dimensional arrays are also called
a. table arrays b. matrix arrays c. both of above d. none of above
2. Binary search algorithm cannot be applied to
a. sorted linked list b. sorted binary trees c. sorted linear array d. pointer array
3. When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
a. underflow b. overflow c. Housefull d. saturated
4. The term “push” and “pop” is related to the
a. array b. lists c. stacks d. all of above
5. A data structure where elements can be added or removed at either end but not in the middle is called
a. Linked lists b. Stacks c. Queues d. Deque

Q.2 Define Queue and explain insertion, deletion and searching operations in the queue by giving an example.

Q.3 What is Arithmetic expressions? Explain infix, postfix and prefix notations with the help of examples.
Q.4 What is a dynamic data structure? Briefly explain Linked list as a dynamic data structure. Explain search, insertion and deletion operation from a linear linked list with the help of example and pseudocode.
Q.5 What is Tree? Explain binary tree by giving example in detail.

Q.6 What is sorting? Explain Merge or Insertion sort algorithm and its complexity.
Sort the following array using merge/insertion sort.

Q.7 Write short notes on any two of the following:
a) Binary search tree
b) Multi Dimensional Arrays
c) Recursion
d) Heap

## Guess Paper 3: Data Structures Spring – 2019 Past Papers

Time Allowed: 3 hours

Total Marks:    50

Q1:                                                                                                                                          (Marks 6)

Explain the Perfect Binary Tree, Balanced Binary Tree, degenerate (or pathological) tree with the help of examples.

Q2:

Implement the doubly link list and show the insertion and deletion in double link list.     (Marks 6)

Q3:                                                                                                                                          (Marks 6)

Write the code in C++ to insert a node at the end in a single link list.

Q4:                                                                                                                                          (Marks 6)

Write the code in C++ to find a value from the queue.

Q5:                                                                                                                                          (Marks 6)

What is  Binary search tree. Write the code in C++ to insert the                   (Marks 6)

values in a BST.

Q4:                                                                                                                                          (Marks 10)

Write the code in C++ in which user enter a value and program will find the value from the doubly link list.

Q5:                                                                                                                                          (Marks 10)

Explain your semster project in maximum 50 words.

## Electrical Engineering Past Papers and Guess(EE)

1. Calculus & analytic geometry past papers
2. Introduction to computing past papers
3. Electricity and magnetism past papers
4. APPLIED LINEAR ALGEBRA past papers
5. Programming Fundamentals Past Papers
6. Electronic devices and circuits
7. Digital Logic Design DLD Past Papers
8. Basic Electronics & DLD Past Papers
9. Functional English Past Papers
10. Differential Equations Past Papers
11. Data Structures Past Papers
12. Electric Machines Past Papers
13. Network Analysis Past Papers
14. Numerical Analysis Past Papers
15. Signals Systems Past Papers
16. complex variables and transform past papers
17. Engineering drawing and AutoCAD past papers
18. Applied Thermodynamics Past Papers
19. Communication and presentation skills Past Papers
20. Field Theory Past Papers
21. Communication Systems Past Papers
22. Embedded Systems Past Papers
23. Basic Electronics Instrumentation Past Papers
24. Power Transmission Distribution Past Papers
25. Linear control systems Past Papers
26. Probability Methods in Engineering Past Papers
27. Engineering Economics Past Papers
28. Technical Report Writing Past Papers
29. Professional Ethics Past Papers