Artificial Intelligence and Robotics (AIR) | Set 1
1. The working memory of the problem solver is like its _________________
Correct : B. short term memory
2. _____________search regresses over goals and validate a plan before returning it.
Correct : B. backward state space
3. _____________ Procedure selects a flaw in a given plan and looks for a resolver.
Correct : 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
Correct : D. (←,←,←)
5. If it is possible to extend each pair of consistent variable instantiation to a third variable, a CSP is said to be _________________
Correct : C. path consistent.
6. The __________algorithm explores the domain in a depth first manner.
Correct : A. backtracking
7. _________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations.
Correct : A. constraints satisfaction problems
8. Which of the Following problems can be modeled as CSP?
Correct : D. all of the mentioned
9. Backtracking is based on ____________
Correct : D. both last in first out & recursion
10. The inference engine goes through which cycle?
Correct : A. match-resolve-execute
11. The output of MATCH routine in Inference Engine is ______________
Correct : B. conflict set (cs)
12. Operator PUTDOWN has which of the following sequence of actions?
Correct : D. holding(x),ontable(x)^armempty, holding(x)
13. Frame problem in STRIPS Domain can be solved by _____________________
Correct : B. frame aximoms
14. PDDL stands for_________________________
Correct : B. planning domain description language
15. In PDDL,the Language is based on _______________________
Correct : C. first order logic notation
16. STRIPS operators are made up of which three components:
Correct : A. p: precondition list , a: add list , d:delete list
17. Which search algorithm imposes a fixed depth limit on nodes?
Correct : A. depth-limited search
18. In a rule-based system, procedural domain knowledge is in the form of:___________
Correct : 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
Correct : B. local maximum
20. ___________ algorithm keeps track of k states rather than just one.
Correct : B. local beam search
21. Which is the most straightforward approach for planning algorithm?
Correct : B. state-space search
22. _______ is/are the well known Expert System/s for medical diagnosis systems
Correct : A. mysin
23. Which of the following statement(s) is true for Sparse-Memory Graph Search (SMGS)?
Correct : D. both a & b
24. Which of the following algorithm is generally used CSP search algorithm?
Correct : B. depth-first search algorithm
25. Which of the following conditions must hold for a solution to a CSP?
Correct : 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).
Correct : C. both bss and dcbss find the optimal path
27. The performance of an agent can be improved by __________
Correct : A. learning
28. __________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill.
Correct : 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.
Correct : A. true
30. If a logic produces only true statements and does not produce any false statement it shows which of the following property
Correct : B. soundness
31. Is the following rule of inference valid one
Correct : B. yes
32. _________Graph is used to represent semantic network
Correct : B. directed
33. What is the nature of the sentence: ∀x ∀y (TeacherOf(x,y) ⊃ StudentOf(y,x))
Correct : C. inverse
34. The formula or sentences that can be maid true by certain valuation function are called
Correct : B. satisfiable formula
35. A _________ is used to demonstrate, on a purely syntactic basis, that one formula is a logical consequence of another formula.
Correct : A. deductive systems
36. • is evaluated last.
Correct : 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).
Correct : A. true
38. First Order Logic is also known as ___________
Correct : D. all of the mentioned
39. Which is used to compute the truth of any sentence?
Correct : A. semantics of propositional logic
40. From which rule does the modus ponens are derived?
Correct : A. inference rule
41. Which form is called as a conjunction of disjunction of literals?
Correct : A. conjunctive normal form
42. What can be viewed as a single lateral of disjunction?
Correct : C. unit clause
43. Choose the correct option.
Correct : A. a is true, b is true
44. What among the following constitutes the representation of the knowledge in different forms?
Correct : D. all of the mentioned
45. What are Semantic Networks?
Correct : A. a way of representing knowledge
46. Graph used to represent semantic network is _____________
Correct : B. directed graph
47. The basic inference mechanism in semantic network is to follow the links between the nodes.
Correct : A. true
48. Which of the following elements constitutes the frame structure?
Correct : A. facts or data
49. There exists two way to infer using semantic networks in which knowledge is represented as Frames.
Correct : A. intersection search
50. Which problem can frequently occur in backward chaining algorithm?
Correct : D. both repeated states & incompleteness
51. Which of the following is an extension of the semantic network?
Correct : D. partitioned networks
52. Is the below statement true for the domain of positive integers ∀p ∃q ( p + q = 7)
Correct : A. yes
53. Which of the following is a sound rule of inference?
Correct : B. p → (p ∨ q)
54. ∀x ∃ y P(x,y) ≡ ∃ y ∀ x P(x,y)
Correct : B. no
55. Is ∀z S(x,y) a well-formed formula?
Correct : A. yes
56. The statement comprising the limitations of FOL is/are ____________
Correct : D. all of the mentioned
57. iv. Compound Logic"
Correct : C. ii. and iii.
58. what is the issue of Forward State Space Planning?
Correct : B. large branching factor.
59. Goal Stack Planning breaks up a ______________________________
Correct : C. set of goal predicates into individual subgoals
60. What is true about Linear Planning?
Correct : D. both a & b
61. Agent interacts with the world via _______________ and ______________
Correct : C. perception, action
62. The start node for search in plan space planning is_______________
Correct : 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.
Correct : A. forward chaining
64. The components of Expert system are?
Correct : C. a set of rules, the inference engine (ie), a working memory (wm)
65. What is true about Artificial Intelligence?
Correct : D. all of the above
66. Which of the following are Informed search algorithms?
Correct : D. both a & b
67. If there is a solution, breadth first search is _______________to find it
Correct : B. guaranteed
68. Which search strategy is combining the benefits of both BFS and DFS?
Correct : C. iterative deepening depth first search
69. Admissibility of the heuristic function is given as:
Correct : D. h(n)<= h*(n)
70. The efficiency of A* algorithm depends on __________________________
Correct : B. the quality of heuristic
71. What is the termination criteria in Hill climbing?
Correct : A. when no successor of the node has better heuristic value.
72. What is true about variable neighborhood function?
Correct : D. all of the above
73. _______________________requires Linear Space but uses backtracking
Correct : B. recursive best first search (rbfs)
74. Which property asks that the algorithm is locally admissible?
Correct : B. monotonicity
75. A* Search Algorithm _______________
Correct : 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?
Correct : D. landscape
77. Tabu search is designed __________________________
Correct : B. to escape the trap of local optimality.
78. Production/Rule looks like________________
Correct : C. pattern-->action
79. How can we convert AO graph with mixed nodes into graph with pure AND and OR nodes?
Correct : C. by addition of extra node
80. Arc consistency in AO graph is concernd with ____________________________________
Correct : B. finding consistent values for pairs of variables.
81. A planning problem P in BSSP is defined as a _____________
Correct : A. triple (s, g, o)
82. Plan representation in Plan Space Planning is done with__ -----------links
Correct : B. ordering links and casual link
83. What is true aboout Iterative Deepening DFS?
Correct : 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?
Correct : C. relevant actions
85. Backward State Space Planning (BSSP)_______________________________
Correct : B. start searching backwards from the goal
86. In Backward State Space Planning ,regress(A,G) that returns ______________________________
Correct : A. the regressed goal over action a when applied to goal g.
87. What is true about Backward State Space Planning?
Correct : D. all of the above
88. effects⁺ (a) in Forward State Space Planning denotes ___________________
Correct : C. denotes the set of positive effects of action a
89. In Forward State Space Planning , Progress ( A, S) function returns ___________________
Correct : A. the successor state s when action a is applied to state s.
90. What are the drawbacks of Forward State Space Planning?
Correct : D. both a & b
91. What arcs represents in AO Graph?
Correct : A. subproblem to be solved individually
92. Which are the first AI applications of AO graph?
Correct : D. both a and c
93. What is Hyper-Edge in AO Graph?
Correct : C. both 1 and 2
94. What cost is assumed for arc while solving AO* progress example?
Correct : B. 1
95. What is the heuristic cost of SOLVED nodes in AO* example?
Correct : A. 0
96. What is used to lable primitive problems in AO problem?