Scribd
Upload
137 views8 pages

AI - Question Bank-Module 3, 4 & 5

The document is a question bank for a course on knowledge-based agents, artificial intelligence, and logic. It covers various topics including algorithms like A*, Greedy Best First search, and concepts such as the Wumpus world, First Order Logic, and probability theory. Each module contains multiple questions that require explanations, applications, and examples related to the respective topics.

Uploaded by

Hjhgh Hjhhjj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
137 views8 pages

AI - Question Bank-Module 3, 4 & 5

The document is a question bank for a course on knowledge-based agents, artificial intelligence, and logic. It covers various topics including algorithms like A*, Greedy Best First search, and concepts such as the Wumpus world, First Order Logic, and probability theory. Each module contains multiple questions that require explanations, applications, and examples related to the respective topics.

Uploaded by

Hjhgh Hjhhjj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Question Bank

Module 3
1. Outline the generic knowledge-based agent’s program and discuss the
difference between the declarative & procedural approaches in the
contest of knowledge-based agents.

2. Apply a A* algorithm to find the solution path from the start node(S) to
the goal node(G). The heuristic values(h) are provided with the nodes and
the travel cost ( C ) are provided with the edges as shown in the figure
below.

3. Discuss the Wumpus world environment and the PEAS specification for
the knowledge-based agent. Explain how does the agent navigate and
make decisions based on precepts in this environment.

4. Solve the following 8 – puzzle using the heuristic approach and the tree
diagram considering the initial and final states as specified.

5. Apply Greedy Best First search to find the solution path from S to G. Write
all steps as well as open and closed lists for full marks.
S(h=7), A(h=9), B(h=4), C(h=2), D(h=5), E(h=3), G(h=0)
6. Outline a generic knowledge-based agent program. Write PEAS
description of Wumpus World.

7. Explain Modus ponens and theory of resolution with examples.

8. Apply the A* search to find the solution path from a to z. Heuristics are
with the nodes and the cost is with the edges. Write all steps as well as
open and closed lists for full marks.

9. Explain contraposition, double implication elimination, demorgan’s rule


with examples. Prove logically that there is no pit in [1,2].
10.Differentiate backward and forward chaining with example.

11. Explain A* search to minimize the total estimated cost.

12.Write an algorithm for hill climbing search and explain in detail.

13.In the below graph, find the path from A to G, using Greedy Best First
Search A* Search algorithms. The values in the table represents the
heuristic values of reaching the goal node G pass current node.
14.Explain the syntax and semantics of positional logic.

15. In the fig below find the path from A to G, using Greedy Best First search
algorithm. The values given is the heuristic values to reach goal node from
the current node.

--------------------------

Module 4

1) Explain the syntax and semantics of the First Order Logic.

2) Explain the following wrt to the first Order Logic

i) Assertions & Queries in FOL


ii) The Kinship Domain
iii) Numbers & Stets
3) Explain Unification in Detail.

4) Explain Forward Chaining algorithm with an example.

5) Explain various ambiguities in Natural Language Processing with examples


& summarize in the form of table about formal languages and their
ontological and their epistemological commitments.

6) Define Universal and Exponential Instantiation & give example for both.
Prove the following using Backward & Forward Chaining. “As per the law,
it is crime for an American to sell weapons to hostile nations. Country E,
an enemy of America, has some missiles, and all the missiles were sold to
it by solan, who is an American citizen”.

Prove that Solan is criminal.

7) Explain i) Unification & ii) Subsumption Lattice with examples. Write short
note on how first Order logic is applied to Wumpus world.

8) Write appropriate quantifier for the following:


i) Some students read well
ii) Some students like some books
iii) Some students like all books
iv) All students like some books
v) All students like no books
Explain the concept of resolution with appropriate procedure.
9) Explain the syntax & semantics of First Order Logic.

10) Explain forward chaining algorithm with an example.

11) Explain contraposition, double implication elimination, demorgans


rules with examples. Prove logically that there is no pit in [1,2].

12) Prove the goal using Resolution


Algorithm.
• Everyone who has passed Algorithms can enroll in Machine
Learning.
• Anyone enrolled in Machine Learning submits a final project.
• Priya has passed Algorithms.

GOAL: Priya submits a final project.

-----------------------------------

Module 5

1) In a city 30% of the population owns a dog, while 70% owns a cat.
Among dog owners, 80% takes their dogs for daily walk, and among the
cat owners only 50% do so. If a person is observed walking their pet
daily, calculate probability that this person owns a dog. State a Baye’s
theorem.

2) Explain uncertain knowledge in the context of artificial intelligence.


Discuss the challenges an agent can focus when acting under uncertainty
with the example of diagnosing a dental patient’s toothache.

3) Explain the concept of inference using full joint probability in the context
of agents acting under uncertainty with an example of the following
variables:
Weather = {sunny, rain, cloudy, snow}, Cavity = {cavity, ‫ﬢ‬cavity}
Also calculate the following:
P(cavity v toothache), P(cavity|toothache), P(‫ﬢ‬cavity|toothache)
Given the following full joint distribution for the toothache, cavity, catch
world.

4) Prove all kolomogorovs axioms (Probability axioms).


5) Given that bus arriving late = 0.3, and a student oversleeping probability
is 0.4. Find the probability that the students gets late.

6) Explain marginalization and normalization with full joint distribution of


(toothache, catch, cavity).

7) Explain the role of probability in solving Wumpus world.

8) Explain basic probability notation in detail.

9) Explain Baye’s rule and its use in detail.


10)Explain Independence in quantifying uncertainty with example.
11) Compare the advantages and limitations of using an expert-system shell
versus developing an expert system entirely from scratch. In which scenarios
is a shell the preferred approach.

---------------------------------

You might also like