Algorithm

Fundamentals of algorithmic problem solving||Design and Analysis of Algorithm

Asymptotic Notations||Design and analysis of Algorithm

Brute Force Assignment problem

Huffman Tree -Greedy Technique | Design and analysis of Algorithm

Divide and conquer - Multiplication of Large Integers

Coin changing problem using Dynamic programming|| Design and Analysis of Algorithm

Knapsack Problem using Greedy Technique

Backtracking – n Queen problem || Design And Analysis of Algorithm

Backtracking - HAMILTONION CIRCUIT PROBLEMS

Maximum Matching in Bipartite Graphs || ITERATIVE IMPROVEMENT || Design and Analysis of Algorithm

Prims Algorithm || Greedy Technique Programming- Design and Analysis of Algorithm

knapsack problem brute force

Subset Sum Problem - Backtracking

Dynamic programming – Principle of optimality

Divide and conquer methodology merge sort

Dijkstra’s algorithm|| Greedy Technique || Design and Analysis of Algorithm

MULTI STAGE GRAPH || Dynamic programming

Fundamentals of algorithmic problem solving||Design and Analysis of Algorithm

LIFO Search and FIFO search Knapsack Problem || Branch and Bound

Container loading problem || Greedy Technique

Simplex method || ITERATIVE IMPROVEMENT || Design and analysis of Algorithm