Question 1

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.

Accepted Answer

A) forward chaining 
B) backward chaining 
C) reverse chaining 
D) both b & c 
A) forward chaining 
B) backward chaining 
C) reverse chaining 
D) both b & c A

Question 2

Admissibility of the heuristic function is given as:

Accepted Answer

A) h(n)>= h*(n) B) h(n)< h*(n) C) h(n)== h*(n) D) h(n)<= h*(n) A) h(n)>= h*(n) B) h(n)< h*(n) C) h(n)== h*(n) D) h(n)<= h*(n) D

Question 3

What is true about Artificial Intelligence?

Accepted Answer

A) the ability to solve problems?. 
B) the ability to act rationally. 
C) the ability to act like humans 
D) all of the above 
A) the ability to solve problems?. 
B) the ability to act rationally. 
C) the ability to act like humans 
D) all of the above D

Question 4

Is the below statement true for the domain of positive integers ?p ?q ( p + q = 7)

Accepted Answer

A) True 
 B)False

Question 5

what is the issue of Forward State Space Planning?

Accepted Answer

A) low banching factor. 
B) large branching factor. 
C) work in forward fashion 
D) work in backward fashion 
A) low banching factor. 
B) large branching factor. 
C) work in forward fashion 
D) work in backward fashion

Question 6

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

Accepted Answer

A) depth limited search 
B) a* 
C) iterative deepening depth first search 
D) best first search 
A) depth limited search 
B) a* 
C) iterative deepening depth first search 
D) best first search

Question 7

The efficiency of A* algorithm depends on __________________________

Accepted Answer

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

Question 8

_______________________requires Linear Space but uses backtracking

Accepted Answer

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

Question 9

Agent interacts with the world via _______________ and ______________

Accepted Answer

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

Question 10

A* Search Algorithm _______________

Accepted Answer

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) 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

Question 11

Which of the following is a sound rule of inference?

Accepted Answer

A) q ? (p ? q) ? p 
B) p ? (p ? q) 
C) q ? (p ? q) ? p 
D) all of above 
A) q ? (p ? q) ? p 
B) p ? (p ? q) 
C) q ? (p ? q) ? p 
D) all of above

Question 12

The statement comprising the limitations of FOL is/are ____________

Accepted Answer

A) expressiveness 
B) formalizing natural languages 
C) many-sorted logic 
D) all of the mentioned 
A) expressiveness 
B) formalizing natural languages 
C) many-sorted logic 
D) all of the mentioned

Question 13

Goal Stack Planning breaks up a ______________________________

Accepted Answer

A) initial state 
B) stack in different part 
C) set of goal predicates into individual subgoals 
D) all of the above 
A) initial state 
B) stack in different part 
C) set of goal predicates into individual subgoals 
D) all of the above

Question 14

?x ? y P(x,y) ? ? y ? x P(x,y)

Accepted Answer

A) True 
 B)False

Question 15

Is ?z S(x,y) a well-formed formula?

Accepted Answer

A) True 
 B)False

Question 16

Which of the following are Informed search algorithms?

Accepted Answer

A) best first search 
B) a* search 
C) iterative deeping search 
D) both a & b 
A) best first search 
B) a* search 
C) iterative deeping search 
D) both a & b

Question 17

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

Accepted Answer

A) difficult 
B) guaranteed 
C) not able to find 
D) none of the above 
A) difficult 
B) guaranteed 
C) not able to find 
D) none of the above

Question 18

What is the termination criteria in Hill climbing?

Accepted Answer

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

Question 19

Which property asks that the algorithm is locally admissible?

Accepted Answer

A) admissibility 
B) monotonicity 
C) informedness 
D) none of the above 
A) admissibility 
B) monotonicity 
C) informedness 
D) none of the above

Question 20

What is true about Linear Planning?

Accepted Answer

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) 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

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.

Admissibility of the heuristic function is given as:

What is true about Artificial Intelligence?

Is the below statement true for the domain of positive integers ?p ?q ( p + q = 7)

what is the issue of Forward State Space Planning?

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

The efficiency of A* algorithm depends on __________________________

_______________________requires Linear Space but uses backtracking

Agent interacts with the world via _ and

A* Search Algorithm _______________

Which of the following is a sound rule of inference?

The statement comprising the limitations of FOL is/are ____________

Goal Stack Planning breaks up a ______________________________

?x ? y P(x,y) ? ? y ? x P(x,y)

Is ?z S(x,y) a well-formed formula?

Which of the following are Informed search algorithms?

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

What is the termination criteria in Hill climbing?

Which property asks that the algorithm is locally admissible?

What is true about Linear Planning?

Problem Solving, Planning, and Expert Systems

Knowledge Representation and Inference Mechanisms in Artificial Intelligence

State Space Planning and Ao Graph in AI

Filters

Exam 3: Artificial Intelligence and Search Algorithms

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.

Admissibility of the heuristic function is given as:

What is true about Artificial Intelligence?

Is the below statement true for the domain of positive integers ?p ?q ( p + q = 7)

what is the issue of Forward State Space Planning?

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

The efficiency of A* algorithm depends on __________________________

_______________________requires Linear Space but uses backtracking

Agent interacts with the world via _______________ and ______________

A* Search Algorithm _______________

Which of the following is a sound rule of inference?

The statement comprising the limitations of FOL is/are ____________

Goal Stack Planning breaks up a ______________________________

?x ? y P(x,y) ? ? y ? x P(x,y)

Is ?z S(x,y) a well-formed formula?

Which of the following are Informed search algorithms?

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

What is the termination criteria in Hill climbing?

Which property asks that the algorithm is locally admissible?

What is true about Linear Planning?

Problem Solving, Planning, and Expert Systems

Knowledge Representation and Inference Mechanisms in Artificial Intelligence

State Space Planning and Ao Graph in AI

Filters

Agent interacts with the world via _ and