Discussion
Assertion (A): Dynamic programming can find the least cost tiling of an expression tree.
Reason (R): The optimal cost of a node depends only on the optimal costs of its subtrees.
Answer: C
Both are true and the reason gives the mechanism, and the property is exactly what dynamic programming requires. Optimality no longer follows once the intermediate form is a graph rather than a tree, since a shared node has more than one parent.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development