Data Structure & Algorithms

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

Which of the following statement is false ?

Binary search algorithm cannot be applied to

When new data are to be inserted into a data structure, but there is no available space; this situation is usually called

The situation when in a linked list START=NULL is

The following is two-way list

The following name does not relate to stacks

In a binary tree, certain null entries are re- placed by special pointers which point to nodes higher in tree for efficiency. These special pointers are called

In a graph if e=(u, v) means

If every node u in G is adjacent to every other node v in G, A graph is said to be

A variable P is called pointer if

The Worst case occur in linear search algorithm when

The Average case occur in linear search algorithm

The complexity of the average case of an algorithm is

The following data structure allows deleting data elements from front and inserting at rear

This data structure allows deletions at both ends of the list but insertion at only one end.

The following data structure is non-linear type

The following data structure is linear type

To represent hierarchical relationship between elements, the following data structure is not suitable

A binary tree whose every node has either zero or two children is called

Arrays are best data structures for

Linked lists are best suited for

Each array declaration need not give, implicitly or explicitly, the information about the

The complexity of merge sort algorithm is

The indirect change of the values of a variable in one module by another module is called

Two main measures for the efficiency of an algorithm are

The time factor when determining the efficiency of algorithm is measured by

The space factor when determining the efficiency of algorithm is measured by

Which of the following data structures are indexed structures

Which of the following is not the required condition for binary search algorithm

Which of the following is not a limitation of binary search algorithm ?

Two dimensional arrays are also called

The term “push” and “pop” is related to the

A data structure where elements can be added or removed at either end but not in the middle is referred as

The following sorting algorithm is of divide- and-conquer type

An algorithm that calls itself directly or indi- rectly is known as

The elements of an array are stored suc- cessively in memory cells because

The memory address of the first element of an array is called

The memory address of fifth element of an array can be calculated by the formula

The following data structure can’t store the non-homogeneous data elements