engineering recuitment Rajasthan Informatics Assistant (Suchna Sahayak) Mock Test 2023 Algorithms Algorithm Design Techniques Dynamic Programming
Dynamic Programming is a algorithmic technique of solving problems by dividing problems into small parts. Choose the most appropriate option that best describes Dynamic programming
1
Memorization and Divide & Conquer
2
Memorization and Optimal Substructure
3
Optimal Substructure and Overlapping subproblems
4
Optimal Substructure and Divide & Conquer