Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called

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
• ________ is a list in which the order of the items is significant, and the items are not necessarily sorted.
• _______ refers to the operation of finding the location of a given item in a collection of items.
• A sorted file contains 16 items. Using binary search, the maximum number of comparisons to search for an item in this file is
• Each node in a linear list contains an item called _______ which points to the next node in the list.
• Each node in a linear list contains an item called____which points to the next node in the list.
• In linked list each node contain minimum of two fields. One field is data field to store the data second field is?
• _________ is a search for data that uses an index to locate the item.
• _______ arrays are where the elements in the different arrays with the same subscript belongs to the same record.
• The difference between linear array and a record is_____