data structures & algorithms set 1 Detailed Explanation And More Example

Question : 1

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

Question : 2

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

a) Linked lists

b) Stacks

c) Queues

d) Deque

Question : 3

The following is two-way list

a) Grounded header list

b) Circular header list

c) Linked list with header and trailer nodes

d) None of above

Question : 4

The following data structure store the homogeneous data elements

a) Arrays

b) Records

c) Pointers

d) None of the above

Question : 5

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 : 6

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.