_______ refers to the operation of finding the location of a given item in a collection of items.

Related MCQs

• Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
• 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
• Finding the location of the element with a given value is called
• A sorted file contains 16 items. Using binary search, the maximum number of comparisons to search for an item in this file is
• ________ is a list in which the order of the items is significant, and the items are not necessarily sorted.
• 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?
• A linear collection of data elements where the linear node is given by means of pointer is called?
• Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the last node of the linked lis
• Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the last node of the linked list
• Consider an implementation of unsorted doubly linked list. Suppose it has its representation with a head pointer and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the end node of the linked list