Which of the following is not a stable sorting algorithm?

(a)

Insertion sort

(b)

Quick sort

(c)

Merge sort

(d)

Selection sort

Time complexity of bubble sort in best case is

(a)

θ (n)

(b)

θ (nlogn)

(c)

θ (n2)

(d)

θ (n(logn) 2)

The Θ notation in asymptotic evaluation represents

(a)

Base case

(b)

Average case

(c)

Worst case

(d)

NULL case

If a problem can be broken into subproblems which are reused several times, the problem possesses which property?

(a)

Overlapping subproblems

(b)

Optimal substructure

(c)

Memoization

(d)

Greedy

In dynamic programming, the technique of storing the previously calculated values is called ?

(a)

Saving value property

(b)

Storing value property

(c)

Memoization

(d)

Mapping