1.

Which if 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
2. A binary search tree whose left subtree and right subtree differ in
hight by at most 1 unit is called ……
A) AVL tree
B) Red-black tree
C) Lemma tree
D) None of the above
3. ……………….. level is where the model becomes compatible
executable code
A) Abstract level
B) Application level
C) Implementation level
D) All of the above

DATA STRUCTURES and ALGORITHMS

MCQs
4. 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
5. Which of the following is true about the characteristics of abstract
data types?
i) It exports a type.

ii) It exports a set of operations

A) True, False
B) False, True
C) True, True
D) False, False
6. …………… is not the component of data structure.
A) Operations
B) Storage Structures

C) Algorithms

D) None of above
7. 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

8. Inserting an item into the stack when stack is not full is called
…………. Operation and deletion of item form the stack, when stack is
not empty is called ………..operation.
A) push, pop
B) pop, push

C) insert, delete

D) delete, insert

9. ……………. 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

10. ………… 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

11. Which data structure allows deleting data elements from and
inserting at rear?
A) Stacks
B) Queues
C) Dequeues

D) Binary search tree

12. Which of the following data structure can’t store the non-
homogeneous data elements?
A) Arrays
B) Records

C) Pointers

D) Stacks

13. A ……. is a data structure that organizes data similar to a line in the
supermarket, where the first one in line is the first one out.
A) Queue linked list
B) Stacks linked list

C) Both of them

D) Neither of them

14. Which of the following is non-liner data structure?

A) Stacks

B) List

C) Strings

D) Trees
15. Herder node is used as sentinel in …..
A) Graphs

B) Stacks

C) Binary tree
D) Queues

16. Which data structure is used in breadth first search of a graph to

hold nodes?
A) Stack

B) queue
C) Tree

D) Array

17. Identify the data structure which allows deletions at both ends of
the list but insertion at only one end.
A) Input restricted dequeue
B) Output restricted qequeue

C) Priority queues

D) Stack

18. Which of the following data structure is non linear type?

A) Strings

B) Lists

C) Stacks

D) Graph
19. Which of the following data structure is linear type?
A) Graph

B) Trees

C) Binary tree

D) Stack
20. To represent hierarchical relationship between elements, Which
data structure is suitable?
A) Dequeue

B) Priority

C) Tree
D) Graph

21. A directed graph is ………………. if there is a path from each vertex

to every other vertex in the digraph.
A) Weakly connected

B) Strongly Connected
C) Tightly Connected
D) Linearly Connected

22. In the …………….. traversal we process all of a vertex’s descendants

before we move to an adjacent vertex.
A) Depth First
B) Breadth First

C) With First

D) Depth Limited

23. State True of False.

i) Network is a graph that has weights or costs associated with it.

ii) An undirected graph which contains no cycles is called a forest.

iii) A graph is said to be complete if there is no edge between every pair of

vertices.

A) True, False, True

B) True, True, False

C) True, True, True

D) False, True, True

24. Match the following.

a) Completeness i) How long does it take to find a solution
b) Time Complexity ii) How much memory need to perform
the search.
c) Space Complexity iii) Is the strategy guaranteed to find the
solution when there in one.

A) a-iii, b-ii, c-i

B) a-i, b-ii, c-iii

C) a-iii, b-i, c-ii

D) a-i, b-iii, c-ii

25. The number of comparisons done by sequential search is

………………
A) (N/2)+1
B) (N+1)/2
C) (N-1)/2

D) (N+2)/2

26. In ……………, search start at the beginning of the list and check
every element in the list.
A) Linear search
B) Binary search

C) Hash Search

D) Binary Tree search

27. State True or False.

i) Binary search is used for searching in a sorted array.

ii) The time complexity of binary search is O(logn).

A) True, False

B) False, True

C) False, False

D) True, True
28. Which of the following is not the internal sort?
A) Insertion Sort

B) Bubble Sort

