Question 1

What is the heuristic function of greedy best-first search?

Accepted Answer

A) f(n) != h(n) 
B) f(n)  h(n) 
A) f(n) != h(n) 
B) f(n)  h(n) C

Question 2

How the decision tree reaches its decision?

Accepted Answer

A) single test 
B) two test 
C) sequence of test 
D) no test 
A) single test 
B) two test 
C) sequence of test 
D) no test C

Question 3

What is called inconsistent support?

Accepted Answer

A) if two literals are not negation of other 
B) if two literals are negation of other 
C) mutually exclusive 
D) none of the mentioned 
A) if two literals are not negation of other 
B) if two literals are negation of other 
C) mutually exclusive 
D) none of the mentioned B

Question 4

How many types of informed search method are in artificial intelligence?

Accepted Answer

A) 1 
B) 2 
C) 3 
D) 4 
A) 1 
B) 2 
C) 3 
D) 4

Question 5

What is meant by persistence actions?

Accepted Answer

A) allow a literal to remain false 
B) allow a literal to remain true 
C) both a & b 
D) none of the mentioned 
A) allow a literal to remain false 
B) allow a literal to remain true 
C) both a & b 
D) none of the mentioned

Question 6

Which is used to improve the performance of heuristic search?

Accepted Answer

A) quality of nodes 
B) quality of heuristic function 
C) simple form of nodes 
D) none of the mentioned 
A) quality of nodes 
B) quality of heuristic function 
C) simple form of nodes 
D) none of the mentioned

Question 7

Which search is complete and optimal when h(n) is consistent?

Accepted Answer

A) best-first search 
B) depth-first search 
C) both a & b 
D) a* search 
A) best-first search 
B) depth-first search 
C) both a & b 
D) a* search

Question 8

Which method is used to search better by learning?

Accepted Answer

A) best-first search 
B) depth-first search 
C) metalevel state space 
D) none of the mentioned 
A) best-first search 
B) depth-first search 
C) metalevel state space 
D) none of the mentioned

Question 9

End Nodes are represented by,

Accepted Answer

A) disks 
B) squares 
C) circles 
D) triangles 
A) disks 
B) squares 
C) circles 
D) triangles

Question 10

Chance Nodes are represented by,

Accepted Answer

A) disks 
B) squares 
C) circles 
D) triangles 
A) disks 
B) squares 
C) circles 
D) triangles

Question 11

When will further expansion is unnecessary for planning graph?

Accepted Answer

A) identical 
B) replicate 
C) not identical 
D) none of the mentioned 
A) identical 
B) replicate 
C) not identical 
D) none of the mentioned

Question 12

What are present in the planning graph?

Accepted Answer

A) sequence of levels 
B) literals 
C) variables 
D) heuristic estimates 
A) sequence of levels 
B) literals 
C) variables 
D) heuristic estimates

Question 13

A _________ is a decision support tool that uses a tree-like graph or model of decisions and their possible consequences, including chance event outcomes, resource costs, and utility.

Accepted Answer

A) decision tree 
B) graphs 
C) trees 
D) neural networks 
A) decision tree 
B) graphs 
C) trees 
D) neural networks

Question 14

Decision Nodes are represented by,

Accepted Answer

A) disks 
B) squares 
C) circles 
D) triangles 
A) disks 
B) squares 
C) circles 
D) triangles

Question 15

Which function will select the lowest expansion node atfirst for evaluation?

Accepted Answer

A) greedy best-first search 
B) best-first search 
C) both a & b 
D) none of the mentioned 
A) greedy best-first search 
B) best-first search 
C) both a & b 
D) none of the mentioned

Question 16

What is the starting level of planning graph?

Accepted Answer

A) level 3 
B) level 2 
C) level 1 
D) level 0 
A) level 3 
B) level 2 
C) level 1 
D) level 0

Question 17

How many types of learning are available in machine learning?

Accepted Answer

A) 1 
B) 2 
C) 3 
D) 4 
A) 1 
B) 2 
C) 3 
D) 4

Question 18

Choose from the following that are Decision Tree nodes

Accepted Answer

A) decision nodes 
B) weighted nodes 
C) chance nodes 
D) end nodes 
A) decision nodes 
B) weighted nodes 
C) chance nodes 
D) end nodes

Question 19

Which is used to extract solution directly from the planning graph?

Accepted Answer

A) planning algorithm 
B) graph plan 
C) hill-climbing search 
D) all of the mentioned 
A) planning algorithm 
B) graph plan 
C) hill-climbing search 
D) all of the mentioned

Question 20

Decision Tree is

Accepted Answer

A) flow-chart 
B) structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label 
C) both a) & b) 
D) none of the mentioned 
A) flow-chart 
B) structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label 
C) both a) & b) 
D) none of the mentioned

What is the heuristic function of greedy best-first search?

How the decision tree reaches its decision?

What is called inconsistent support?

How many types of informed search method are in artificial intelligence?

What is meant by persistence actions?

Which is used to improve the performance of heuristic search?

Which search is complete and optimal when h(n) is consistent?

Which method is used to search better by learning?

End Nodes are represented by,

Chance Nodes are represented by,

When will further expansion is unnecessary for planning graph?

What are present in the planning graph?

A _________ is a decision support tool that uses a tree-like graph or model of decisions and their possible consequences, including chance event outcomes, resource costs, and utility.

Decision Nodes are represented by,

Which function will select the lowest expansion node atfirst for evaluation?

What is the starting level of planning graph?

How many types of learning are available in machine learning?

Choose from the following that are Decision Tree nodes

Which is used to extract solution directly from the planning graph?

Decision Tree is

Fuzzy Logic, Set Theory, and Bayesian Networks

AI and Knowledge Base Programming

Filters

Exam 3: Decision Trees, Machine Learning, and Heuristic Search in Artificial Intelligence

What is the heuristic function of greedy best-first search?

How the decision tree reaches its decision?

What is called inconsistent support?

How many types of informed search method are in artificial intelligence?

What is meant by persistence actions?

Which is used to improve the performance of heuristic search?

Which search is complete and optimal when h(n) is consistent?

Which method is used to search better by learning?

End Nodes are represented by,

Chance Nodes are represented by,

When will further expansion is unnecessary for planning graph?

What are present in the planning graph?

A _________ is a decision support tool that uses a tree-like graph or model of decisions and their possible consequences, including chance event outcomes, resource costs, and utility.

Decision Nodes are represented by,

Which function will select the lowest expansion node atfirst for evaluation?

What is the starting level of planning graph?

How many types of learning are available in machine learning?

Choose from the following that are Decision Tree nodes

Which is used to extract solution directly from the planning graph?

Decision Tree is

Fuzzy Logic, Set Theory, and Bayesian Networks

AI and Knowledge Base Programming

Filters