World's most popular travel blog for travel bloggers.

Differentiate Between (i) Greedy technique and Dynamic programming technique (ii) NP-Complete & NP Hard Problems

, , No Comments
Differentiate Between

(i)  Greedy technique and Dynamic programming technique
(ii)  NP-Complete & NP Hard Problems
(iii)  Decidable & Un-decidable problems
(iv)  Context free & Context sensitive Language
(v)  Strassen’s Algorithm & Chain Matrix Multiplication algorithm 

0 comments:

Post a Comment

Let us know your responses and feedback