Which agent enables the deliberation about the computational entities and actions? a) Hybrid b) Reflective c) Relational d) None of the mentioned
What can operate over the joint state space? a) Decision-making algorithm b) Learning algorithm c) Complex algorithm d) Both a & b
What is the action of task environment in artificial intelligence? a) Problem b) Solution c) Agent
What kind of observing environments are present in artificial intelligence? a) Partial b) Fully c) Learning d) Both a & b
What kind of behavior does the stochastic environment posses? a) Local b) Deterministic c) Ratioanl d) Primary
Which environment is called as semidynamic? a) Environment does not change with the passage of time b) Agent performance changes c) Environment will be changed d) Both a & b
Where does the performance measure is included? a) Rational agent b) Task environment c) Actuators d) Sensor
The main task of a problem-solving agent is a) Solve the given problem and reach to goal b) To find out which sequence of action will get it to the goal state c) Both a) and b) d) Neither a) nor b)
. What is state space? a) The whole problem b) Your Definition to a problem c) Problem you design d) Representing your problem with variable and parameter
The problem-solving agent with several immediate options of unknown value can decide what to do by just examining different possible sequences of actions that lead to states of known value, and then choosing the best sequence. This process of looking for such a sequence is called Search. State True or False a) True b) False
A problem in a search space Is defined by, a) Initial state b) Goal test c) Intermediate states d) All of the above
The Set of actions for a problem in a state space is formulated by a ___________. a) Intermediate states b) Initial state c) Successor function, which takes current action and returns next immediate state d) None of the mentioned
A problem solving approach works well for a) 8-Puzzle problem b) 8-queen problem c) Finding a optimal path from a given source to a destination d) Mars Hover (Robot Navigation)
Optimality of BFS is a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal d) Both a & c
How many successors are generated in backtracking search? a) 1 b) 2 c) 3 d) 4
