Dynamic programming Quiz
Studying this course? Keep your progress in one place.
Pick an answer for each. Quizzes never use energy.
5 questions, one answer each
Each answer is checked as you go, with why.
See all 5 questions
1. What does Bellman's principle say about a shortest route from S to T passing through X?
- A. It must use the shortest arc leaving S
- B. The part from S to X is itself a shortest route from S to X
- C. It passes through every stage
- D. It is unique
2. From state X, the arcs are to Y (length , value of Y ) and to Z (length , value of Z ). What is the minimum route value at X?
- A.
- B.
- C.
- D.
3. The same arcs are used in a minimax problem. What is the value at X?
- A.
- B.
- C.
- D.
4. The same arcs are used in a maximin problem. What is the value at X?
- A.
- B.
- C.
- D.
5. In a dynamic programming table, what does the action column record?
- A. The total distance so far
- B. The stage number
- C. The decision made at that state
- D. The number of states