This document contains a 50 question quiz on data structures. The questions cover topics like linked lists, stacks, queues, trees, sorting algorithms, hashing and more. For each question there are 4 multiple choice answers and the correct answer is indicated. The quiz is assessing understanding of fundamental data structure concepts and their applications.

1. SHRI RAWATPURA SAKAR INSTITUTE OF TECHNOLOGY, NEW RAIPUR
BE CSE 4th
SEMESTER
Data Structure Quiz Question
1. Which of the following points
is/are true about Link List data
structure when it is comparedwith
array?
a) Arrays have better cache locality
that can make them better in terms of
performance
b) It is easy to insert and delete
elements in Linked List
c) Random access is not allowed in
typical implementation of Linked
Lists
d) All of the above
Ans: D
2. Which of the following
algorithms canbe used to sort a
random link list with minimum
time complexity?
a) Insertion Sort
b) Quick Sort
c) Merge Sort
d) Heap Sort
Ans: C
3. Which one of the following is the
application of stack data structure?
a) Managing function calls
b) The stockspan problem
c) Arithmetic expression evolution
d) All of the above
Ans:D
4. Which of the following is true
about linked list implementation of
stack?
a) In push operation, if new nodes are
inserted at the beginning of link list,
then in poop operation, nodes must be
removed from end.
b) In push operation, if new nodes are
inserted at the end, then in pop
operation, nodes must be removed
from beginning.
c) Both of the above
d) None of the above.
Ans: D
5. Which one of the following is an
application of Queue data
structure?
a) When a resource is shared among
multiple consumers
b) When data is transferred
asynchronously between 2 processes
c) Load balancing
d) All of the above
Ans: D
6. How many stacks are neededto
implement a queue. Considerthe
situation where no other data
structure like arrays, linked list is
available to you.
a) 1
b) 2

2. SHRI RAWATPURA SAKAR INSTITUTE OF TECHNOLOGY, NEW RAIPUR
BE CSE 4th
SEMESTER
Data Structure Quiz Question
c) 3
d) 4
Ans: B
7. How many queues are needed to
implement a stack. Considerthe
situation where no other data
structure like arrays, linked list is
available to you.
a) 1
b) 2
c) 3
d) 4
Ans: B
8. A priority queue can efficiently
implemented using which of the
following data structures? Assume
that the number of insert and peek
(operation to see the current highest
priority item) and extraction
(remove the highestpriority item)
operations are almost same.
a) Array
b) Link List
c) Heap data structures like binary
heap, Fibonacciheap
d) None of the above
Ans: C
9. Which of the following is true
about Binary Trees
a) Every Binary Tree is either
complete or full
b) Every complete binary tree is also a
full binary tree
c) Every full binary tree is also a
complete binary tree
d) None of the above
Ans: D
10. The maximum number of
binary trees that can be formed
with three unlabeled nodes is:
a) 1
b) 5
c) 4
d) 3
Ans: B
11. How many distinct binary
searchtrees canbe createdout of 4
distinct keys?
a) 4
b) 14
c) 24
d) 42
Ans: B
12. One Key reasonwhy developers
have difficulty testing their own
work is:
a) Lack of technical documentation
b) Lack of test tools on the market for
developer’s
c) Lack of Objectivity
d) Lack of training
Ans: C

3. SHRI RAWATPURA SAKAR INSTITUTE OF TECHNOLOGY, NEW RAIPUR
BE CSE 4th
SEMESTER
Data Structure Quiz Question
13. What is the worstcase run-time
complexity of binary search
algorithm?
a) O(n2)
b) O(nlogn)
c) O(n3)
d) O(n)
Ans: D
14. Postfix expressionis just a
reverse of prefix expression.
a) True
b) False
Ans: B
15. Quick sort algorithm is an
example of?
a) Greedy Approach
b) Improved binary search
c) Dynamic Programming
d) Divide & Conquer
Ans: D
16. Visiting root node after visiting
left and right sub-trees is called
a) In-order traversal
b) Pre-order traversal
c)Post-ordertraversal
Ans: C
17. Time complexity of Depth First
Traversal of is?
a) Θ(|V|+|E|)
b) Θ(|V||)
c) Θ(|E|)
d) Θ(|V|*|E|)
Ans: A
18. If queue is implemented using
arrays, what would be the worst
run time complexity of queue and
dequeue operation?
a) O(n), O(n)
b) O(n), O(1)
c) O(1), O(n)
d) O(1), O(1)
Ans: D
19. Towerof Hanoi is an example
of:
a) Divide & Conquer
b) Recursive approach
c) Option B but not option A
d) Both A & B
Ans: D
20. A Pivot element to partition
unsorted list is used in:
a) Merge Sort
b) Quick Sort
c) Insertion Sort
d) Selection Sort
Ans: B

