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

Accepted Answer

Partitioned networks are an extension of the semantic network model, designed to enhance its efficiency and manageability by dividing the network into smaller, more manageable segments. This approach helps in handling complex relationships and attributes more effectively compared to the traditional, flat semantic network structure.

Question 2

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

Accepted Answer

For any positive integer $p$, you can find a positive integer $q$ such that their sum equals 7. For example, if $p = 1$, then $q = 6$, satisfying the equation $p + q = 7$.

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

Accepted Answer

B) p → (p → q) is a sound rule of inference, known as Hypothetical Syllogism, which states that if p implies q, and p is true, then q must also be true.

Question 4

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

Accepted Answer

The statement on the left asserts that for every x there exists a y such that P(x,y) holds, while the statement on the right asserts that there exists a y for every x such that P(x,y) holds. These statements are not logically equivalent; the first is a statement about every possible x individually, while the second claims the existence of a single y that works for every x, which is a stronger condition.

Question 5

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

Accepted Answer

The answer of 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

Accepted Answer

First-order logic (FOL) has limitations in expressiveness, formalizing natural languages, and is contrasted with many-sorted logic, which introduces distinctions between different types of objects. These limitations encompass the scope of what FOL can represent and how effectively it can model complex or nuanced concepts found in natural languages or require categorization of objects into different sorts or types.

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

Accepted Answer

The issue with Forward State Space Planning is a large branching factor, which means that at each step, the number of possible actions and resulting states can grow exponentially, making the search space very large and difficult to navigate efficiently.

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

Accepted Answer

Goal Stack Planning breaks up a set of goal predicates into individual subgoals, allowing for a more manageable approach to achieving complex goals by addressing each subgoal one at a time.

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

Accepted Answer

Linear Planning involves solving subgoals in a linear order, one after another, which is described by both A and B.

Question 10

Agent interacts with the world via _______________ and ______________
A)decision , effect
B)perception, decision
C)perception, action
D)perception, effect

Accepted Answer

Agent interacts with the world via perception (to understand its environment) and action (to affect the environment).

Question 11

The start node for search in plan space planning is_______________
A)bfs
B)dfs
C)both dfs and bfs
D)a*

Accepted Answer

In plan space planning, the start node for search is not limited to a specific search algorithm like bfs (Breadth-first search), dfs (Depth-first search), or a* (A* search algorithm). Instead, the approach can utilize both dfs and bfs depending on the specific requirements and strategies of the planning system. Plan space planning involves navigating through a space of possible plans, and both dfs and bfs can be applied to explore this space.

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

Accepted Answer

Forward chaining starts with the available data and uses inference rules to extract more data until a goal is reached, using the left-hand side of rules to match against known facts and the right-hand side to deduce new facts.

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

Accepted Answer

Expert systems consist of a set of rules, an inference engine to apply those rules, and a working memory to store data. The inference engine can use both forward and backward chaining as techniques, but these are methods rather than components.

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

Accepted Answer

Artificial Intelligence encompasses the ability to solve problems, act rationally, and mimic human behavior, making all of the options correct.

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

Accepted Answer

Best first search and A* search are examples of informed search algorithms, as they use knowledge beyond the problem definition itself to find solutions more efficiently. Iterative deepening search, on the other hand, is an uninformed search strategy.

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

Accepted Answer

Breadth-first search (BFS) is a complete algorithm, meaning if there is a solution, BFS is guaranteed to find it. This is because BFS explores all nodes at the present depth level before moving on to the nodes at the next depth level.

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

Accepted Answer

Iterative Deepening Depth First Search (IDDFS) combines the space-efficiency of Depth-First Search (DFS) with the optimality and completeness of Breadth-First Search (BFS) by repeatedly exploring the tree depth-first, but increasing the depth limit incrementally until the goal is found.

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)

Accepted Answer

Admissibility of a heuristic function, denoted as h(n), requires that it never overestimates the cost to reach the goal from node n. This means h(n) must always be less than or equal to the true cost, h*(n), to reach the goal from 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

Accepted Answer

The efficiency of the A* algorithm heavily relies on the quality of the heuristic function used. A good heuristic can significantly reduce the number of nodes that need to be explored, making the algorithm faster and more efficient.

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.

Accepted Answer

Hill climbing terminates when it reaches a state where no successor has a better heuristic value than the current state, indicating a local maximum or plateau has been reached.

Quiz 3: Artificial Intelligence and Search Algorithms

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

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

Which of the following is a sound rule of inference?

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

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

The statement comprising the limitations of FOL is/are ____________

what is the issue of Forward State Space Planning?

Goal Stack Planning breaks up a ______________________________

What is true about Linear Planning?

Agent interacts with the world via _ and

The start node for search in plan space planning is_______________

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.

The components of Expert system are?

What is true about Artificial Intelligence?

Which of the following are Informed search algorithms?

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

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

Admissibility of the heuristic function is given as:

The efficiency of A* algorithm depends on __________________________

What is the termination criteria in Hill climbing?