Design and Implement Selection sort Algorithm
Design and Implement Mergesort Algorithm
Design and Implement Topological ordering of Vertices in a given graph
Design and Implement Prim’s Algorithm to find minimum cost spanning tree of a given connected undirected graph
Design and Implement Warshal’s Algorithm to find transitive closure of a given graph
Design and Implement Horspool’s string matching Algorithm to find a matching substring in a given text
Design and Implement 0/1 Knapscak problem using Dynamic programming method
Design and Implement N Queen’s problem using Backtracking