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

Question : 16

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

a) base address

b) floor address

c) foundation address

d) first address

Question : 17

In a graph if e=[u, v], Then u and v are called

a) endpoints of e

b) adjacent nodes

c) neighbors

d) all of the above

Question : 18

The Average case occur in linear search algorithm

a) When Item is somewhere in the middle of the array

b) When Item is not in the array at all

c) When Item is the last element in the array

d) All the above

Question : 19

The difference between linear array and a record is

a) An array is suitable for homogeneous data but the data items in a record may have different data type

b) In a record, there may not be a natural ordering in opposed to linear array.

c) A record form a hierarchical structure but a linear array does not

d) All of above

Question : 20

Which of the following data structures are indexed structures

a) linear arrays

b) linked lists

c) both of above

d) none of above