1. Flexible CSPs relax on,
a) Constraints
b) Current State
c) Initial State
d) Goal State
2. Language/Languages used for programming Constraint Programming includes
a) Prolog
b) C++
c) C
d) Fortrun
3. Which search agent operates by interleaving computation and action?
a) Offline search
b) Online search
c) Breadth-first search
d) Depth-first search
4. Backtracking is based on,
a) Last in first out
b) First in first out
c) Recursion
d) Both a & c
5. Constraint Propagation technique actually modifies the CSP problem.
a) True
b) False
6. Which search algorithm will use limited amount of memory?
a) RBFS
b) SMA*
c) Hill-climbing search algorithm
d) Both a & b
7. How many the new states are generated in backtracking algorithm?
a) 1
b) 2
c) 3
d) 4
8. 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
9. 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
10. What do we mean by simulated annealing in artificial intelligence?
a) Returns an optimal solution when there is a proper cooling schedule
b) Returns an optimal solution when there is no proper cooling schedule
c) It will not return an optimal solution when there is a proper cooling schedule
d) None of the mentioned
11. Which provides agents with information about the world they inhabit?
a) Sense
b) Perception
c) Reading
d) Hearing
12. What is used to initiate the perception in the environment?
a) Sensor
b) Read
c) Actuators
d) None of the mentioned
13. What is the study of light?
a) Biology
b) Light logy
c) Photometry
d) All of the mentioned
14. How to increase the brightness of the pixel?
a) Sound
b) Amount of light
c) Surface
d) Waves
15. How many kinds of reflection are available in image perception?
a) 1
b) 2
c) 3
d) 4
16. What is meant by predicting the value of a state variable from the past?
a) Specular reflection
b) Diffuse reflection
c) Gaussian filter
d) Smoothing
17. How many types of image processing techniques are there in image perception?
a) 1
b) 2
c) 3
d) 4
18. Which is meant by assuming any two neighboring that are both edge pixels with consistent orientation?
a) Canny edge detection
b) Smoothing
c) Segmentation
d) None of the mentioned
19. What is the process of breaking an image into groups?
a) Edge detection
b) Smoothing
c) Segmentation
d) None of the mentioned
20. How many types of 3-D image processing techniques are there in image perception?
a) 3
b) 4
c) 5
d) 6
21. General games involves,
a) Single-agent
b) Multi-agent
c) Neither a nor b
d) Only a and b
22. Adversarial search problems uses,
a) Competitive Environment
b) Cooperative Environment
c) Neither a nor b
d) Only a and b
.
23. 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
24. 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
25. Zero sum game has to be a ______ game.
a) Single player
b) Two player
c) Multiplayer
d) Three player
26. A game can be formally defined as a kind of search problem with the following components:
a) Initial State
b) Successor Function
c) Terminal Test
d) Utility Function
27. The initial state and the legal moves for each side define the __________ for the game.
a) Search Tree
b) Game Tree
c) State Space Search
d) Forest
28. General algorithm applied on game tree for making decision of win/lose is ____________
a) DFS/BFS Search Algorithms
b) Heuristic Search Algorithms
c) Greedy Search Algorithms
d) MIN/MAX Algorithms
29. The minimax algorithm (Figure 6.3) computes the minimax decision from the current state. It uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equations. The recursion proceeds all the way down to the leaves of the tree, and then the minimax values are backed up through the tree as the recursion unwinds.
a) True
b) False
30. The complexity of minimax algorithm is
a) Same as of DFS
b) Space – bm and time – bm
c) Time – bm and space – bm
d) Same as BFS
Answers
| 1-a | 2-a,b | 3-b | 4-d | 5-a |
| 6-d | 7-a | 8-c | 9-b | 10-a |
| 11-b | 12-a | 13-c | 14-b | 15-b |
| 16-d | 17-c | 18-a | 19-c | 20-c |
| 21-d | 22-a | 23-a | 24-b | 25-c |
| 26-a,b,c,d | 27-b | 28-d | 29-a | 30-a,b |