data structures & algorithms set 2 Detailed Explanation And More Example

Question : 1

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

Which of the following data structures are indexed structures

a) linear arrays

b) linked lists

c) both of above

d) none of above

Question : 3

Arrays are best data structures for

a) relatively permanent collections of data

b) the size of the structure and the data in the structure are constantly changing

c) both of above situation

d) none of above situation

Question : 4

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

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

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

a) Counting the number of key operations

b) Counting the number of statements

c) Counting the kilobytes of algorithm

d) None of the above