The number of comparisons done by sequential search is ………………

Related MCQs

• The average number of key comparisons done in a successful sequential search in a list of length n is___________.
• The average number of key comparisons done in a successful sequential search in a list of length n is ____________.
• 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.
• The total number of comparisons in a bubble sort is ….
• 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.
• A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?
• In a binary search tree, which of the following traversals would print the numbers in the ascending order?