data structures & algorithms set 1 Detailed Explanation And More Example

Question : 1

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

Two main measures for the efficiency of an algorithm are

a) Time and space

b) Processor and memory

c) Complexity and capacity

d) Data and space

Question : 3

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

a) Arrays

b) Records

c) Pointers

d) None of the above

Question : 4

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

The following name does not relate to stacks

a) FIFO lists

b) LIFO list

c) Piles

d) Push-down lists

Question : 6

The following data structure store the homogeneous data elements

a) Arrays

b) Records

c) Pointers

d) None of the above