problem 1) Name the basic asymptotic efficiency classes and briefly describe with exs. (For ex, log n is the asymptotic classes that are named as logarithmic).       

problem 2: describe a binary search algorithm and apply it to the following array of numbers to search for K=45.

5    20    30    35    40    45    50    70    90    110

prepare a recurrence relation and time complexity for a binary search algorithm.

problem 3) Describe the following terms:

(a) Asymptote    (b) Worst case    (c) Best case  (d) Average case

(e) Tight bound  (f) Upper bound  (g) Loose Bound

problem 4) Describe the operation of Merge sort algorithm with the help of the following ex.

        7  6   4   8   15   12   3   16

problem 5) Name the four basic fundamental techniques that are used to design the algorithm efficiently with brief description for each.

problem 6) Use the most suitable notation among 0, θ, Ω? to indicate time efficiency.

problem 7) prepare down the applications of spanning tree. prepare a Prim’s algorithm to find a minimum cost of a spanning tree and show its operation with an ex.

problem 8) describe “Greedy algorithm”? prepare its pseudo code.   

problem 9) What is complexity of graph search algorithms if a graph is represented by adjancy matrix and adjancy list.