[Solved] The number of comparisons done by sequential search is ………………

Q.	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
Answer» B. (n+1)/2

View all MCQs in: Data Structure (DS)

Discussion

Related Multiple Choice Questions

In general, the binary search method needs no more than ……………. comparisons.
The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.
A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
Which data structure is used in breadth first search of a graph to hold nodes?
In ……………, search start at the beginning of the list and check every element in the list.
How do you count the number of elements in the circular linked list?
The total number of elements in a stack at a given point of time can be calculated from the value of______.

Help us improve!

We want to make our service better for you. Please take a moment to fill out our survey.