PrepBharat

1. ___________ is/are useful when the original formulation of a problem is altered in some way, typically because the set of constraints to consider evolves because of the environment.
a) Static CSPs
b) Dynamic CSPs
c) Flexible CSPs
d) None of the mentioned

View Answer

2. Flexible CSPs relax on _______
a) Constraints
b) Current State
c) Initial State
d) Goal State

View Answer

3. Language/Languages used for programming Constraint Programming includes ____________
a) Prolog
b) C#
c) C
d) Fortrun

View Answer

4. When do we call the states are safely explored?
a) A goal state is unreachable from any state
b) A goal state is denied access
c) A goal state is reachable from every state
d) None of the mentioned

View Answer

5. Which of the following algorithm is generally used CSP search algorithm?
a) Breadth-first search algorithm
b) Depth-first search algorithm
c) Hill-climbing search algorithm
d) None of the mentioned

View Answer

6. General games involves ____________
a) Single-agent
b) Multi-agent
c) Neither Single-agent nor Multi-agent
d) Only Single-agent and Multi-agent

View Answer

7. Adversarial search problems uses ____________
a) Competitive Environment
b) Cooperative Environment
c) Neither Competitive nor Cooperative Environment
d) Only Competitive and Cooperative Environment

View Answer

8. Mathematical game theory, a branch of economics, views any multi-agent environment as a game provided that the impact of each agent on the others is “significant,” regardless of whether the agents are cooperative or competitive.
a) true
b) false

View Answer

9. Zero sum games are the one in which there are two agents whose actions must alternate and in which the utility values at the end of the game are always the same
a) true
b) false

View Answer

10. Zero sum game has to be a ______ game.
a) Single player
b) Two player
c) Multiplayer
d) Three player

View Answer