C) Merge Sort
D) Heap Sort

29. State True or False.

i) An undirected graph which contains no cycles is called forest.

ii) A graph is said to be complete if there is an edge between every pair of vertices.

A) True, True
B) False, True

C) False, False
D) True, False

30. A graph is said to be ……………… if the vertices can be split into two
sets V1 and V2 such there are no edges between two vertices of V1 or
two vertices of V2.
A) Partite

B) Bipartite
C) Rooted

D) Bisects

31. In a queue, the initial values of front pointer f rare pointer r

should be …….. and ……….. respectively.
A) 0 and 1

B) 0 and -1
C) -1 and 0

D) 1 and 0

32. In a circular queue the value of r will be ..

A) r=r+1

B) r=(r+1)% [QUEUE_SIZE – 1]

C) r=(r+1)% QUEUE_SIZE
D) r=(r-1)% QUEUE_SIZE

33. Which of the following statement is true?

i) Using singly linked lists and circular list, it is not possible to traverse the list
backwards.

ii) To find the predecessor, it is required to traverse the list from the first node in
case of singly linked list.

A) i-only

B) ii-only

C) Both i and ii
D) None of both
34. The advantage of …………….. is that they solve the problem if
sequential storage representation. But disadvantage in that is they are
sequential lists.
A) Lists

B) Linked Lists
C) Trees

D) Queues

35. What will be the value of top, if there is a size of stack

STACK_SIZE is 5
A) 5

B) 6

C) 4
D) None

36. ………… is not the operation that can be performed on queue.

A) Insertion

B) Deletion

C) Retrieval

D) Traversal
37. There is an extra element at the head of the list called a ……….
A) Antinel

B) Sentinel
C) List header

D) List head

38. A graph is a collection of nodes, called ………. And line segments

called arcs or ……….. that connect pair of nodes.
A) vertices, edges
B) edges, vertices

C) vertices, paths

D) graph node, edges

39. A ……….. is a graph that has weights of costs associated with its
edges.
A) Network

B) Weighted graph

C) Both A and B
D) None A and B

40. In general, the binary search method needs no more than

……………. comparisons.
A) [log2n]-1

B) [logn]+1

C) [log2n]

D) [log2n]+1
41. Which of the following is not the type of queue?
A) Ordinary queue

B) Single ended queue

C) Circular queue

D) Priority queue

42. 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

43. State true or false.
i) The degree of root node is always zero.

ii) Nodes that are not root and not leaf are called as internal nodes.

A) True, True

B) True, False

C) False, True
D) False, False

44. 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

45. State true of false.

i) A node is a parent if it has successor nodes.

ii) A node is child node if out degree is one.

A) True, True

B) True, False
C) False, True

D) False, False

46. ………………. is not an operation performed on linear list

a) Insertion b) Deletion c) Retrieval d) Traversal

A) only a,b and c

B) only a and b

C) All of the above

D) None of the above

47. Which is/are the application(s) of stack
A) Function calls

B) Large number Arithmetic

C) Evaluation of arithmetic expressions

D) All of the above

48. A …………… is an acyclic digraph, which has only one node with
indegree 0, and other nodes have in-degree 1.
A) Directed tree
B) Undirected tree
C) Dis-joint tree

D) Direction oriented tree

49. …………………. Is a directed tree in which outdegree of each node is

less than or equal to two.
A) Unary tree

B) Binary tree
C) Trinary tree

D) Both B and C

50. State true or false.

i) An empty tree is also a binary tree.

ii) In strictly binary tree, the out-degree of every node is either o or 2.

A) True, False

B) False, True

C) True, True
D) False, False

51. Which of the following data structures are indexed structures?

A. Linear arrays
B. Linked lists

C. Queue

D. Stack

52. Which of the following data structure store the homogeneous data
elements?
A. Arrays

B. Records
C. Pointers

D. Lists

53. When new data are to be inserted into a data structure, but there
is not available space; this situation is usually called ….
A. Underflow