4. SHRI RAWATPURA SAKAR INSTITUTE OF TECHNOLOGY, NEW RAIPUR
BE CSE 4th
SEMESTER
Data Structure Quiz Question
21. A stable algorithm -
a) Doesn’t crash
b) Doesn’t run out of memory
c) Doesn’t change the sequence of
appearance of elements
d) Doesn’t existss
Ans: C
22. What is the time complexity of
Build Heap operation. Build Heap
is used to build a max(or min)
binary heap from a given array.
Build Heap is used in Heap Sort as
a first step for sorting.
a) O(nlogn)
b) O(n2)
c) O(logn)
d) O(n)s
Ans: D
23. What is the time complexity of
Build Heap operation. Build Heap
is used to build a max(or min)
binary heap from a given array.
Build Heap is used in Heap Sort as
a first step for sorting.
a) O(nlogn)
b) O(n2)
c) O(logn)
d) O(n)s
Ans: D
24. A max-heap is a heap where the
value of each parent is greater than
or equal to the values of its
children. Which of the following is a
max-heap?
Ans: B
25. In a binary max heap containing
n numbers, the smallest element
can be found in time
a) O(n)
b) O(logn)
c) O(loglogn)
d) O(1)
Ans: A
26. Given two max heaps of size n
each, what is the minimum possible
time complexity to make a one max-
heap of size from elements of two
max heaps?
a) O(nlogn)
b) O(nloglogn)

5. SHRI RAWATPURA SAKAR INSTITUTE OF TECHNOLOGY, NEW RAIPUR
BE CSE 4th
SEMESTER
Data Structure Quiz Question
c) O(n)
d) O(nlogn)
Ans: C
27. Which of the following Binary
Min Heap operation has the highest
time complexity?
a) Inserting an item under the
assumption that the heap has capacity
to accommodate one more item
b) Merging with another heap
c) O(n)
d) O(nlogn)
Ans: C
28. How is Data in a Queue
accessed?
a) First in First out
b) First in Last out
c) Last in First out
d) None of these
Ans: A
29. An Adjacency matrix
representation of a graph cannot
contain information of:
a) nodes
b) edges
c) direction of edges
d) parallel edges
Ans: D
30. Which of the following is/are the
levels of implementation of data
structure:
a) Abstract level
b) Application level
c) Implementation level
d) All of the above
Ans: D
31. A linear collection of data
elements where the linear node is
given by means of pointer is called:
a) Linked List
b) node list
c) Primitive list
d) None of these
Ans: A
32. …………. Is not an operation
performed on linear list.
a) Insertion
b) Insertion & Deletion
c) Deletion & Traversal
d) None of the above
Ans: D
33. Which is the application of
stack?
a) Function calls
b) Large number arithmetic
c) Evaluation of arithmetic
expressions
d) All of the above
Ans: D

6. SHRI RAWATPURA SAKAR INSTITUTE OF TECHNOLOGY, NEW RAIPUR
BE CSE 4th
SEMESTER
Data Structure Quiz Question
34. …………. Is a pile in which
items are added at one end and
removed from the other.
a) Stack
b) Queue
c) List
d) None of the above
Ans: B
35. Which of the following is the
type of the queue?
a) Ordinary
b) Single ended queue
c) Circular Queue
d) Priority Queue
Ans: B
36. ……….. is not the component of
data structure.
a) Operations
b) Storage Structures
c) Algorithms
d) None of the above
Ans: D
37. The property of binary tree is
a) The first subset is called left
subtree
b) The second subtree is called right
subtree
c) The root cannot contain NULL
d) The right subtree can be empty
Ans: D
38. Representation of Data
Structure in memory is known as
a) recursive
b) abstract data type
c) storage structure
d) file structure
Ans: B
39. Inserting an item into the stack
when stack is not full is called
………. Operation and deletion of
item form the stack is not empty is
called ……. Operation?
a) Push, Pop
b) pop, push
c) insert, delete
d) delete, insert
Ans: A
40. ………. Is a directed tree in
which outdegree of eachnode is less
than or equal to two
a) Unary tree
b) Ternary tree
c) Binary tree
d) Both B and C
Ans: C
41. ………. Level is where the
model becomes compatible
executable code.
a) Abstract level
b) Application level

7. SHRI RAWATPURA SAKAR INSTITUTE OF TECHNOLOGY, NEW RAIPUR
BE CSE 4th
SEMESTER
Data Structure Quiz Question
c) Implementation level
d) All of the above
Ans: C
42. A binary search tree whose left
subtree and right subtree differ in
height by at most 1 unit is called.
a) AVL tree
b) Red Black tree
c) Lemma
d) None of the above
Ans: A
43. …………. Is very useful in
situation when data have to stored
and then retrieved in reverse order.
a) Stack
b) Queue
c) List
d) Link List
Ans: A
44. 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
Ans: A
45. Quick sort is also known as?
a) merge sort
b) heap sort
c) bubble sort
d) none of these
Ans: D
46. Any node is the path from the
root to the node is called?
a) Successor node
b) Ancestor node
c) Internal node
d) None of the above
Ans: B
47. Which of the following is not the
part of ADT description?
a) Data
b) Operations
c) Both of the above
d) None of the above
Ans: D
48. The best average behavior is
shown by
a) Quick sort
b) Merge sort
c) Insertion sort
d) Heap sort
Ans: A
49. The extra key inserted at the
end of the array is called as.
a) End key
b) Stop key
c) Sentinel
d) Transposition
Ans: C

8. SHRI RAWATPURA SAKAR INSTITUTE OF TECHNOLOGY, NEW RAIPUR
BE CSE 4th
SEMESTER
Data Structure Quiz Question
50. The goal of hashing is to
produce a search that takes
a) O(1) time
b) O(n2) time
c) O(logn) time
d) O(nlogn) time
Ans: A