Interested to Buy Any Domain ? << Click Here >> for more details...
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
3108A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. State whether true or false. a) True b) False
1 3221he process of removing detail from a given state representation is called______. a) Extraction b) Abstraction c) Information Retrieval d) Mining of data
1 3668A 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)
3265Optimality 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
2240In A* approach evaluation function is a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
4999In A* approach evaluation function is a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
2200A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal. a) True b) False
2381What is the other name of informed search strategy? a) Simple search b) Heuristic search c) Online search d) None of the mentioned
5282What is the heuristic function of greedy best-first search? a) f(n) != h(n) b) f(n) < h(n) c) f(n) = h(n) d) f(n) > h(n)
1602Which search uses only the linear space for searching? a) Best-first search b) Recursive best-first search c) Depth-first search d) None of the mentioned
3071Which method is used to search better by learning? a) Best-first search b) Depth-first search c) Metalevel state space d) None of the mentioned
4055Which is used to improve the performance of heuristic search? a) Quality of nodes b) Quality of heuristic function c) Simple form of nodes d) None of the mentioned
4893Post New AI Robotics Questions
What is prolog in ai?
What is used for tracking uncertain events? a) Filtering algorithm b) Sensors c) Actuators d) None of the mentioned
What is artificial intelligence robotics?
What is hidden markov model (hmms) is used?
In A* approach evaluation function is a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
How to send information from the robot sensors to the robot controllers?
Which kind of agent architecture should an agent an use? a) Relaxed b) Logic c) Relational d) All of the mentioned
Specify the agent architecture name that is used to capture all kinds of actions. a) Complex b) Relational c) Hybrid d) None of the mentioned
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
Which is used to improve the performance of heuristic search? a) Quality of nodes b) Quality of heuristic function c) Simple form of nodes d) None of the mentioned
___________ algorithm keeps track of k states rather than just one. a) Hill-Climbing search b) Local Beam search c) Stochastic hill-climbing search d) Random restart hill-climbing search
A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal. a) True b) False
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
What are expert systems limitations?
