Question 1

Which of the following is an extension of the semantic network?

Accepted Answer

A) expert systems 
B) rule based expert systems 
C) decision tree based networks 
D) partitioned networks

Question 2

The start node for search in plan space planning is_______________

Accepted Answer

A) bfs 
B) dfs 
C) both dfs and bfs 
D) a*

Question 3

What is true about variable neighborhood function?

Accepted Answer

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

Question 4

The components of Expert system are?

Accepted Answer

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

Exam 3: Artificial Intelligence and Search Algorithms

Which of the following is an extension of the semantic network?

The start node for search in plan space planning is_______________

What is true about variable neighborhood function?

The components of Expert system are?