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
(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