Tutorial List up to 3 chapter
Tutorial 1 – a. Explain Quick sort method with algorithm. Sort a given set of
elements using the quick sort method and determine the time required to sort the
elements .
Tutorial 1 – b. Explain merge sort algorithm to sort a given set of elements and
determine the time required to sort the elements.
Tutorial 1 – c .Explain recursive algorithm with suitable example and Explain
Pseudo code in detail with a suitable example.
Tutorial 2 – a. Explain algorithm for finding minimum and maximum element in
given array using divide and conquer with example.
Tutorial 2 – b. Explain algorithm for searching element in given list using divide
and conquer with example.
Tutorial 3 – a. Explain greedy method with algorithm.
Tutorial 3 – b. Find Minimum Cost Spanning Tree of a given undirected graph
using Kruskal’s algorithm.

Tutorial 3 – c. Find Minimum Cost Spanning Tree of a given undirected graph
using Prim’s algorithm.



Tutorial 3 – d. From a given vertex in a weighted connected graph, find
shortest paths to other vertices using Dijkstra's algorithm.