_________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations.
a) Constraints Satisfaction Problems
b) Uninformed Search Problems
c) Local Search Problems
d) Only a) and b)


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More AI Robotics Interview Questions

Which depends on the percepts and actions available to the agent? a) Agent b) Sensor c) Design problem d) None of the mentioned

0 Answers  


Differentiate between the iqbot, metabot and a taskbot?

0 Answers  


. 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

0 Answers  


What is the purpose of intelligence?

0 Answers  


a) PROLOG b) Java c) LISP d) Perl e) Java script

1 Answers  






What are steps to ensure the business stays relevant to the ai revolution?

0 Answers  


Which 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

0 Answers  


Agents behavior can be best described by a) Perception sequence b) Agent function c) Sensors and Actuators d) Environment in which agent is performing

1 Answers  


What is augmented human intelligence?

0 Answers  


In inductive logic programming what needed to be satisfied?

0 Answers  


What is the other name of informed search strategy? a) Simple search b) Heuristic search c) Online search d) None of the mentioned

0 Answers  


A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. State whether True or False. a) True b) False

0 Answers  


Categories