## Huffman Coding

Huffman Coding Problem: Find prefix code for given characters occurring with certain frequency. Huffman code was introduced by David Huffman at MIT. Many variations have been proposed by various resea [...]

Huffman Coding Problem: Find prefix code for given characters occurring with certain frequency. Huffman code was introduced by David Huffman at MIT. Many variations have been proposed by various resea [...]

Activity Selection Problem : “Schedule maximum number of compatible activities that need exclusive access to resources likes processor, class room, event venue etc.” Span of activity is defined by its [...]

Job scheduling is the problem of scheduling jobs out of a set of N jobs on a single processor which maximizes profit as much as possible. Consider N jobs, each taking unit time for execution. Each job [...]

Fractional Knapsack problem is defined as, "Given a set of items having some weight and value/profit associated with it. The knapsack problem is to find the set of items such that the total weight is [...]

Binary knapsack problem is defined as, "Given a set of items having some weight and value/profit associated with it. The knapsack problem is to find the set of items such that the total weight is less [...]

What is Greedy Algorithm? Greedy Algorithm is optimization method. When the problem has many feasible solutions with different cost or benefit, finding the best solution is known as an optimization pr [...]

Traditional Way of solving Exponential Problem Exponential problem is very common in computer science. The traditional way of finding exponential xn is very simple. Conventional approach would perform [...]