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

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 • 802.91K Points
Coach

Q. The start node for search in plan space planning is______

  • (A) bfs
  • (B) dfs
  • (C) both dfs and bfs
  • (D) a*

A

Admin • 802.91K Points
Coach

Q. In which chaining, the Left-Hand side is used to match the rules and Right-Hand side is used to check the effect of using the rule.

  • (A) forward chaining
  • (B) backward chaining
  • (C) reverse chaining
  • (D) both b & c

A

Admin • 802.91K Points
Coach

Q. The components of Expert system are?

  • (A) a set of rules, the inference engine (ie), forward chaining
  • (B) a set of rules, backward chaining, a working memory (wm)
  • (C) a set of rules, the inference engine (ie), a working memory (wm)
  • (D) a set of rules, forward chaining, backward chaining

A

Admin • 802.91K Points
Coach

Q. What is true about Artificial Intelligence?

  • (A) the ability to solve problems”.
  • (B) the ability to act rationally.
  • (C) the ability to act like humans
  • (D) all of the above

A

Admin • 802.91K Points
Coach

Q. Which of the following are Informed search algorithms?

  • (A) best first search
  • (B) a* search
  • (C) iterative deeping search
  • (D) both a & b

A

Admin • 802.91K Points
Coach

Q. If there is a solution, breadth first search is _______________to find it

  • (A) difficult
  • (B) guaranteed
  • (C) not able to find
  • (D) none of the above

A

Admin • 802.91K Points
Coach

Q. Which search strategy is combining the benefits of both BFS and DFS?

  • (A) depth limited search
  • (B) a*
  • (C) iterative deepening depth first search
  • (D) best first search

A

Admin • 802.91K Points
Coach

Q. Admissibility of the heuristic function is given as:

  • (A) h(n)>= h*(n)
  • (B) h(n)< h*(n)
  • (C) h(n)== h*(n)
  • (D) h(n)<= h*(n)

A

Admin • 802.91K Points
Coach

Q. The efficiency of A* algorithm depends on ___________________

  • (A) depth
  • (B) the quality of heuristic
  • (C) unknown nodes
  • (D) none of the above

A

Admin • 802.91K Points
Coach

Q. What is the termination criteria in Hill climbing?

  • (A) when no successor of the node has better heuristic value.
  • (B) when successor of the node has better heuristic value.
  • (C) when no ancestor of the node has better heuristic value.
  • (D) when ancestor of the node has better heuristic value.

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.