B. overflow
C. houseful

D. saturated

54. 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. dequeue
55. Operations on a data structure may be …..
A. creation

B. destruction

C. selection

D. all of the above

56. The way in which the data item or items are logically related
defines …..
A. storage structure

B. data structure
C. data relationship

D. data operation

57. Which of the following are the operations applicable an primitive

data structures?
A. create

B. destroy

C. update

D. all of the above

58. The use of pointers to refer elements of a data structure in which
elements are logically adjacent is ….
A. pointers

B. linked allocation
C. stack

D. queue

59. Arrays are best data structures

A. for relatively permanent collections of data
B. for the size of the structure and the data in the structure are constantly
changing

C. for both of above situation

D. for non of above situation

60. Which of the following statement is false?

A. Arrays are dense lists and static data structure.

B. Data elements in linked list need not be stored in adjacent space in memory

C. Pointers store the next data element of a list.

D. Linked lists are collection of the nodes that contain information part and next
pointer.

Data Structures and Algorithms Multiple Choice Questions and

Answers :-
61. Which of the following data structure is non-linear type?
A) Strings

B) Lists

C) Stacks

D) Tree
62. Which of the following data structure is linear type?
A) Array
B) Tree

C) Graphs

D) Hierarchy
63. The logical or mathematical model of a particular organization of
data is called a ………
A) Data structure
B) Data arrangement

C) Data configuration

D) Data formation

64. The simplest type of data structure is ………………

A) Multidimensional array

B) Linear array
C) Two dimensional array

D) Three dimensional array

65. Linear arrays are also called ……………….

A) Straight line array

B) One-dimensional array
C) Vertical array

D) Horizontal array

66. Arrays are best data structures …………

A) For relatively permanent collections of data.
B) For the size of the structure and the data in the structure are constantly
changing

C) For both of above situation

D) For none of the above

67. Which of the following data structures are indexed structures?

A) Linear arrays
B) Linked lists

C) Graphs

D) Trees

68. Each node in a linked list has two pairs of ………….. and
……………….
A) Link field and information field
B) Link field and avail field

C) Avail field and information field

D) Address field and link field

69. A …………………… does not keep track of address of every element

in the list.
A) Stack

B) String

C) Linear array
D) Queue

70. When does top value of the stack changes?

A) Before deletion

B) While checking underflow

C) At the time of deletion

D) After deletion
71. Which of the following data structure is non-linear type?
A) Strings

B) Lists

C) Stacks

D) Tree
72. Which of the following data structure is linear type?
A) Array
B) Tree

C) Graphs

D) Hierarchy

73. The logical or mathematical model of a particular organization of

data is called a ………
A) Data structure
B) Data arrangement
C) Data configuration

D) Data formation

74. The simplest type of data structure is ………………

A) Multidimensional array

B) Linear array
C) Two dimensional array

D) Three dimensional array

75. Linear arrays are also called ……………….

A) Straight line array

B) One-dimensional array
C) Vertical array

D) Horizontal array

76. Arrays are best data structures …………

A) For relatively permanent collections of data.
B) For the size of the structure and the data in the structure are constantly
changing

C) For both of above situation

D) For none of the above

77. Which of the following data structures are indexed structures?

A) Linear arrays
B) Linked lists

C) Graphs

D) Trees

78. Each node in a linked list has two pairs of ………….. and
……………….
A) Link field and information field
B) Link field and avail field

C) Avail field and information field

D) Address field and link field

79. A …………………… does not keep track of address of every element

in the list.
A) Stack

B) String

C) Linear array
D) Queue

80. When does top value of the stack changes?

A) Before deletion

B) While checking underflow

C) At the time of deletion

D) After deletion
91. Arrays are best data structures
A) for relatively permanent collections of data
B) for the size of the structure and the data in the structure are constantly
changing

C) for both of above situation

D) for none of above situation

92. Which of the following data structure is not linear data structure?
A) Arrays

