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

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. What is true about Linear Planning?

  • (A) it refers to the fact that the subgoals are attempted and solved in a linear order.
  • (B) attempts to solve subgoals individually one after another.
  • (C) attempts to solve subgoal individually in non linear fashion
  • (D) both a & b

A

Admin • 828.03K Points
Coach

Q. Agent interacts with the world via _______________ and ______________

  • (A) decision , effect
  • (B) perception, decision
  • (C) perception, action
  • (D) perception, effect

A

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

Q. The efficiency of A* algorithm depends on __________________________

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

A

Admin • 828.03K Points
Coach

Q. _______________________requires Linear Space but uses backtracking

  • (A) breadth first search
  • (B) recursive best first search (rbfs)
  • (C) a*
  • (D) ida*

A

Admin • 828.03K Points
Coach

Q. A* Search Algorithm _______________

  • (A) does not expand the node which have the lowest value of f(n),
  • (B) finds the shortest path through the search space using the heuristic function i.e f(n)=g(n) + h(n)
  • (C) terminates when the goal node is not found.
  • (D) all of the above

A

Admin • 828.03K Points
Coach

Q. Tabu search is designed __________________________

  • (A) as it does not follow aspiration criteria
  • (B) to escape the trap of local optimality.
  • (C) to unrecord forbidden moves, which are referred to as tabu moves .
  • (D) all of the above

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.