daa assng 2!! :p

ASSIGNMENT 2                                                       SUBMISSION DATE : APRIL 10 2012
1.	Compare and contrast
a)	Dynamic programming / Divide and Conquer
b)	Dynamic programming / Greedy Technique

2.	Explain the rational behind code optimization.

3.	Write short notes on the following:
a)	Deterministic and Non -deterministic algorithms
b)	NP-hard problem  and NP-complete problem
c)	AND/OR  graph decision problem
d)	Cook’s theorem

4.	What is meant by backtracking? Explain with an example.

5.	Write the iterative algorithm for backtracking.