B) Linked lists

C) Both of the above

D) None of the above

93. The disadvantage in using a circular linked list is …………………….
A) It is possible to get into infinite loop.
B) Last node points to first node.

C) Time consuming

D) Requires more memory space

94. A linear list in which each node has pointers to point to the
predecessor and successors nodes is called as ..
A) Singly Linked List

B) Circular Linked List

C) Doubly Linked List

D) Linear Linked List

95. A ……………….. is a linear list in which insertions and deletions are

made to from either end of the structure.
A) circular queue

B) random of queue

C) priority

D) dequeue
96. In a priority queue, insertion and deletion takes place at
………………
A) front, rear end

B) only at rear end

C) only at front end

D) any position
97. The time complexity of quick sort is …………..
A) O(n)

B) O(n2)

C) O(n log n)
D) O(log n)

98. Which of the following is an application of stack?

A) finding factorial

B) tower of Hanoi

C) infix to postfix conversion

D) all of the above

99. The data structure which is one ended is ………………
A) queue

B) stack
C) tree

D) graph

100. A list which displays the relationship of adjacency between

elements is said to be
A) linear
B) non linear

C) linked list

D) trees

101. Program with highest run-time complexity is ………………..

(A) Tower of Hanoi
(B) Fibonacci Series
(C) Prime Number Series
(D) None of these
Answer: A
102. The number of unused pointers in a complete binary tree of
depth 5 is:
(A) 4
(B) 8
(C) 16
(D) 32
Answer: C
103. Linear search is highly inefficient compared to binary search
when dealing with:
(A) Small, unsorted arrays
(B) Small, sorted arrays
(C) Large, unsorted arrays
(D) Large, sorted arrays
Answer: D
104. The running time for creating a heap of size n is ………….
(A) O(n)
(B) O(log n)
(C) O(n log n)
(D) O(n2)
Answer: C
105. The extra key inserted at the end of the array is called a ……………
(A) End Key
(B) Stop Key
(C) Sentinel
(D) Transposition
Answer: C
106. Which of the following operations is performed more efficiently
by doubly linked list than by singly linked list?
(A) Deleting a node whose location is given
(B) Searching of an unsorted list for a given item
(C) Inserting a new node after node whose location is given
(D) Traversing the list to process each node
Answer: A
107. Using square brackets ([]) to retrieve vector elements …………..
perform bounds checking; using member function at to retrieve
vector elements ……………. perform bounds checking.
(A) Does not, does not
(B) Does not, does
(C) Does, does not
(D) Does, does
Answer: B
108. One can determine whether a Binary tree is a Binary Search Tree
by traversing it in …………….
(A) Pre-order
(B) In-order
(C) Post-order
(D) Any of these
Answer: B
109. The spanning tree of connected graph with 10 vertices contains
…………..
(A) 9 edges
(B) 11 edges
(C) 10 edges
(D) 9 vertices
Answer: A
110. What data structure is used for breadth first traversal of a graph?
(A) Queue
(B) Stack
(C) List
(D) None of these
Answer: A
111. A sorted file contains 16 items. Using binary search, the maximum
number of comparisons to search for an item in this file is ………..
(A) 15
(B) 8
(C) 1
(D) 4
Answer: D
112. Which of the following is not possible with an array in C
programming language?
(A) Declaration
(B) Definition
(C) Dynamic Allocation
(D) Array of strings
Answer: C
113. One can determine whether an infix expression has balanced
parenthesis or not by using ………….
(A) Array
(B) Queue
(C) Stack
(D) Tree
Answer: C
114. An adaptive sorting algorithm …………..
(A) adapts to new computers
(B) takes advantage of already sorted elements
(C) takes input which is already sorted
(D) None of these
Answer: B
115. The average number of key comparisons done in successful
sequential search in a list of length n is …………..
(A) log n
(B) (n-1)/2
(C) n/2
(D) (n+1)/2
Answer: D
116. What are the time complexities of finding 8th element from
beginning and 8th element from end in a singly linked list? Let n be
the number of nodes in linked list, you may assume that n>8.
(A) O(n) and O(n)
(B) O(1) and O(1)
(C) O(n) and O(1)
(D) O(1) and O(n)
Answer: D
117. Recursion is memory-intensive because:
(A) Recursive functions tend to declare many local variables.
(B) Previous function calls are still open when the function calls itself and the
activation records of these previous calls still occupy space on the call stack.
(C) Many copies of the function code are created.
(D) It requires large data values.
Answer: B
118. The maximum number of nodes in a binary tree of depth 5 is
……………
(A) 31
(B) 16
(C) 32
(D) 15
Answer: A
119. Travelling salesman problem is an example of ……………….
(A) Dynamic Algorithm
(B) Greedy Algorithm
(C) Recursive Approach
(D) Divide & Conquer
Answer: B
120. In a min-heap:
(A) parent nodes have values greater than or equal to their Childs
(B) parent nodes have values less than or equal to their Childs
(C) both statements are true
(D) both statements are wrong
Answer: A
121. n elements of a Queue are to be reversed using another queue.
The number of “ADD” and “REMOVE” operations required to do so is:
(A) 2*n
(B) 4*n
(C) n
(D) The task cannot be accomplished
Answer: D
122. A complete binary tree with n leaf nodes has …………..
(A) n+1 nodes
(B) 2n-1 nodes
(C) 2n+1 nodes
(D) n(n-1)/2 nodes
Answer: B
123. A binary tree can be converted in to its mirror image by
traversing it in …………..
(A) In-order
(B) Pre-order
(C) Post-order
(D) Any order
Answer: B
124. The time required to delete a node x from a doubly linked list
having n nodes is ………….
(A) O(n)
(B) O(log n)
(C) O(1)
(D) O(n log n)
Answer: C
125. In doubly linked lists:
(A) a pointer is maintained to store both next and previous nodes.
(B) two pointers are maintained to store next and previous nodes.
(C) a pointer to self is maintained for each node.
(D) none of these
Answer: B
126. One can convert an infix expression to a postfix expression using
a …………..
(A) Stack
(B) Queue
(C) Deque
(D) None of these
Answer: A
127. Which one of the below mentioned is linear data structure?
(A) Queue
(B) Stack
(C) Arrays
(D) All of these
Answer: D
128. Which of the following types of expressions do not require
precedence rules for evaluation?
(A) fully parenthesised infix expression
(B) postfix expression
(C) partially parenthesised infix expression
(D) more than one of the above
Answer: A
129. Overflow condition in linked list may occur when attempting to
………….
(A) Create a node when free space pool is empty.
(B) Traverse the nodes when free space pool is empty.
(C) Create a node when linked list is empty.
(D) None of these.
Answer: A
130. Linked lists are not suitable data structures for which one of the
following problems?
(A) Insertion sort
(B) Binary search
(C) Radix sort
(D) Polynomial manipulation
Answer: B
131. The sorting technique where array to be sorted is partitioned
again and again in such a way that all elements less than or equal to
partitioning element appear before it and those which are greater
appear after it, is called …………..
(A) Merge sort
(B) Quick sort
(C) Selection sort
(D) None of these
Answer: B
132. Which of the following asymptotic notation is the worst among
all?
(A) Ο(n+9378)
(B) Ο(n3)
(C) nΟ(1)
(D) 2Ο(n)
Answer: D
133. What value does function mystery return when called with a
value of 4?
int mystery ( int number )
{
if ( number <= 1 )
return 1;
else
return number * mystery( number – 1 );
}
(A) 0
(B) 1
(C) 4
(D) 24
Answer: D
134. Which of the following uses memorization?
(A) Greedy approach
(B) Divide and conquer approach
(C) Dynamic programming approach
(D) None of the above
Answer: C
135. For an undirected graph G with n vertices and e edges, the sum of
the degrees of each vertex is ……..
(A) ne
(B) 2n
(C) 2e
(D) en
Answer: C
136. The search technique for searching a sorted file that requires
increased amount of space is …………….
(A) Indexed sequential search
(B) Interpolation search
(C) Sequential search
(D) Tree search
Answer: A
Explanation:
The search technique for searching a sorted file that requires increased amount of
space is indexed sequential search. Because in this search technique we need to
maintain a separate index file which requires additional storage space.
137. The postfix form of A ^ B * C – D + E/ F/ (G + H),
(A) AB^C*D-EF/GH+/+
(B) AB^CD-EP/GH+/+*
(C) ABCDEFGH+//+-*^
(D) AB^D +EFGH +//*+
Answer: A
138. If locality is a concern, you can use ……………. to traverse the
graph.
(A) Breadth First Search
(B) Depth First Search
(C) Either BFS or DFS
(D) None of these
Answer: B
139. The prefix of (A+B)*(C-D)/E*F is:
(A) /+-AB*CD
(B) /*+-ABCD*EF
(C) */*+AB-CDEF
(D) **AB+CD/EF
Answer: C
Explanation:
Prefix of (A+B) * (C – D) / E*F
(+AB) * (-CD) / E*F
*+AB-CD E*F
*/*+AB-CDEF
140. Which of the following is a difference between vectors and
arrays?
(A) Access to any element using the [] operator.
(B) Stored in contiguous blocks of memory.
(C) The ability to change size dynamically.
(D) Efficient direct access to any element.
Answer: C
141. A sorting technique which uses the binary tree concept such that
label of any node is larger than all the labels in the subtrees, is called
…………….
(A) Selection sort
(B) Insertion sort
(C) Heap sort
(D) Quick sort
Answer: C
Explanation:
A Sorting technique which uses the binary tree concept such that label of any
node is larger than all the, labels in the sub trees, is called Heap sort because heap
sort works on a complete binary tree with the property that the value at any node
‘N’ of the tree should be greater than or equal to the value at all its children nodes.
142. A balance factor in AVL tree is used to check ………………
(A) what rotation to make.
(B) if all child nodes are at same level.
(C) when the last rotation occurred.
(D) if the tree is unbalanced.
Answer: D
143. A full binary tree with ‘n’ non-leaf nodes contains …………..
(A) log2 n nodes
(B) n+1 nodes
(C) 2n nodes
(D) 2n+l nodes
Answer: D
144. A graph ‘G’ with ‘n’ nodes is bipartite if it contains ………….
(A) n edges
(B) a cycle of odd length
(C) no cycle of odd length
(D) n2 edges
Answer: C
145. Recursive procedures are implemented by using ………………..
data structure.
(A) queues
(B) stacks
(C) linked lists
(D) strings
Answer: B
Explanation:
Recursive procedures are implemented by using stacks because stacks are LIFO
data structure and we need this feature to store return addresses of various
recursive calls in recursive procedures.
146. Which one of the below is not divide and conquer approach?
(A) Insertion Sort
(B) Merge Sort
(C) Shell Sort
(D) Heap Sort
Answer: B
147. Which of the following is not a sequence container provided by
the STL?
(A) vector
(B) array
(C) list
(D) deque
Answer: B
148. Quick sort algorithm is an example of ………….
(A) Greedy approach
(B) Improved binary search
(C) Dynamic Programming
(D) Divide and conquer
Answer: D
149. In …………., the difference between the height of the left sub tree
and height of the right tree, for each node, is almost one.
(A) Binary search tree
(B) AVL – tree
(C) Complete tree
(D) Threaded binary tree
Answer: B
150. In C programming, when we remove an item from bottom of the
stack, then:
(A) The stack will fall down.
(B) Stack will rearrange items.
(C) It will convert to LIFO
(D) This operation is not allowed.
Answer: D