Computer/Artificial Intelligence and Robotics (AIR) Set 2 Sample Test,Sample questions

Question:
 What is true aboout Iterative Deepening DFS?
B. 

C. 

D. 

1. it does not perform dfs in a bfs fashion.

2.it is the preferred informed search method

3.it’s a depth first search, but it does it one level at a time, gradually increasing the limit, until a goal is found.

4.is a depth-first search with a fixed depth limit l


Question:
 A planning problem P in BSSP is defined as a _____________

1.triple (s, g, o)

2.triple (s1, s2, o

3.triple (g1, g, o)

4.none of the above


Question:
 Arc consistency in AO graph is concernd with _____________

1.nodes

2. finding consistent values for pairs of variables

3.unary constraint

4.All of the above


Question:
 effects⁺ (a) in Forward State Space Planning denotes ___________________

1.denotes the set of negative effects of action a

2.denotes the set of neutral effects of action a

3.denotes the set of positive effects of action a

4.None of These


Question:
 How can we convert AO graph with mixed nodes into graph with pure AND and OR nodes?

1.by traversing multiple node

2.by deleting one of the node

3.by addition of extra node

4.None of the above


Question:
 In Forward State Space Planning , Progress ( A, S) function returns

1. the successor state s when action a is applied to state s.

2.the predecessor state s when action a is applied to state s.

3.both a & b

4.None of the above


Question:
 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.

1.forward chaining

2.backward chaining

3. reverse chaining

4.both b & c


Question:
 The components of Expert system are?

1.a set of rules, the inference engine (ie), forward chaining

2.a set of rules, backward chaining, a working memory (wm)

3.a set of rules, the inference engine (ie), a working memory (wm)

4. a set of rules, forward chaining, backward chaining


Question:
 What cost is assumed for arc while solving AO* progress example?

1.0

2.1

3.2

4.3


Question:
 What is true aboout Iterative Deepening DFS?

1.it does not perform dfs in a bfs fashion.

2. it is the preferred informed search method

3.it’s a depth first search, but it does it one level at a time, gradually increasing the limit, until a goal is found.

4. is a depth-first search with a fixed depth limit l


Question:
 Which are the first AI applications of AO graph?

1.saint

2.xcon

3.dendral

4.both a and c


Question:
 Which of the following are Informed search algorithms?

1.best first search

2.a* search

3.iterative deeping search

4.both a & b


Question:
 Which search strategy is combining the benefits of both BFS and DFS?

1.depth limited search

2.a*

3.iterative deepening depth first search

4.best first search


Question:
A planning problem P in BSSP is defined as a _____

1. triple (s, g, o)

2. triple (s1, s2, o)

3. triple (g1, g, o)

4.None of the above


Question:
A* Search Algorithm _______________

1.does not expand the node which have the lowest value of f(n),

2.finds the shortest path through the search space using the heuristic function i.e f(n)=g(n) + h(n)

3.terminates when the goal node is not found.

4.All of the above


Question:
Admissibility of the heuristic function is given as:

1.h(n)>= h*(n)

2. h(n)< h*(n)

3.h(n)== h*(n)

4.h(n)<= h*(n)


Question:
Agent interacts with the world via _______________ and ______________

1.decision , effect

2.perception, decision

3.perception, action

4.perception, effect


Question:
Backward State Space Planning (BSSP)_______________________________

1.simply explores the set of all future states in possible order

2. start searching backwards from the goal

3.leads to huge search space

4.has no sense of direction


Question:
Goal Stack Planning breaks up a _______

1. initial state

2.stack in different part

3.set of goal predicates into individual subgoals

4. all of the above


Question:
If there is a solution, breadth first search is _______________to find it

1. difficult

2.guaranteed

3.not able to find

4.none of the above


Question:
In Backward State Space Planning ,regress(A,G) that returns ______________________________

1. the regressed goal over action a when applied to goal g.

2.the goal state over action a when applied to goal g.

3.the initial state over action a when applied to goal g.

4. both a & b


Question:
Plan representation in Plan Space Planning is done with__ -----------links

1.binding links

2.ordering links and casual link

3.contigent link

4.head step


Question:
Production/Rule looks like________________

1. pattern-->data

2.action-->data

3.pattern-->action

4.none of the above


Question:
Tabu search is designed __________________________

1.as it does not follow aspiration criteria

2. to escape the trap of local optimality.

3.to unrecord forbidden moves, which are referred to as tabu moves .

4.None of these


Question:
The components of Expert system are?

1.a set of rules, the inference engine (ie), forward chaining

2.a set of rules, backward chaining, a working memory (wm)

3.a set of rules, the inference engine (ie), a working memory (wm)

4.a set of rules, forward chaining, backward chaining


Question:
The efficiency of A* algorithm depends on __________________________

1.depth

2.the quality of heuristic

3.unknown nodes

4.none of the above


Question:
The start node for search in plan space planning is______

1.bfs

2.dfs

3.both dfs and bfs

4.a*


Question:
What arcs represents in AO Graph?

1.subproblem to be solved individually

2.solution

3.path

4. sequence of actions


Question:
What are the drawbacks of Forward State Space Planning?

1. A. fssp has very huge search space

2. it includes the actions that have nothing go do with achieving the goal

3.regression is used in forward state space planning

4.both a and b


Question:
What is Hyper-Edge in AO Graph?

1.many edges together can be hyber edge

2. those are and edges only

3.both 1 and 2

4.none of the above


Question:
What is the heuristic cost of SOLVED nodes in AO* example?

1.0

2.1

3.2

4.3


Question:
what is the issue of Forward State Space Planning?

1. low banching factor.

2.large branching factor

3.work in forward fashion

4.work in backward fashion


Question:
What is the main advantage of backward state-space search?

1. cost

2.actions

3. relevant actions

4.all of the mentioned


Question:
What is the termination criteria in Hill climbing?

1.when no successor of the node has better heuristic value.

2.when successor of the node has better heuristic value.

3.when no ancestor of the node has better heuristic value.

4. when ancestor of the node has better heuristic value.


Question:
What is true aboout Iterative Deepening DFS?

1. it does not perform dfs in a bfs fashion.

2. it is the preferred informed search method

3. it’s a depth first search, but it does it one level at a time, gradually increasing the limit, until a goal is found.

4.is a depth-first search with a fixed depth limit l


Question:
What is true about Artificial Intelligence?

1.the ability to solve problems”.

2.the ability to act rationally.

3. the ability to act like humans

4.all of the above


Question:
What is true about Backward State Space Planning?

1. goal states are often incompletely specified.

2.expresses only what is desired in the final state, rather than a complete description of the final state.

3.it uses regression

4.all of the above


Question:
What is true about Linear Planning?

1. it refers to the fact that the subgoals are attempted and solved in a linear order.

2.attempts to solve subgoals individually one after another.

3. attempts to solve subgoal individually in non linear fashion

4. both a & b


Question:
What is true about variable neighborhood function?

1. neighbourhood functions that are sparse lead to quicker movement during search

2.algorithm has to inspect very fewer neighbours

3.vdn stars searching with sparse neighbourhood functions, when it reaches an optimum, it switches to denser function.

4.None of the above


Question:
What is used to lable primitive problems in AO problem?

1.unvisited

2.unsolved

3.solved

4.visited


Question:
Which is not problem in Hill climing?

1.plateau

2.ridges

3.local maximum

4.landscape


Question:
Which property asks that the algorithm is locally admissible?

1.admissibility

2.monotonicity

3.informedness

4.All of the above


Question:
_____requires Linear Space but uses backtracking

1. breadth first search

2.recursive best first search (rbfs)

3. a*

4.ida*


More MCQS

  1. Computer fundamentals
  2. Computer Basic MCQS
  3. CCC MCQ Sample Paper 1
  4. CCC Exams MCQS Sample Paper Test 2
  5. Computer Basics MCQS Paper 1
  6. Computer Basics MCQS Paper 2
  7. FUNDAMENTALS OF COMPUTERS MCQs PART 2
  8. FUNDAMENTALS OF COMPUTERS MCQs PART 1
  9. FUNDAMENTALS OF COMPUTERS MCQs PART 3
  10. Computer mcqs smaple paper 1
  11. Computer mcqs smaple paper 2
  12. Computer mcqs smaple paper 3
  13. Fundamentals of Computers
  14. Fundamentals of Computers (New) Part 1
  15. Fundamentals of Computers (New) Part 2
  16. Computer Networks MCQ Questions
  17. Computer Networks Transition from IPV4 to IPV6
  18. Computer Fundamentals (New) Part 1
  19. Computer Fundamentals (New) Part 2
  20. Computer Fundamentals (New) Part 3
  21. Computer Fundamentals (New) Part 4
  22. Computer Fundamentals (New) Part 5
  23. Computer Fundamentals (New) Part 6
  24. Computer Fundamentals (New) Part 7
  25. Computer Fundamentals (New) Part 8
  26. Operating Systems MCQs Part 1
  27. Operating Systems MCQs Part 2
  28. OS(Computer Operating Systems) Part 1
  29. OS(Computer Operating Systems) Part 2
  30. OS(Computer Operating Systems) Part 3
  31. OS(Computer Operating Systems) Part 4
  32. OS - Computer Operating Systems Part 5
  33. OS - Computer Operating Systems Part 6
  34. OS - Computer Operating Systems Part 7
  35. MS Word MCQ Questions Part 1
  36. MS Word MCQ Questions Part 2
  37. MS Word MCQ Questions Part 3
  38. MS Word MCQ Questions Part 4
  39. MS Word MCQ Questions Part 5
  40. MS Word MCQ Questions Part 7
  41. MS Word MCQ Questions Part 6
  42. Microsoft Excel MCQ Questions Part 1
  43. Microsoft Excel MCQ Questions Part 2
  44. Microsoft Excel MCQ Questions Part 3
  45. Microsoft Excel MCQ Questions Part 4
  46. Microsoft Excel MCQ Questions Part 5
  47. Microsoft Excel MCQ Questions Part 6
  48. Microsoft Excel MCQ Questions Part 7
  49. MS PowerPoint MCQ Questions PART 1
  50. MS PowerPoint MCQ Questions PART 2
  51. MS PowerPoint MCQ Questions PART 3
  52. MS PowerPoint MCQ Questions PART 4
  53. MS PowerPoint MCQ Questions PART 5
  54. MS PowerPoint MCQ Questions PART 6
  55. MS PowerPoint MCQ Questions PART 7
  56. MS Access MCQ Questions Part 1
  57. MS Access MCQ Questions Part 2
  58. MS Access MCQ Questions Part 3
  59. MS Access MCQ Questions Part 4
  60. MS Access MCQ Questions Part 5
  61. MS Access MCQ Questions Part 6
  62. MS Access MCQ Questions Part 7
  63. MS Access MCQ Questions Part 8
  64. Query of MS Access MCQS Part 1
  65. Query of MS Access MCQS Part 2
  66. Computer Communication and Networking Quiz
  67. Computer Graphics MCQ Quiz Questions and Answers
  68. Computer Basics Quiz Questions
  69. Computer Quiz Questions with Answers
  70. Computer Hardware MCQS Quiz
  71. MCQ Computer Organization & Architecture
  72. MCQ Computer Organisation - Input & output Organisation SET1
  73. MCQ Computer Organisation - Input & output Organisation SET2
  74. MCQ Computer Organisation - Input & output Organisation SET3
  75. MCQS on addressing modes SET 1
  76. MCQS on addressing modes SET 2
  77. Software Engineering MCQs SET 1
  78. Software Engineering MCQs SET 2
  79. Software Engineering MCQs Set 3
  80. Software Engineering MCQs Set 4
  81. Software Engineering MCQs Set 5
  82. Software Engineering MCQs Set 6
  83. Software Engineering MCQs Set 7
  84. mcqs data structures
  85. CCC Exam Sample MCQ Paper
  86. Computer MCQ Questions set-1
  87. Computer MCQ Questions set-2
  88. Computer MCQ Questions set-3
  89. Current affairs mcq Database management
  90. Programming arcitecture
  91. Computer Graphics MCQ Questions part 1
  92. Computer Graphics MCQ Questions part 2
  93. Computer Awareness MCQs and Quiz for Banking, IBPS, RRB, RBI, SBI Exams pART 1
  94. Computer Awareness MCQs and Quiz for Banking, IBPS, RRB, RBI, SBI Exams pART 2
  95. Computer Science MCQs
  96. Computer Mcq Question
  97. MCQs based on Fundamentals of Computer 1 set
  98. Computer Mcq Question set 2
  99. MCQ Encoding Schemes
  100. Data Entry and Keyboarding Skills MCQ
  101. Computer Science Number System
  102. Computer Network MCQ
  103. MCQ Questions on Tally
  104. MCQ Questions on Tally Set 2
  105. MCQ Questions on Tally Set 3
  106. MCQ Questions on Tally Set 4
  107. Internet Technology MCQ Questions for Competitive Exams
  108. Computer Software MCQ GK Questions
  109. Computer Organization and Architecture MCQs
  110. Basic Computer GK Questions
  111. Computer Graphics MCQ Set 1
  112. Operating System MCQ Set 1
  113. Operating System MCQ Set 2
  114. Operating System MCQ Set 3
  115. Operating System MCQ Set 4
  116. Operating System MCQ Set 5
  117. Operating System MCQ Set 6
  118. Operating System MCQ Set 7
  119. Operating System MCQ Set 8
  120. Operating System MCQ Set 9
  121. Operating System MCQ Set 10
  122. Operating System MCQ Set 11
  123. Operating System MCQ Set 12
  124. Operating System MCQ Set 13
  125. Operating System MCQ Set 14
  126. Operating System MCQ Set 15
  127. Operating System MCQ Set 16
  128. Operating System MCQ Set 17
  129. Operating System MCQ Set 18
  130. Operating System MCQ Set 19
  131. Operating System MCQ Set 20
  132. Operating System MCQ Set 21
  133. Computer Graphics MCQ Question Set 1
  134. Computer Networks MCQs
  135. Computer Networks MCQs Set-2
  136. Computer Networks MCQs Set-3
  137. Computer Networks MCQs Set-4
  138. Bachelor of Computer Applications MCQs set-1
  139. Bachelor of Computer Applications MCQs set-2
  140. NET Programming MCQ
  141. Artificial Intelligence and Robotics (AIR) Set 1
  142. Artificial Intelligence and Robotics (AIR) Set 2
  143. Computer Engineering Soft Computing Set 1
  144. Computer Engineering Soft Computing Set 2
Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!