Artificial Intelligence And Robotics Set 3

Computer Science Engineering (CSE)

Practice Mode Previous Next
On This Page

This set of Artificial Intelligence and Robotics AIR Multiple Choice Questions & Answers (MCQs) focuses on Artificial Intelligence And Robotics Set 3

Q1 | Which of the following is an extension of the semantic network?
  • expert systems
  • rule based expert systems
  • decision tree based networks
  • partitioned networks
Answer: partitioned networks
Q2 | Is the below statement true for the domain of positive integers ∀p ∃q ( p + q = 7)
  • yes
  • no
Answer: yes
Q3 | Which of the following is a sound rule of inference?
  • q ∧ (p → q) → p
  • p → (p ∨ q)
  • q ∨ (p → q) → p
  • all of above
Answer: p → (p ∨ q)
Q4 | ∀x ∃ y P(x,y) ≡ ∃ y ∀ x P(x,y)
  • yes
  • no
Answer: no
Q5 | Is ∀z S(x,y) a well-formed formula?
  • yes
  • no
Answer: yes
Q6 | The statement comprising the limitations of FOL is/are ____________
  • expressiveness
  • formalizing natural languages
  • many-sorted logic
  • all of the mentioned
Answer: all of the mentioned
Q7 | iv. Compound Logic
  • i. and ii.
  • i. and iii.
  • ii. and iii.
  • iii. and iv.
Answer: ii. and iii.
Q8 | what is the issue of Forward State Space Planning?
  • low banching factor.
  • large branching factor.
  • work in forward fashion
  • work in backward fashion
Answer: large branching factor.
Q9 | Goal Stack Planning breaks up a ______________________________
  • initial state
  • stack in different part
  • set of goal predicates into individual subgoals
  • all of the above
Answer: set of goal predicates into individual subgoals
Q10 | What is true about Linear Planning?
  • it refers to the fact that the subgoals are attempted and solved in a linear order.
  • attempts to solve subgoals individually one after another.
  • attempts to solve subgoal individually in non linear fashion
  • both a & b
Answer: both a & b
Q11 | Agent interacts with the world via _______________ and ______________
  • decision , effect
  • perception, decision
  • perception, action
  • perception, effect
Answer: perception, action
Q12 | The start node for search in plan space planning is_______________
  • bfs
  • dfs
  • both dfs and bfs
  • a*
Answer: both dfs and bfs
Q13 | 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.
  • forward chaining
  • backward chaining
  • reverse chaining
  • both b & c
Answer: forward chaining
Q14 | The components of Expert system are?
  • a set of rules, the inference engine (ie), forward chaining
  • a set of rules, backward chaining, a working memory (wm)
  • a set of rules, the inference engine (ie), a working memory (wm)
  • a set of rules, forward chaining, backward chaining
Answer: a set of rules, the inference engine (ie), a working memory (wm)
Q15 | What is true about Artificial Intelligence?
  • the ability to solve problems”.
  • the ability to act rationally.
  • the ability to act like humans
  • all of the above
Answer: all of the above
Q16 | Which of the following are Informed search algorithms?
  • best first search
  • a* search
  • iterative deeping search
  • both a & b
Answer: both a & b
Q17 | If there is a solution, breadth first search is _______________to find it
  • difficult
  • guaranteed
  • not able to find
  • none of the above
Answer: guaranteed
Q18 | Which search strategy is combining the benefits of both BFS and DFS?
  • depth limited search
  • a*
  • iterative deepening depth first search
  • best first search
Answer: iterative deepening depth first search
Q19 | Admissibility of the heuristic function is given as:
  • h(n)>= h*(n)
  • h(n)< h*(n)
  • h(n)== h*(n)
  • h(n)<= h*(n)
Answer: h(n)<= h*(n)
Q20 | The efficiency of A* algorithm depends on __________________________
  • depth
  • the quality of heuristic
  • unknown nodes
  • d.none of the above
Answer: the quality of heuristic
Q21 | What is the termination criteria in Hill climbing?
  • when no successor of the node has better heuristic value.
  • when successor of the node has better heuristic value.
  • when no ancestor of the node has better heuristic value.
  • when ancestor of the node has better heuristic value.
Answer: when no successor of the node has better heuristic value.
Q22 | What is true about variable neighborhood function?
  • neighbourhood functions that are sparse lead to quicker movement during search
  • algorithm has to inspect very fewer neighbours
  • vdn stars searching with sparse neighbourhood functions, when it reaches an optimum, it switches to denser function.
  • all of the above
Answer: all of the above
Q23 | _______________________requires Linear Space but uses backtracking
  • breadth first search
  • recursive best first search (rbfs)
  • a*
  • ida*
Answer: recursive best first search (rbfs)
Q24 | Which property asks that the algorithm is locally admissible?
  • admissibility
  • monotonicity
  • informedness
  • none of the above
Answer: monotonicity
Q25 | A* Search Algorithm _______________
  • does not expand the node which have the lowest value of f(n),
  • finds the shortest path through the search space using the heuristic function i.e f(n)=g(n) + h(n)
  • terminates when the goal node is not found.
  • all of the above
Answer: finds the shortest path through the search space using the heuristic function i.e f(n)=g(n) + h(n)
Previous Next