Artificial Intelligence and Robotics (AIR) Solved MCQs
| 1. |
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 |
| Answer» B. short term memory | |
| 2. |
_____________search regresses over goals and validate a plan before returning it. |
| A. | forward state space |
| B. | backward state space |
| C. | goa stack |
| D. | none of these |
| Answer» B. backward state space | |
| 3. |
_____________ Procedure selects a flaw in a given plan and looks for a resolver. |
| A. | goal stack planning |
| B. | the plan space planning |
| C. | recursive goal stack planning |
| D. | partial order planning |
| Answer» B. the plan space planning | |
| 4. |
Which of the following combination of labels is not allowed for W joint in scene labelling is not allowed |
| A. | (+,-,+) |
| B. | (-,+,-) |
| C. | (←,+,←) |
| D. | (←,←,←) |
| Answer» D. (←,←,←) | |
| 5. |
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 |
| Answer» C. path consistent. | |
| 6. |
The __________algorithm explores the domain in a depth first manner. |
| A. | backtracking |
| B. | forward checking |
| C. | arc consistency |
| D. | strategic retreat |
| Answer» A. backtracking | |
| 7. |
_________________ 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. | all of the mentioned |
| Answer» A. constraints satisfaction problems | |
| 8. |
Which of the Following problems can be modeled as CSP? |
| A. | 8-puzzle problemb. |
| B. | 8-queen problem |
| C. | map coloring problem |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 9. |
Backtracking is based on ____________ |
| A. | last in first out |
| B. | first in first out |
| C. | recursion |
| D. | both last in first out & recursion |
| Answer» D. both last in first out & recursion | |
| 10. |
The inference engine goes through which cycle? |
| A. | match-resolve-execute |
| B. | execute-resolve-match |
| C. | resolve match match |
| D. | resolve match execute |
| Answer» A. match-resolve-execute | |
| 11. |
The output of MATCH routine in Inference Engine is ______________ |
| A. | pattern set |
| B. | conflict set (cs) |
| C. | rule set |
| D. | action set |
| Answer» B. conflict set (cs) | |
| 12. |
Operator PUTDOWN has which of the following sequence of actions? |
| A. | holding(x),ontable(x),holding(x) |
| B. | holding(x),armempty, holding(x) |
| C. | holding(x),ontable(x) |
| D. | holding(x),ontable(x)^armempty, holding(x) |
| Answer» D. holding(x),ontable(x)^armempty, holding(x) | |
| 13. |
Frame problem in STRIPS Domain can be solved by _____________________ |
| A. | operator |
| B. | frame aximoms |
| C. | precondition |
| D. | action |
| Answer» B. frame aximoms | |
| 14. |
PDDL stands for_________________________ |
| A. | path data description language |
| B. | planning domain description language |
| C. | planning data description language |
| D. | path data deleted language |
|
Answer»
B. planning domain description language
view more info and meaning of PDDL 
|
|
| 15. |
In PDDL,the Language is based on _______________________ |
| A. | propositional logic notation |
| B. | second order logic notation |
| C. | first order logic notation |
| D. | all of these |
| Answer» C. first order logic notation | |
| 16. |
STRIPS operators are made up of which three components: |
| A. | p: precondition list , a: add list , d:delete list |
| B. | p: postcondition list , a: add list , d:delete list |
| C. | p: precondition list , s: sub list , d:delete list |
| D. | p: postcondition list , s: sub list , d:delete list |
| Answer» A. p: precondition list , a: add list , d:delete list | |
| 17. |
Which search algorithm imposes a fixed depth limit on nodes? |
| A. | depth-limited search |
| B. | depth-first search |
| C. | iterative deepening search |
| D. | bidirectional search |
| Answer» A. depth-limited search | |
| 18. |
In a rule-based system, procedural domain knowledge is in the form of:___________ |
| A. | production rules |
| B. | rule interpreters |
| C. | meta-rules |
| D. | control rules |
| Answer» A. production rules | |
| 19. |
_____________ is a state that is better than all its neighboring states but is not better than some other states further away |
| A. | plateau |
| B. | local maximum |
| C. | global maximum |
| D. | all of the above |
| Answer» B. local maximum | |
| 20. |
___________ algorithm keeps track of k states rather than just one. |
| A. | hill-climbing search |
| B. | local beam search |
| C. | stochastic hill-climbing search |
| D. | random restart hill-climbing search |
| Answer» B. local beam search | |
| 21. |
Which is the most straightforward approach for planning algorithm? |
| A. | best-first search |
| B. | state-space search |
| C. | depth-first search |
| D. | hill-climbing search |
| Answer» B. state-space search | |
| 22. |
_______ is/are the well known Expert System/s for medical diagnosis systems |
| A. | mysin |
| B. | caduceus |
| C. | dendral |
| D. | smh.pal |
| Answer» A. mysin | |
| 23. |
Which of the following statement(s) is true for Sparse-Memory Graph Search (SMGS)? |
| A. | the boundary is defined as those nodes in closed that have at least one successor still in open |
| B. | the nodes in closed that are not on the boundary are in the kernel |
| C. | the number of relay nodes on each path is exactly one. |
| D. | both a & b |
| Answer» D. both a & b | |
| 24. |
Which of the following algorithm is generally used CSP search algorithm? |
| A. | breadth-first search algorithm |
| B. | depth-first search algorithm |
| C. | hill-climbing search algorithm |
| D. | none of the mentioned |
| Answer» B. depth-first search algorithm | |
| 25. |
Which of the following conditions must hold for a solution to a CSP? |
| A. | all relations in all constraints must hold |
| B. | at least one relation in all constraints must hold. |
| C. | more than one relation in all constraints must hold. |
| D. | all relations in at least one constraint must hold. |
| Answer» B. at least one relation in all constraints must hold. | |
| 26. |
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 |
| Answer» C. both bss and dcbss find the optimal path | |
| 27. |
The performance of an agent can be improved by __________ |
| A. | learning |
| B. | observing |
| C. | perceiving |
| D. | sensing |
| Answer» A. learning | |
| 28. |
__________ 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 |
| Answer» B. hill-climbing | |
| 29. |
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. | true |
| B. | false |
| Answer» A. true | |
| 30. |
If a logic produces only true statements and does not produce any false statement it shows which of the following property |
| A. | completeness |
| B. | soundness |
| C. | consistency |
| D. | none of these |
| Answer» B. soundness | |
| 31. |
Is the following rule of inference valid one |
| A. | no |
| B. | yes |
| Answer» B. yes | |
| 32. |
_________Graph is used to represent semantic network |
| A. | undirected |
| B. | directed |
| C. | undirected |
| D. | any one of the above |
| Answer» B. directed | |
| 33. |
What is the nature of the sentence: ∀x ∀y (TeacherOf(x,y) ⊃ StudentOf(y,x)) |
| A. | symmetry |
| B. | exhaustiveness |
| C. | inverse |
| D. | none of the above |
| Answer» C. inverse | |
| 34. |
The formula or sentences that can be maid true by certain valuation function are called |
| A. | valid formula |
| B. | satisfiable formula |
| C. | unsatisfiable formula |
| D. | invalid formula |
| Answer» B. satisfiable formula | |
| 35. |
A _________ is used to demonstrate, on a purely syntactic basis, that one formula is a logical consequence of another formula. |
| A. | deductive systems |
| B. | inductive systems |
| C. | reasoning with knowledge based systems |
| D. | search based systems |
| Answer» A. deductive systems | |
| 36. |
• is evaluated last. |
| A. | true |
| B. | false |
| Answer» A. true | |
| 37. |
A Term is either an individual constant (a 0-ary function), or a variable, or an n-ary function applied to n terms: F(t1 t2 ..tn). |
| A. | true |
| B. | false |
| Answer» A. true | |
| 38. |
First Order Logic is also known as ___________ |
| A. | first order predicate calculus |
| B. | quantification theory |
| C. | lower order calculus |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 39. |
Which is used to compute the truth of any sentence? |
| A. | semantics of propositional logic |
| B. | alpha-beta pruning |
| C. | first-order logic |
| D. | both semantics of propositional logic & alpha-beta pruning |
| Answer» A. semantics of propositional logic | |
| 40. |
From which rule does the modus ponens are derived? |
| A. | inference rule |
| B. | module rule |
| C. | both inference & module rule |
| D. | c.none of the mentioned |
| Answer» A. inference rule | |
| 41. |
Which form is called as a conjunction of disjunction of literals? |
| A. | conjunctive normal form |
| B. | disjunctive normal form |
| C. | normal form |
| D. | all of the mentioned |
| Answer» A. conjunctive normal form | |
| 42. |
What can be viewed as a single lateral of disjunction? |
| A. | multiple clause |
| B. | combine clause |
| C. | unit clause |
| D. | none of the mentioned |
| Answer» C. unit clause | |
| 43. |
Choose the correct option. |
| A. | a is true, b is true |
| B. | a is false, b is false |
| C. | a is true, b is false |
| D. | a is false, b is true |
| Answer» A. a is true, b is true | |
| 44. |
What among the following constitutes the representation of the knowledge in different forms? |
| A. | relational method where each fact is set out systematically in columns |
| B. | inheritable knowledge where relational knowledge is made up of objects |
| C. | inferential knowledge |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 45. |
What are Semantic Networks? |
| A. | a way of representing knowledge |
| B. | data structure |
| C. | data type |
| D. | none of the mentioned |
| Answer» A. a way of representing knowledge | |
| 46. |
Graph used to represent semantic network is _____________ |
| A. | undirected graph |
| B. | directed graph |
| C. | directed acyclic graph (dag) |
| D. | directed complete graph |
| Answer» B. directed graph | |
| 47. |
The basic inference mechanism in semantic network is to follow the links between the nodes. |
| A. | true |
| B. | false |
| Answer» A. true | |
| 48. |
Which of the following elements constitutes the frame structure? |
| A. | facts or data |
| B. | procedures and default values |
| C. | frame names |
| D. | frame reference in hierarchy |
| Answer» A. facts or data | |
| 49. |
There exists two way to infer using semantic networks in which knowledge is represented as Frames. |
| A. | intersection search |
| B. | inheritance search |
| Answer» A. intersection search | |
| 50. |
Which problem can frequently occur in backward chaining algorithm? |
| A. | repeated states |
| B. | incompleteness |
| C. | complexity |
| D. | both repeated states & incompleteness |
| Answer» D. both repeated states & incompleteness | |
| 51. |
Which of the following is an extension of the semantic network? |
| A. | expert systems |
| B. | rule based expert systems |
| C. | decision tree based networks |
| D. | partitioned networks |
| Answer» D. partitioned networks | |
| 52. |
Is the below statement true for the domain of positive integers ∀p ∃q ( p + q = 7) |
| A. | yes |
| B. | no |
| Answer» A. yes | |
| 53. |
Which of the following is a sound rule of inference? |
| A. | q ∧ (p → q) → p |
| B. | p → (p ∨ q) |
| C. | q ∨ (p → q) → p |
| D. | all of above |
| Answer» B. p → (p ∨ q) | |
| 54. |
∀x ∃ y P(x,y) ≡ ∃ y ∀ x P(x,y) |
| A. | yes |
| B. | no |
| Answer» B. no | |
| 55. |
Is ∀z S(x,y) a well-formed formula? |
| A. | yes |
| B. | no |
| Answer» A. yes | |
| 56. |
The statement comprising the limitations of FOL is/are ____________ |
| A. | expressiveness |
| B. | formalizing natural languages |
| C. | many-sorted logic |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 57. |
iv. Compound Logic" |
| A. | i. and ii. |
| B. | i. and iii. |
| C. | ii. and iii. |
| D. | iii. and iv. |
| Answer» C. ii. and iii. | |
| 58. |
what is the issue of Forward State Space Planning? |
| A. | low banching factor. |
| B. | large branching factor. |
| C. | work in forward fashion |
| D. | work in backward fashion |
| Answer» B. large branching factor. | |
| 59. |
Goal Stack Planning breaks up a ______________________________ |
| A. | initial state |
| B. | stack in different part |
| C. | set of goal predicates into individual subgoals |
| D. | all of the above |
| Answer» C. set of goal predicates into individual subgoals | |
| 60. |
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 |
| Answer» D. both a & b | |
| 61. |
Agent interacts with the world via _______________ and ______________ |
| A. | decision , effect |
| B. | perception, decision |
| C. | perception, action |
| D. | perception, effect |
| Answer» C. perception, action | |
| 62. |
The start node for search in plan space planning is_______________ |
| A. | bfs |
| B. | dfs |
| C. | both dfs and bfs |
| D. | a* |
| Answer» C. both dfs and bfs | |
| 63. |
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 |
| Answer» A. forward chaining | |
| 64. |
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 |
| Answer» C. a set of rules, the inference engine (ie), a working memory (wm) | |
| 65. |
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 |
| Answer» D. all of the above | |
| 66. |
Which of the following are Informed search algorithms? |
| A. | best first search |
| B. | a* search |
| C. | iterative deeping search |
| D. | both a & b |
| Answer» D. both a & b | |
| 67. |
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 |
| Answer» B. guaranteed | |
| 68. |
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 |
| Answer» C. iterative deepening depth first search | |
| 69. |
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) |
| Answer» D. h(n)<= h*(n) | |
| 70. |
The efficiency of A* algorithm depends on __________________________ |
| A. | depth |
| B. | the quality of heuristic |
| C. | unknown nodes |
| D. | d. none of the above |
| Answer» B. the quality of heuristic | |
| 71. |
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. |
| Answer» A. when no successor of the node has better heuristic value. | |
| 72. |
What is true about variable neighborhood function? |
| A. | neighbourhood functions that are sparse lead to quicker movement during search |
| B. | algorithm has to inspect very fewer neighbours |
| C. | vdn stars searching with sparse neighbourhood functions, when it reaches an optimum, it switches to denser function. |
| D. | all of the above |
| Answer» D. all of the above | |
| 73. |
_______________________requires Linear Space but uses backtracking |
| A. | breadth first search |
| B. | recursive best first search (rbfs) |
| C. | a* |
| D. | ida* |
| Answer» B. recursive best first search (rbfs) | |
| 74. |
Which property asks that the algorithm is locally admissible? |
| A. | admissibility |
| B. | monotonicity |
| C. | informedness |
| D. | none of the above |
| Answer» B. monotonicity | |
| 75. |
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 |
| Answer» B. finds the shortest path through the search space using the heuristic function i.e f(n)=g(n) + h(n) | |
| 76. |
Which is not problem in Hill climing? |
| A. | plateau |
| B. | ridges |
| C. | local maximum |
| D. | landscape |
| Answer» D. landscape | |
| 77. |
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 |
| Answer» B. to escape the trap of local optimality. | |
| 78. |
Production/Rule looks like________________ |
| A. | pattern-->data |
| B. | action-->data |
| C. | pattern-->action |
| D. | none of the above |
| Answer» C. pattern-->action | |
| 79. |
How can we convert AO graph with mixed nodes into graph with pure AND and OR nodes? |
| A. | by traversing multiple node |
| B. | by deleting one of the node |
| C. | by addition of extra node |
| D. | none of the above |
| Answer» C. by addition of extra node | |
| 80. |
Arc consistency in AO graph is concernd with ____________________________________ |
| A. | nodes |
| B. | finding consistent values for pairs of variables. |
| C. | unary constraint |
| D. | all of the above |
| Answer» B. finding consistent values for pairs of variables. | |
| 81. |
A planning problem P in BSSP is defined as a _____________ |
| A. | triple (s, g, o) |
| B. | triple (s1, s2, o) |
| C. | triple (g1, g, o) |
| D. | none of the above |
| Answer» A. triple (s, g, o) | |
| 82. |
Plan representation in Plan Space Planning is done with__ -----------links |
| A. | binding links |
| B. | ordering links and casual link |
| C. | contigent link |
| D. | head step |
| Answer» B. ordering links and casual link | |
| 83. |
What is true aboout Iterative Deepening DFS? |
| A. | it does not perform dfs in a bfs fashion. |
| B. | it is the preferred informed search method |
| C. | it’s a depth first search, but it does it one level at a time, gradually increasing the limit, until a goal is found. |
| D. | is a depth-first search with a fixed depth limit l |
| Answer» C. it’s a depth first search, but it does it one level at a time, gradually increasing the limit, until a goal is found. | |
| 84. |
What is the main advantage of backward state-space search? |
| A. | cost |
| B. | actions |
| C. | relevant actions |
| D. | all of the mentioned |
| Answer» C. relevant actions | |
| 85. |
Backward State Space Planning (BSSP)_______________________________ |
| A. | simply explores the set of all future states in possible order |
| B. | start searching backwards from the goal |
| C. | leads to huge search space |
| D. | has no sense of direction |
| Answer» B. start searching backwards from the goal | |
| 86. |
In Backward State Space Planning ,regress(A,G) that returns ______________________________ |
| A. | the regressed goal over action a when applied to goal g. |
| B. | the goal state over action a when applied to goal g. |
| C. | the initial state over action a when applied to goal g. |
| D. | both a & b |
| Answer» A. the regressed goal over action a when applied to goal g. | |
| 87. |
What is true about Backward State Space Planning? |
| A. | goal states are often incompletely specified. |
| B. | expresses only what is desired in the final state, rather than a complete description of the final state. |
| C. | it uses regression |
| D. | all of the above |
| Answer» D. all of the above | |
| 88. |
effects⁺ (a) in Forward State Space Planning denotes ___________________ |
| A. | denotes the set of negative effects of action a |
| B. | denotes the set of neutral effects of action a |
| C. | denotes the set of positive effects of action a |
| D. | none of the above |
| Answer» C. denotes the set of positive effects of action a | |
| 89. |
In Forward State Space Planning , Progress ( A, S) function returns ___________________ |
| A. | the successor state s when action a is applied to state s. |
| B. | the predecessor state s when action a is applied to state s. |
| C. | both a & b |
| D. | none of the above |
| Answer» A. the successor state s when action a is applied to state s. | |
| 90. |
What are the drawbacks of Forward State Space Planning? |
| A. | fssp has very huge search space |
| B. | it includes the actions that have nothing go do with achieving the goal |
| C. | regression is used in forward state space planning |
| D. | both a & b |
| Answer» D. both a & b | |
| 91. |
What arcs represents in AO Graph? |
| A. | subproblem to be solved individually |
| B. | solution |
| C. | path |
| D. | sequence of actions |
| Answer» A. subproblem to be solved individually | |
| 92. |
Which are the first AI applications of AO graph? |
| A. | saint |
| B. | xcon |
| C. | dendral |
| D. | both a and c |
| Answer» D. both a and c | |
| 93. |
What is Hyper-Edge in AO Graph? |
| A. | many edges together can be hyber edge |
| B. | those are and edges only |
| C. | both 1 and 2 |
| D. | none of the above |
| Answer» C. both 1 and 2 | |
| 94. |
What cost is assumed for arc while solving AO* progress example? |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | 3 |
| Answer» B. 1 | |
| 95. |
What is the heuristic cost of SOLVED nodes in AO* example? |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | 3 |
| Answer» A. 0 | |
| 96. |
What is used to lable primitive problems in AO problem? |
| A. | unvisited |
| B. | unsolved |
| C. | solved |
| D. | visited |
| Answer» C. solved | |
Tags
Question and answers in Artificial Intelligence and Robotics (AIR),
Artificial Intelligence and Robotics (AIR) multiple choice questions and answers,
Artificial Intelligence and Robotics (AIR) Important MCQs,
Solved MCQs for Artificial Intelligence and Robotics (AIR),
Artificial Intelligence and Robotics (AIR) MCQs with answers PDF download