Write short notes on
3 December, 2024
Define classes P,NP,NP hard and NP-complete and also explain their relationship diagrammatically. What is nondeterministic algorithm? Explain with example. Define circuit satisfiability problem and prove that circuit SAT is in NP class.
3 December, 2024State 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.
3 December, 2024Write the string matching algorithm due to Knuth,Moris and Pratt. Analyze its time complexity.
3 December, 2024Using greedy strategy, schedule the following jobs with deadline so as to maximize the profit.
3 December, 2024Write short notes on
Write a short note on Asymptotic Notations.
3 December, 2024