data structures & algorithms set 1 Detailed Explanation And More Example

Question : 1

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.

Question : 2

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

The following data structure store the homogeneous data elements

a) Arrays

b) Records

c) Pointers

d) None of the above

Question : 4

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

The complexity of merge sort algorithm is

a) O(n)

b) O(log n)

c) O(n log n)

d) None of these

Question : 6

The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal

a) ABFCDE

b) ADBFEC

c) ABDECF

d) None of the above