CH 21 - Dynamic Programming with complete solution. A+ GRADED
True / False 1. Dynamic programming requires that its subproblems be independent of one another. a. True b. False ANSWER: False POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.21.01 - 21.1 NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 21.1 A Shortest-Route Problem KEYWORDS: Bloom's: Remember 2. Dynamic programming, when used for the shortest-route problem, requires complete enumeration of paths from the beginning to ending node. a. True b. False ANSWER: False POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.21.01 - 21.1 NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 21.1 A Shortest-Route Problem KEYWORDS: Bloom's: Remember 3. The solution of stage k of a dynamic programming problem is dependent upon the solution of stage k−1. a. True b. False ANSWER: True POINTS: 1 DIFFICULTY: Moderate LEARNING OBJECTIVES: IMS.ASWC.19.21.02 - 21.2 NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 21.2 Dynamic Programming Notation KEYWORDS: Bloom's: Understand 4. The output of stage k is the input for stage k−1. a. True b. False ANSWER: True POINTS: 1 DIFFICULTY: Moderate LEARNING OBJECTIVES: IMS.ASWC.19.21.02 - 21.2 NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 21.2 Dynamic Programming Notation
Información del documento
- Subido en
- 29 de noviembre de 2023
- Número de páginas
- 16
- Escrito en
- 2023/2024
- Tipo
- Examen
- Contiene
- Preguntas y respuestas
