ADA MSE-3 PORTIONS

UNIT-4
Space and Time Trade-offs: Sorting by counting, Input Enhancement in String Matching: Horspools
Algorithm, Boyer-Moore.

Dynamic Programming: Warshall’s and Floyd’s Algorithms, Knapsack problem and Memory Function.

UNIT-5

Greedy Technique: Prim’s Algorithm, Kruskal’s Algorithm, Dijkstra’s Algorithm, Huffman Trees,

Limitations of Algorithm Power: Decision trees, P, NP and NP- Complete Problems

Backtracking: n-Queens Problem, Subset-Sum Problem, Graph colouring.