Can these problems be solved by dynamic programming? You will fly as quickly as

Question

Can these problems be solved by dynamic programming?

You will fly as quickly as possible between two distant cities, but dare not have flights in more than an hour because of fear of flying. You also need at least one hour break between each trip. You have a timetable, and the goal is to find the fastest way.

Alternatives?

A: Yes, because the issue has both overlapping subproblems and optimal substructure.
B: No, the problem has no overlapping subproblems.
C: No, the problem is not optimal substructure.
D: No, the problem has neither overlapping problems or optimal substructure.

Explanation / Answer

The correct option is C. The problem does no have a optimal sub structure. The problem is not clearly defined.

It has overlapping sub-problems but it is not clear.

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.