Data structures and Algorithms MCQ with Answers

max (f(n),g(n))

min (f(n),g(n))

f(n) + g(n)

f(n) X g(n)

At least 2n-c comparisons, for some constant c, are needed.

At most 1.5n-2 comparisons are needed.

At least nlog2n comparisons are needed.

None of the above.

Θ(n)

Θ(logn)

Θ(log*n)

Θ(1)

is far less than one

equals one

is far greater than one

none of these

That support recursion

That support dynamic data structure

That use dynamic scope rules

All of above