Needing help with Algorithms:

1) In the merge-sort execution tree, the cost of operations done at each level of the tree is different. True or False?

2) Which of the following growth-rate functions grows the fastest in value?

a) n^2

b) 1

c) log n

d) n

3) Which of the following growth-rate functions indicates a problem whose time requirement is independent of the size of the problem?

a) n^3

b) n

c) log (n^2)

d) 1

4) The ______ notation defines an upper bound of an algorithm, it bounds a function only from above.

a) Big Theta

b) Big Omega

c) Big O

d) Small Omega

5) The order of Insertion Sort average case is:

a) O(n)

b) Theta (n log n)

c) Theta (n^2)

d) O(n log n)

6) The Merge Sort uses _______ algorithm technique:

a) Greedy

b) Backtracking

c) Dynamic Programming

d) Divide & Conquer

7) If f(n)=0(g(n)), g(n)=O(h(n)), h(n)=O(k(n))... which of the following is true?

a) cannot compare

b) f(n) < g(n) < h(n)...

c) f(n) > g(n) > h(n)...

d) f(n) = g(n) = h(n)...