Deck 3: Artificial Intelligence and Search Algorithms

Question 1

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

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

Answer 1

partitioned networks

Question 2

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

Answer 2

True

Question 3

Which of the following is a sound rule of inference?

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

Answer 3

p ? (p ? q)

Question 4

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

Question 5

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

Question 6

The statement comprising the limitations of FOL is/are ____________

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

Question 7

what is the issue of Forward State Space Planning?

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

Question 8

Goal Stack Planning breaks up a ______________________________

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

Question 9

What is true about Linear Planning?

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

Question 10

Agent interacts with the world via _______________ and ______________

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

Question 11

The start node for search in plan space planning is_______________

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

Question 12

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.

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

Question 13

The components of Expert system are?

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

Question 14

What is true about Artificial Intelligence?

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

Question 15

Which of the following are Informed search algorithms?

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

Question 16

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

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

Question 17

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

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

Question 18

Admissibility of the heuristic function is given as:

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

Question 19

The efficiency of A* algorithm depends on __________________________

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

Question 20

What is the termination criteria in Hill climbing?

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 21

What is true about variable neighborhood function?

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 22

_______________________requires Linear Space but uses backtracking

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

Question 23

Which property asks that the algorithm is locally admissible?

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

Question 24

A* Search Algorithm _______________

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