C Programs

• Perform (i) recursive binary search and (ii) linear search. Hence, find the time required to search an element.


• Sort a given set of elements using Selection Sort method.


• Sort a given set of elements using Quick Sort method


• Sort a given set of elements using merge Sort method.


• Sort a given set of elements using insertion Sort method.


• Implement tower of hanoii


• To generate Fibonacci series


• Perform DFS for a graph. Using this display all the strongly connected components.


• Obtain the topological ordering of vertices in a given digraph


• Find minimum cost spanning tree of a given undirected graph using Kruskal's algorithm.


• Implement all pairs shortest path problem using Floyd's


• Find a subset of a given set S = (s1, s2, ….sn} of n positive integers whose sum is equal to a given positive integer d.


• Implement brute-force method of string matching


• Implement Horspool algorithm for string matching


• Find the binomial coefficient using dynamic programming


• Find the minimum cost spanning tree of a given undirected graph using Prim's algorithm


• Compute the transitive closure of a given directed graph using Warshall's algorithm.