data structures & algorithms Practice Questions Answers Test with Solutions & More Shortcuts

Question : 11

A variable P is called pointer if

a) P points to the address of first element in DATA

b) P can store only memory addresses

c) P contain the DATA and the address of DATA

d) P contains the address of an element in DATA.

Question : 12

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

a) Housefull

b) Saturated

c) Underflow

d) Overflow

Question : 13

The following data structure store the homogeneous data elements

a) Arrays

b) Records

c) Pointers

d) None of the above

Question : 14

The following name does not relate to stacks

a) FIFO lists

b) LIFO list

c) Piles

d) Push-down lists

Question : 15

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

a) Counting the maximum memory needed by the algorithm

b) Counting the minimum memory needed by the algorithm

c) Counting the average memory needed by the algorithm

d) Counting the maximum disk space needed by the algorithm