Scribd
Upload
81 views

Data and Decisions - DPP Mcq's

This document discusses the key concepts of dynamic programming including: 1. Dynamic programming is concerned with multistage decision processes where the strategy at each stage depends on the previous stages. 2. A dynamic programming problem involves breaking down a complex problem into simpler sub-problems and using a recursive method to determine the optimal solution. 3. Bellman's principle of optimality states that whatever the initial state is, the remaining decisions must constitute an optimal policy given the resulting state from the first decision.

Uploaded by

Puneeth Gowda
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
81 views

Data and Decisions - DPP Mcq's

This document discusses the key concepts of dynamic programming including: 1. Dynamic programming is concerned with multistage decision processes where the strategy at each stage depends on the previous stages. 2. A dynamic programming problem involves breaking down a complex problem into simpler sub-problems and using a recursive method to determine the optimal solution. 3. Bellman's principle of optimality states that whatever the initial state is, the remaining decisions must constitute an optimal policy given the resulting state from the first decision.

Uploaded by

Puneeth Gowda
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

DATA AND DECISIONS

DYNAMIC PROGRAMMING

MCQ’s

1. Decision making problems where at each stage the process is dependent on strategy chosen
are called
a) Linear Programming
b) Dynamic Programming
c) Decision Programming
d) None of the above

2. Dynamic Programming (DPP) is concerned with the theory of decision process


a) Multistage
b) Uni stage
c) Mixed stage
d) Two stages

3. Mathematically a DPP is a decision-making problem with variables


a) h
b) 2
c) n
d) 0

4. DPP is a decision-making problem in n variables where the problem will be subdivided into
a) n sub-problems
b) 2 sub-problems
c) 1 sub-problem
d) None of the above

5. Sub-problems are also called as


a) Variables
b) Units
c) Problems
d) Segments

6. Solution to a DPP is achieved starting from initial stage to final stage


a) Randomly
b) Sequentially
c) Alternatively
d) All of the above

7. A multistage decision system in which each decision and state variable can take only finite
number of values can be represented graphically by
a) Number tree
b) Variables
c) Decision tree
d) None of the above

8. represent nodes corresponding to stages


a) Lines
b) Zeros
c) Circles
d) Stages

9. Lines between the circles denotes


a) arcs corresponding to decisions
b) nodes corresponding to stages
c) Both a and b
d) None of the above

10. An optimal policy has the property that whatever the initial state and decisions are, the
remaining decisions must constitute an optimal policy with regard to the state resulting from
the first decision is called as the
a) Optimal strategy
b) Bell man’s principle of optimality
c) Principle of DPP
d) All of the above

11. The problem which does not satisfy the principle of optimality
a) Cannot be solved by DPP method
b) Can be solved by DPP method
c) Can be solved partially by DPP method
d) Both b and c

12. Every stage of a DPP problem consists of a number of


a) States
b) Stages
c) Numbers
d) Lines

13. The different possible conditions in which the system may find itself at that stage of the
problem are called
a) Variables
b) Circles
c) Stages
d) States

14. When the current stage is known, an optimal policy for the remaining stages in DPP is
of the policy of the previous ones
a) Dependent
b) Interdependent
c) Independent
d) None of the above
15. The solution procedure begins by finding the for each state to the last stage
a) Solution
b) Optimal solution
c) Optimal policy
d) Both a and b

16. A relationship identifies the optimal policy for each state with n stages remaining
a) Recursive
b) Relative
c) Good
d) None of the above

17. A recursive relationship which identifies the optimal policy for each state with n stages
remaining, given the optimal policy for each state with (n-1) stages
a) Right
b) Up
c) Left
d) Down

18. Using recursive equation approach, each time the solution procedure moves stage
by stage for obtaining the optimum policy of each stage
a) Backward
b) Forward
c) Upward
d) None of the above

19. A may be defined as the portion of the problem that possesses a set of mutually
exclusive alternatives from which the best alternative is to be selected
a) State
b) Stage
c) Nodes
d) Both a and b

20. How many steps are there in DPP?


a) 3
b) 5
c) 4
d) 7

21. Identification of the decision variables and specifying the objectives comes under which step
in DPP
a) Second step
b) Third step
c) First step
d) Fourth step

22. Decompose the given problem and identification of the state variable is the 2 nd step in DPP
a) True
b) False

23. Which of the following statements comes under the 3 rd step in DPP
Statement 1: Write down the general recursive relationship
Statement 2: Decide whether forward or backward method is to be followed
a) Statement 1
b) Statement 2
c) Both Statement 1 and 2
d) None of the above

24. Constructing appropriate stages to show the required values of the return function is the
step in DPP
a) First step
b) Second step
c) Third step
d) Fourth step

25. Determining the overall optimal policy or decisions and its value at each stage is the 5 th and
the final stage of DPP
a) Yes
b) No
c) Maybe
d) None of the above

26. The problem can be divided into stages with a required at each stage
a) Optimal policy
b) Policy decision
c) Decision variables
d) None of the above

27. Decision at each stage the current stage into state associated with the next stage
a) Converts
b) Conducts
c) Constructs
d) Both a and b

28. In a multistage decision system, each decision and state variable can take only number
of values
a) Infinite
b) Finite
c) More
d) Less
29. A recursive relationship which identifies the optimal policy for each state with n stages
remaining, given the optimal policy for each state with stages left
a) n
b) (n-1)
c) (n-2)
d) (n-3)
30. The circles in a decision tree represent
a) Arcs corresponding to decisions
b) Nodes corresponding to decisions
c) Segments
d) None of the above

You might also like