TCS Ninja Dynamic Programming and Greedy Quiz 1

 traveling salesman problem using greedy approach

 These all works on the dynamic approach

 For the 1 disc 1 move required.

For the 2 disc 3 move required

For the 3 disc 5 moves required

So that for the N disc 2N-1 moves required

Project Scheduling works on the dynamic programming algorithms because here we use previous solution as input of the next problem.

 Dynamic approach uses memoization because here time complexity is minimum but the space complexity is high so it uses memory to store previous solution

 Because in tower of hanoi  2n-1 move always works in worst case.

 Tower of hanoi is a mathematical puzzle where we have 3 rod and  n disc so here recurrence relation is analysed that is T(n)=2T(n-1)+1

The Bellman-Ford algorithm is used to find all the pair of shortest distance in a graph.

Huffman Coding is a lossless compression technique. It assigns variable length bit code to different Character. The greedy choice is to assign least bit length code  to the most frequent character .