State the Max-flow min cut theorem for network flow analysis. Trace the execution of Ford-Fulkerson algorithm for finding the maximum flow in the graph.
Max-flow min cut theorem for network flow analysis:
If f is a flow in a flow network G(V,E) with source s and sink t, then the following conditions are equivalent:
Find the recurrence relation of binary search and derive the time complexity of binary search.
Write the string matching algorithm due to Knuth,Moris and Pratt. Analyze its time complexity.
Write short notes on
Write a C program to find the roots of a quadratic equation.
Write a C program to convert any name in short name.