A sorted file contains 16 items. Using binary search, the maximum number of comparisons to search for an item in this file is

Related MCQs

• You want to check whether a given set of items is sorted. Which of the following sorting methods will be most efficient if it is already in sorted order?
• Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
• ________ is a list in which the order of the items is significant, and the items are not necessarily sorted.
• consider the function f defined here: struct item { int data; struct item * next; }; int f (struct item *p) { return((p==NULL) ||((p->next==NULL)||(p->data<=p->next->data) && (p->next))); } For a given linked list p, the function f returns 1 if and only if
• When converting binary tree into extended binary tree, all the original nodes in binary tree are
• The number of comparisons required to sort 5 numbers in ascending order using bubble sort are
• Time required to search an element in a sorted linked list is______
• _______ refers to the operation of finding the location of a given item in a collection of items.
• Which sorting algorithm can exploit the partially sorted data in a list?
• A sorting technique that guarantees that records with the same primary key occurs in the same order in the sorted list as in the original unsorted list is said to be