problem 1: Describe asymptotic notations of an algorithm.

problem 2: prepare down Kruskal algorithm. Apply Kruskal algorithm to find out minimum spanning tree of the given graph.

problem 3: Describe knapsack problem with appropriate instance by using dynamic programming method.

problem 4: Describe Depth-First search (Hamiltonian Circuit) problems with appropriate ex by using back tracking.

problem 5: Solve traveling sales men problem by using branch and bound method.

problem 6: describe different representations of graphs.

problem 7: Describe quick sort method by using divide - and - conquer method.

problem 8: prepare about strassan’s matrix multiplication.

problem 9: describe warshalls Algorithm with dynamic programming methods.

problem 10: Describe the optimal binary search tree by using dynamic programming.

problem 11: Describe four queen problem by using back tracking.

problem 12: prepare short notes on the branch and bound method.