Artificial Intelligence and Robotics (AIR) MCQs with answers Page - 3

Here, you will find a collection of MCQ questions on Artificial Intelligence and Robotics (AIR). Go through these questions to enhance your preparation for upcoming examinations and interviews.

To check the correct answer, simply click the View Answer button provided for each question.

Have your own questions to contribute? Click the button below to share your MCQs with others!

+ Add Question

A

Admin • 828.03K Points
Coach

Q. If it is possible to extend each pair of consistent variable instantiation to a third variable, a CSP is said to be

  • (A) arc consistent
  • (B) i- consistent
  • (C) path consistent
  • (D) 2- consistent

A

Admin • 828.03K Points
Coach

Q. If it is possible to extend each pair of consistent variable instantiation to a third variable, a CSP is said to be

  • (A) arc consistent
  • (B) i- consistent
  • (C) path consistent.
  • (D) 2- consistent

A

Admin • 828.03K Points
Coach

Q. Which of the following combination of labels is not allowed for W joint in scene labelling is not allowed

  • (A) (+,-,+)
  • (B) (-,+,-)
  • (C) (←,+,←)
  • (D) (←,←,←)

A

Admin • 828.03K Points
Coach

Q. ____________ Procedure selects a flaw in a given plan and looks for a resolver.

  • (A) goal stack planning
  • (B) recursive goal stack planning
  • (C) the plan space planning
  • (D) partial order planning

A

Admin • 828.03K Points
Coach

Q. ____search regresses over goals and validate a plan before returning it.

  • (A) backward state space
  • (B) forward state space
  • (C) goa stack
  • (D) none of these

A

Admin • 828.03K Points
Coach

Q. The working memory of the problem solver is like its

  • (A) long term memory
  • (B) short term memory
  • (C) permanent memory
  • (D) none of these

A

Admin • 828.03K Points
Coach

Q. Which of the following are true for the algorithms Beam Stack Search (BSS)and Divide-and-Conquer Beam Stack Search (DCBSS).

  • (A) bss finds the optimal path while dcbss does not.
  • (B) dcbss finds the optimal path while bss does not.
  • (C) both bss and dcbss find the optimal path
  • (D) neither bss and dcbss find the optimal path

A

Admin • 828.03K Points
Coach

Q. The performance of an agent can be improved by __________

  • (A) learning
  • (B) observing
  • (C) perceiving
  • (D) sensing

A

Admin • 828.03K Points
Coach

Q. _______ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill.

  • (A) up-hill search
  • (B) hill-climbing
  • (C) hill algorithm
  • (D) reverse-down-hill search

A

Admin • 828.03K Points
Coach

Q. Not only do formal logics allow representation of knowledge, but they also allow representation of knowledge Mechanisms for reasoning using a collection of well-defined manipulation rules Of Representations.

  • (A) false
  • (B) true
  • (C) ---
  • (D) ---

Add MCQ in this Category

If you want to share an MCQ question in this category, it's a great idea! It will be helpful for many other students using this website.

Share Your MCQ

Browse Categories

Click on category to learn MCQs of that category.