data structures & algorithms set 1 Detailed Explanation And More Example

Question : 1

The complexity of merge sort algorithm is

a) O(n)

b) O(log n)

c) O(n log n)

d) None of these

Question : 2

The depth of a complete binary tree is given by

a) D _n = n log ₂ n

b) Dn = _n log ₂ n+1

c) D _n = log ₂ n

d) D _n = log ₂ n+1

Question : 3

In a graph if e=(u, v) means

a) e begins at u and ends at v

b) u is processor and v is successor

c) both B and C are true

d) none is true

Question : 4

The complexity of Binary search algorithm is

a) O(n)

b) O(log )

c) O(n log n)

d) None of the above

Question : 5

The operation of processing each element in the list is known as

a) Merging

b) Inserting

c) Traversal

d) All the above

Question : 6

Each array declaration need not give, implicitly or explicitly, the information about the

a) name of array

b) data type of array

c) first data from the set to be stored

d) index set of the array