_________ is a search for data that uses an index to locate the item.

Related MCQs

• 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
• A sorted file contains 16 items. Using binary search, the maximum number of comparisons to search for an item in this file is
• What additional requirement is placed on an array, so that binary search may be used to locate an entry?
• Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
• Each node in a linear list contains an item called _______ which points to the next node in the list.
• _______ refers to the operation of finding the location of a given item in a collection of items.
• Each node in a linear list contains an item called____which points to the next node in the list.
• What kind of linked list is best to answer question like “What is the item at position n?”
• The time complexity of binary search is O(logn).
• The Average case occur in linear search algorithm