JAYASAKTHIENGINEERINGCOLLEGE

(Approved by AICTE & Affiliated to Anna University, Chennai)

St. Mary’s Nagar, Thiruninravur, Chennai- 602 024

Department of Artificial Intelligence & Data Science

Question Bank
Year / Sem: II Yr/ III Sem

AL3391 – ARTIFICIAL INTELLIGENCE

Unit-I
Part – A (2 – Marks)

1. Define AI? (Nov / Dec 2023)

2. List the application of AI? (Nov / Dec 2023)
3. List the steps Involved in simple problem solving? (Nov / Dec 2023)
4. Characteristic the environment of an agent playing soccer.(Nov / Dec 2022)
5. Can an agent that senses only partial information about the state always be perfectly
rational? (Nov / Dec 2022)
6. Formulate the PEAS for an automated taxi driver? (Apr/ May 2023)
7. Determine the type of agent architecture for Medical Diagnosis system, Satellite
Image analysis System, Part Picking Robot & Interactive English Tutor (Apr /
May2023)
8. Give general model of learning agent?
9. What is a rational agent?
10. List the current trends in AI?
11. List the intelligent system influential in AI?
12. What are the features of AI?
13. Define agent?
14. Give the general model of learning agent?
15. What is the role of agent program?
16. List out of the characteristics of intelligent agent?
17. What are the four components to define a problem?
18. How will you measure the problem-solving performance?
19. What is the application of BFS
20. Define admissible heuristics
21. Define consistent heuristics
22. What is the use of online search agent in unknown environment?
23. List some of the uninformed search techniques
24. Define bi-directed search
25. Why problem formulation must follow goal formulation?
26. What is goal-based agent?
27. What is a learning agent?

Part – B (13 – Marks)

1. Discuss about the Types & future of AI

2. Discuss about properties of Intelligent Agent in detail
3. Describe the working of uninformed search strategy
4. Explain the types of environment & the architecture of agent?
5. Solve the problem: A problem where two jugs of water are given, say one is a 4-litre one, and
the other one is a 3-litre one, but none of the measuring markers is mentioned on any of it.
There is a pump available to fill the jugs with water. How can you exactly pour 2 litres of
 water into a 4-litre jug? Assuming that both the jugs are empty, the task is to find a solution to
pour 2-litre water into a 4-litre jug.(Apr/ May 2023)
6. Explain about the types of agent and components of learning agent?
7.

Goal state – I , Do BFS,DFS, DLS (Limit -2) & Iterative Deepening search with explanation.
8. Perform BFS, DFS, Uniform cost search strategies on the following graph & also formulate
the algorithm for 3 strategies.(Apr/ May 2023)

9. Explain rationality with an example?

10. Define an agent. Explain the four basic agents that embody the principles underlying
intelligent systems with example. (Nov / Dec 2022)
11. What is an agent? How does it interact with environment? Explain (Nov / Dec 2023)
12. What are informed search techniques? Explain any one (Nov / Dec 2023)
13. List the basic kinds of intelligent agents & explain any two agents with neat schematic
diagram.(Nov / Dec 2023)
14. Define agent? Specify the PEAS description for intelligent agent design with
examples.
15. Discuss recursive best first search algorithm
16. Analyse the uniformed search algorithm with respect to different criteria. Explain
heuristic for CSP?
17. What is depth limited search? Give the recursive implementation of depth limited
search?
18. Discuss the issues in the design of search problem?
19. How do you search with partial information? How to avoid repeated search?
20. How do you measure the problem solving performance?

Part – C (15 – Marks)

1. Write the PEAS description for Automated taxi driver, Part-picking robot, ATM
system , Satellite image analysis, Medical diagnosis system, Blood testing system &
interactive English tutor.
2. Solve using bidirectional search - Given a dictionary, and two
words start and target (both of the same length). Find length of the smallest chain
from start to target if it exists, such that adjacent words in the chain only differ by
one character and each word in the chain is a valid word i.e., it exists in the
dictionary. It may be assumed that the target word exists in the dictionary and the
lengths of all the dictionary words are equal.
3. Solve using search algorithm – You are given two jugs with capacities x liters
and y liters. You have an infinite water supply. Return whether the total amount of
water in both jugs may reach target using the following operations
 Fill either jug completely with water
 Completely empty either jug
 Pour water from one jug in to another until receiving jug is full, or the
transferring jug is empty.
4. Explore the knowledge base of Wumpus world problem. Explain with the steps to
reach the goal by following the rules.

5. Solve the Ball Picker Robot Problem with state space representation - 2 buckets are
full of balls. Either a ball is white colour or red colour. Objective is to pick all black
colour balls from bucket.
6. Solve the Eight puzzle problem using production rules & draw the state space
representation.

7. Solve by representing in state space : - A farmer with a wolf, a goat, and

a cabbage must cross a river by boat. The boat can carry only the farmer and a single
item. If left unattended together, the wolf would eat the goat, or the goat would eat
the cabbage. How can they cross the river without anything being eaten?
8. Solve missionaries and cannibals problem by representing the state space :- three
missionaries and three cannibals must cross a river using a boat which can carry at
most two people, under the constraint that, for both banks, if there are missionaries
present on the bank, they cannot be outnumbered by cannibals (if they were, the
cannibals would eat the missionaries). The boat cannot cross the river by itself with
no people on board.
9. Perform BFS , DFS , Depth limited search (limit -2) , iterative deepening search for
the given problem with algorithm.

10. Formulate the eight queens puzzle by placing eight chess queens on an
8×8 chessboard so that no two queens threaten each other; thus, a solution requires that no
two queens share the same row, column, or diagonal. Represent complete state
formulation.
 UNIT - II
Part – A (2 – Marks)

1. Compare & Contrast Admissible & Consistent Heuristics? (Apr/ May 2023)
2. Comment on the statement “Breadth first search is a special case of Uniform cost
search”? (Apr/ May 2023)
3. Define admissible & dominant heuristics.(Nov / Dec 2022)
4. What is the purpose of contingency plan? (Nov / Dec 2022)
5. What is Heuristic Function?(Nov / Dec 2023)
6. What are the things that agent knows in online search problems?(Nov / Dec 2023)
7. When is a class of problem is said to be intractable?
8. What is the power of Heuristic search?
9. List out the advantages of Heuristic search
10. State the reason when hill Climbing often gets stuck?
11. What do you mean by local maxima?
12. How can we avoid ridge & plateau in hill climbing?
13. How to minimize total cost using A* search?
14. Give the proof of optimality of A*?
15. How does genetic algorithm come up with optimal Solution?
16. What is AND-OR Graph?
17. How to search Better?
18. What does steepest ascent hill climbing do?
19. What is local beam search?
20. Define Fitness function
21. What is mutation & crossover
22. Define RBFS
23. What is Generate & test?
24. What is partially observable environment?
25. How do you search in continuous space?

Part – B (13 – Marks)

1. Explain about searching with non – deterministic action?
2. Explain about heuristic function & searching with partial observation.
3. Explain in detail about hill climbing & simulated Annealing algo?
4. Explain the online search agent & unknown environment(Nov / Dec 2022)
5. Explain about local search in continuous space?
6. Explain in detail about Memory bounded heuristic search & AO* search with problem
reduction?
7. Describe about Best first search & A* search algorithm with ex.?
8. Explain Heuristic search Algorithms
9. Elaborate the need for local search algorithm & discuss any one algorithm in detail? (Apr/
May 2023)
10. Discuss on online search agent that uses depth first exploration.(Apr/ May 2023)
11. What is heuristic search techniques in AI? How does heuristics search work? Explain its
advantage & disadvantage? (Nov / Dec 2023)
12. Describe local search algorithm with neat sketch. (Nov / Dec 2023)
13. Explain the steps involved in formulating problems with example? (Nov / Dec 2023)
14. Describe Hill climbing, random restart hill climbing and simulated annealing algorithm.
Compare their merits & demerits?
15. How does genetic algorithm come up with optimal solution?
16. Best first search uses both OPEN list and a CLOSED list. Describe the purpose of each for
the Best-First algorithm. Example?
17. Explain any heuristic search method. Justify how heuristics function helps in achieving goal
state?
18. What do you mean by local maxima with respect to search technique?
19. Explain GBF Search with an example?
20. Explain memory bounded heuristic search techniques in detail.
Part – C (15 – Marks)

1. Apply BFS & DFS for the figure given below

2. Solve using A* search algorithm

3. Solve using AO* search algorithm

4. Solve using AO* search algorithm

5. Find the route from Arad to Bucharest using A* search

 6. Explain the working of genetic algorithm with 8-Queens problem
7. Here are three populations from a genetic algorithm: (a) 01010000 10000001 (b)
10010000 01000001 (c) 01010000 10100001
Population b was created by population a reproducing (the crossover is after the
second digit). Population c was created by population a mutating (the second
string was mutated). Let the fitness function be the number of 1’s in a string. What
is the maximum fitness of each population? Is there a better crossover point than
the one used for creating population b? If so, where is it and why is it better?
8. Consider the sensorless version of the erratic vacuum world. Draw the belief-state
space reachable from the initial belief state {1, 2, 3, 4, 5, 6, 7, 8}, and explain why
the problem is unsolvable.
9. Give the name of the algorithm that results from each of the following special
cases: a. Local beam search with k = 1. b. Local beam search with one initial state
and no limit on the number of states retained. c. Simulated annealing with T = 0 at
all times (and omitting the termination test). d. Simulated annealing with T = ∞ at
all times. e. Genetic algorithm with population size N = 1.
10. Draw the state space graph of vacuum world problem.

Unit - III
Part – A (2 – Marks)

1. Justify why we cannot use traditional min max for games with an element of
chance, such as backgammon.(Apr/ May 2023)
2. Class Scheduling: There is a fixed number of professors & classrooms, a list of
classes to be offered, and a list of possible time slots for classes. Each professor
has a set of classes that he or she can teach. Give a precise formulation.(Apr/ May
2023)
3. List out the variables, domain & constraints: There are five professors and 10
classrooms, a list of classes to be offered, and a list of possible time slot for
classes. Each professor has a set of classes that he or she can teach (Nov / Dec
2022)
4. Write the components of a game.(Nov / Dec 2023)
5. What do you mean by constrain propagation?(Nov / Dec 2023)
6. What is CSP?
7. Define game.
8. What is a variable?
9. Define Domain.
10. What is backtracking?
11. What is an Unary Constraints
12. What is DAC?
13. What is the limitation of backtracking?
14. What is minimax algorithm?
 15. How can minimax be extended for game of chance
16. What is Stochastic game?
17. Define cycle Cutset
18. What is alpha beta pruning
19. How do you represent the structure of problems in CSP?
20. Give the application of game theory.
21. What is a game tree?
22. How alpha beta pruning overcome the drawbacks of minimax algorithm?
23. What is multiplayer game
24. What is Look-ahead strategy?
25. What is Look-back Strategy?

Part – B (13 – Marks )

1. Explain about the MinMax algorithm in game theory& need for alpha beta pruning? (Apr/
May 2023)
2. Describe the working of Monte Carlo tree search algorithm(Nov / Dec 2023)
3. Explain partially observable games .How they are solved in deterministic environment?
(Nov / Dec 2022)
4. Explain CSP with backtracking with an example.
5. Explain local search for CSP & solve the crypt arithmetic problem SEND +MORE =
MONEY
6. Explain Game theory & solve the crypt arithmetic problem CROSS +ROADS = DANGER
7. Consider the map coloring problem with 6 variables and three colors (Red, green and blue).
The constraint graph for the problem is given below. How does backtracking search solve the
given problem? What are the heuristics used to improve the efficiency of the search? How are
failures detected early in backtracking? Can breadth first search be applied to above problem?
State the reason.(Nov / Dec 2022)
8.

Formulate the map colouring problem as CSR & explain with an example (Apr/ May 2023)
9. Explain Constraint satisfaction problem & the variations on CSP with example ? (Nov / Dec
2023)
10. Define Local Consistency. What are the different types of local consistency? Explain any
two? (Nov / Dec 2023)
11. Describe alpha beta pruning using example.
12. Solve it using cryptarithmetic problem - - TWO + TWO = FOUR
13. How minimax procedure can be modified to play multiplayer game?
14. Describe how to propagate information through constraints with example?
15. Solve: FORTY + TEN + TEN = SIXTY
16. Solve : LOGIC + LOGIC = PROLOG
17. Solve : TOMATO + POTATO = PUMPKIN
18. Solve : CROSS + ROADS = DANGER
19. Explain local search algorithms for inferencing in prepositional logic.
20. Solve FOUR + FOUR = EIGHT using CSP

Part – C (15 – Marks)

1. Explain the order in which the nodes/states A, B, C and D in game tree I above are evaluated
when running minimax with alpha-beta pruning and progressive deepening after running up
to depth 2 and reordering.
2. In the game tree below, the value below each node is the static evaluation at that node. MAX
next to a horizontal line of nodes means that the maximiser is choosing on that turn, and MIN
means that the minimizer is choosing on that turn. using minimax without Alpha-Beta
pruning, which of the three possible moves should the maximiser take at node A? What will
be the final minimax value of node A?

3. Convert the problems into constraint propagation form

“Paul, John, and Ringo are musicians. One of them plays bass, another plays guitar, and the
third plays drums. As it happens, one of them is afraid of things associated with the number
13, another is afraid of Apple Computers, and the third is afraid of heights. Paul and the guitar
player skydive; John and the bass player enjoy Apple Computers; and the drummer lives in an
open penthouse apartment 13 on the thirteenth floor. What instrument does Paul play?”
4. Solve using CSP: You just bought a 6-sided table (because it looks like a benzene ring) and
want to hold a dinner party. You invite your 4 best friends: McCain, Obama, Biden and Palin.
Luckily a moose wanders by and also accepts your invitation. Counting yourself, you have 6
guests for seats labeled 1-6.
Your guests have seven seating demands:
Palin wants to sit next to McCain
Biden wants to sit next to Obama
Neither McCain nor Palin will sit next to Obama or Biden
Neither Obama nor Biden will sit next to McCain or Palin
The moose is afraid to sit next to Palin
No two people can sit in the same seat, and no one can sit in 2 seats.
McCain insists on sitting in seat 1
5. Solve using Mini-Max algorithm

6. Apply Alpha-Beta Pruning for the example given below

 7. Solve using CSP

8. The 4-queens problem consists of a 4x4 chessboard with 4 queens. The goal is to
place the 4 queens on the chessboard such that no two queens can attack each other.
Each queen attacks anything in the same row, in the same column, or in the same
diagonal. Formulate the state of the 4-queens problem Using CSP

9. Explain the CSP procedure to solve the cryptarithmetic problem

CP
+ IS
+ FUN
--------
= TRUE

10. Explain Scene labelling with an example.

Unit - IV
Part – A (2 – Marks)

1. Some people like every vegetable. Convert it to first order logic (Apr/ May 2023)
2. If the unicorn is mythical, then it is immortal, but if it is not mythical, it is a mortal
mammal. If the unicorn is either immortal or a mammal, then it is horned. The
unicorn is magical if it is horned. Prove : the unicorn is horned by resolution. (Apr/
May 2023)
3. State the converse & contrapositive of the statement, “When I stay up late, it is
necessary that I sleep until noon” (Nov / Dec 2022)
4. Define the term belief state & state estimation.(Nov / Dec 2022)
5. What are the three levels in describing knowledge based agent?.(Nov / Dec 2023)
6. State Unification in first order logic?.(Nov / Dec 2023)
7. What is knowledge-based agent?
8. What is Horn Clause?
9. What is Definite Clause?
10. Name two standard qualifiers?
11. What is the purpose of Unification?
12. Differentiate forward & backward chaining?
13. Define meta rules.
14. Define atomic & complex sentences.
15. State the generalized modus ponens
16. What is Skolemization?
17. Represent the following sentences in predicate form – “All Children Likes Sweets”
 18. Give the grammar to represent Predicate logic
19. What is Resolution?
20. List the inference rules in Propositional logic
21. What is Lifting?
22. What are the types of Knowledge base?
23. What is Universal Quantifier?
24. What is Existential Qualifier?
25. What is ModusTollens?
26. Define Belief desire intention architecture?
27. Define coherence?
28. Define complex sentence.
29. Define Description logic.
30. What is data
Part – B (13 – Marks)

1. Brief on the concept of resolution & explain the propositional resolution algorithm?
(Apr/ May 2023)
2. Give rules of inferences in propositional logic (Apr/ May 2023)
3. Which rule of inference is used in each argument below? (Apr/ May 2023)
 Alice is a math major. Therefore, Alice is either a Math major or a CSI major.
 Jerry is a math major and a CSI major. Therefore, Jerry is a Math major.
 If it is rainy, then the pool will be closed. It is rainy. Therefore, the pool is closed.
 If it snows today, the university will close. The university is not closed today.
Therefore, it didn’t snow today.
 If I go swimming, then I will stay in the sun too long. If I stay in the sun too long,
then I will sunburn. Therefore, if I go swimming, then I will sun burn.
4. Prove the following axioms using Resolution Algorithm
 Every boy or girl is a child.
 Every child gets a doll or a train or a lump of coal.
 No boy gets any doll.
 No child who is good gets any lump of coal.
(Conclusion) If no child gets a train, then no boy is good.
5. Prove the following axioms using Resolution Algorithm(Apr/ May 2023)
 All hounds howl at night
 Anyone who has any cats will not have any mice
 Light sleepers do not have anything which howls at night
 John has either a cat or a hound.
(Conclusion) If john is a light sleeper, then john does not have any mice
6. Discuss about Knowledge Engineering process with proper illustration. Describe the concept of
forward chaining? (Nov / Dec 2023)
7.Express the following statement as predicate(Nov / Dec 2022)

8. Discuss about Forward & Backward Chaining with an example

9. Apply forward chaining – “ As per law it is a crime for an American to sell weapons to
hostile nations. Country A , an enemy of America , has some missiles and all the missiles
were sold to it by Robert, who is an American Citizen”
10. Explain the Inference process in First order logic?
11. Explain the algorithm for computing more general unifiers?
12. Discuss about backward chaining algorithm?
13. Explain Unification algorithm used fir reasoning under predicate logic with an example ?
14. During a murder investigation, you have gathered the following clues:(Nov / Dec 2022)
 1. If the knife is in the store room, then we saw it when we cleared the store room;
2.The murder was committed at the basement or inside the apartment;
3. If the murder was committed at the basement, then the knife is in the yellow dust bin;
4.We did not see a knife when we cleared the store room;
5. If the murder was committed outside the building, then we are unable to find the knife;
6. If the murder was committed inside the apartment, then the knife is in the store room.
Question: Where is the knife?
15. What are logical connectives? Explain in detail? (Nov / Dec 2023)
16. Describe an algorithm for general propositional inference based on model checking. (Nov /
Dec 2023)
17. Describe a procedure for converting a sentence to CNF with an example?
18. Explain with an example the use of unification algorithm to prove the concept of resolution.
19. Discus the syntax & semantics of first order logic?
20. Trace the operation of unification algorithm on each of the following pairs of literals
(i) f ( Marcus ) and f ( Caesar)
(ii) f (x) and f (g(y))
(iii) f(Marcus , g(x,y)) and f (x , g(Caesar , Marcus))

Part – C (15 – Marks)

1. Consider the following axioms: solve using Resolution
All hounds howl at night.
Anyone who has any cats will not have any mice.
Light sleepers do not have anything which howls at night.
John has either a cat or a hound.
(Conclusion) If John is a light sleeper, then John does not have any mice.
2. Consider the following axioms: solve using Resolution
Anyone whom Mary loves is a football star.
Any student who does not pass does not play.
John is a student.
Any student who does not study does not pass.
Anyone who does not play is not a football star.
(Conclusion) If John does not study, then Mary does not love John
3. Consider the following axioms: solve using Resolution
Every child loves every candy.
Anyone who loves some candy is not a nutrition fanatic.
Anyone who eats any pumpkin is a nutrition fanatic.
Anyone who buys any pumpkin either carves it or eats it.
John buys a pumpkin.
Life savers is a candy.
(Conclusion) If John is a child, then John carves some pumpkin
4. Consider the following axioms: solve using Resolution
Everyone is like him/her self.
If someone is a member of a club, then they want to be a member and the club will
accept them.
Gokul does not want to be a member of any club that will accept anyone like him.
(Conclusion) Gokul is not a member of any club.
5. Consider the following axioms: solve using Resolution
Every bird sleeps in some tree.
Every loon is a bird, and every loon is aquatic.
Every tree in which any aquatic bird sleeps is beside some lake.
Anything that sleeps in anything that is beside any lake eats fish.
(Conclusion) Every loon eats fish.
6. Consider the following axioms: solve using Resolution
Every child who finds some [thing that is an] egg or chocolate bunny is happy.
Every child who is helped finds some egg.
Every child who is not young or who tries hard finds some chocolate bunny.
(Conclusion) If every young child tries hard or is helped, then every child is
happy
 7. "As per the law, it is a crime for an American to sell weapons to hostile nations.
Country A, an enemy of America, has some missiles, and all the missiles were sold
to it by Robert, who is an American citizen."
Prove that "Robert is criminal. “using forward & backward chaining.
8. Represent the facts in FOL
1. Lucy* is a professor 2. All professors are people. 3. John is the dean. 4. Deans
are professors. 5. All professors consider the dean a friend or don’t know him. 6.
Everyone is a friend of someone. 7. People only criticize people that are not their
friends. 8. Lucy criticized John
9. Prove by unification
Jack owns a dog. Every dog owner is an animal lover. No animal lover kills an
animal. Either Jack or Curiosity killed the cat, who is named Tuna. Did Curiosity
kill the cat?
10. John likes all kind of food.
Apple and vegetable are food
Anything anyone eats and not killed is food.
Anil eats peanuts and still alive
Harry eats everything that Anil eats.
Prove by resolution that: - John likes peanuts.

Unit - V
Part – A (2 – Marks)

1. Why does Uncertainty arise?.(Nov / Dec 2023)

2. What is Bayes rule? Mention its uses? .(Nov / Dec 2023)
3. How are Bayesian network represented?.(Nov / Dec 2022)
4. What is the purpose of relational probability model?.(Nov / Dec 2022)
5. Justify the purpose of Bayesian Network? (Apr/ May 2023)
6. What is causal Network? (Apr/ May 2023)
7. Define Dempster- Shafer theory
8. Define Bayes theorem
9. What is reasoning by default?
10. Define prior probability
11. State the types of approximate methods
12. What do you mean by hybrid Bayesian network?
13. Define computational learning theory.
14. Give the specification of Bayesian network
15. What is SCM?
16. List the application of fuzzy logic.
17. Define ignorance
18. Why MCMC works?
19. What is likelihood weighing?
20. Define Clustering algorithm?
21. What is inference by Enumeration?
22. What is Naïve Bayes model?
23. What is marginal probability?
24. What is utility theory?
25. What is decision theory?

Part – B (13 – Marks)

1. Design a Bayesian belief network for the diagnosis of cars electrical system.(Apr/
May 2023)
 2. Briefly explain Exact inference in Bayesian Network? (Apr/ May 2023).(Nov / Dec
2023)
3. Explain about Naïve Bayes Model & Causal Networks.
4. Explain in detail about Exact & approximate inference in Bayesian network.
5. How does direct sampling method help in approximate inference? (Nov / Dec 2022)
6. Consider there are three Boolean variable toothache, catch & cavity. From the full
joint distribution calculate P(Toothache), P(Cavity), P (Toothache | cavity), P (Cavity
| toothache v catch).(Nov / Dec 2022)
Toothache Toothache
Catch ~ Catch Catch ~ Catch
Cavity 0.108 0.012 0.072 0.008
~ Cavity 0.016 0.064 0.144 0.576

7. What is d – separation? When are 2 nodes d- separated? (Nov / Dec 2022)

8. What are the ways to understand the semantics of Bayesian network? .(Nov / Dec
2023)
9. What is Bayesian network?Explain the method for constructing Bayesian network? .
(Nov / Dec 2023)
10. List out the applications of Bayesian network?
11. Explain Variable elimination algorithm for answering queries on Bayesian Networks.
12. Explain about Dempster Shafter theory
13. Discuss the need & structure of Bayesian network.
14. Explain about belief network in detail.
15. Explain about causal networks
16. What do you mean by probabilistic reasoning? Give an example
17. Explain fuzzy logic with example.
18. Explain forward & backward reasoning with examples.
19. How Bayes theorem plays a central role in probabilistic reasoning?
20. How to handle uncertain knowledge with example? how to represent it

Part –C (15 – Marks)

1. Harry installed a new burglar alarm at his home to detect burglary. The alarm
reliably responds at detecting a burglary but also responds for minor earthquakes.
Harry has two neighbors David and Sophia, who have taken a responsibility to
inform Harry at work when they hear the alarm. David always calls Harry when he
hears the alarm, but sometimes he got confused with the phone ringing and calls at
that time too. On the other hand, Sophia likes to listen to high music, so sometimes
she misses to hear the alarm. Here we would like to compute the probability of
Burglary Alarm.
Problem:Calculate the probability that alarm has sounded, but there is neither a
burglary, nor an earthquake occurred, and David and Sophia both called the Harry.
2. Calculate the probability that in spite of the exam level being difficult, the student
having a low IQ level and a low Aptitude Score, manages to pass the exam and
secure admission to the university. calculate the probability that the student has a
High IQ level and Aptitude Score, the exam being easy yet fails to pass and does not
secure admission to the university
 3. Draw the Bayesian Network - Inspector Smith is waiting for Holmes and Watson,
who are driving (separately) to meet him. It is winter. His secretary tells him that
Watson has had an accident. He says, “It must be that the roads are icy. I bet that
Holmes will have an accident too. I should go to lunch.” But, his secretary says,
“No, the roads are not icy, look at the window.” So, he says, “I guess I better wait
for Holmes.”
4. Draw the Bayesian Network - Holmes and Watson have moved to LA. He wakes up
to find his lawn wet. He wonders if it has rained or if he left his sprinkler on. He
looks at his neighbor Watson’s lawn and he sees it is wet too. So, he concludes it
must have rained.
5. Given M is known, is A d-separated from E?

A B C

D E F G

H I J
K L

M
6. Calculate the probability the Watson crashes, Probability of icy given Watson ,
Probability of Holmes given Watson , Probability of Icy & Watson

P(I=t) P(I=f)
0.7 0.3
P(H=t|I) P(H=f|I)
P(W=t|I) P(W=f|I)
I=t I=t 0.8 0.8 0.2 0.2 Icy
I=f 0.1 0.9
I=f 0.1 0.9
7. In the Watson
and HolmesCrash Holmes
WatsonCrash
visit LA network, use the following conditional probability tables.
P(R)=0.2
P(H|R,S)
P(S) = 0.1 R,S 1.0
R,¬S 1.0
P(W|R)
R 1.0 ¬R,S 0.9
¬ 0.2 ¬R,¬S 0.1
R
 Calculate:
P(H), P(R|H), P(S|H), P(W|H), P(R|W,H), P(S|W,H)

8. You have a new burglar alarm installed at home. It is fairly reliable at detecting a
burglary, but also responds on occasion to minor earthquakes.You also have two
neighbors, John and Mary, who have promised to call you at work when they hear
the alarm.John always calls when he hears the alarm, but sometimes confuses the
telephone ringing with the alarm and calls then, too.Mary, on the other hand, likes
rather loud music and sometimes misses the alarm altogether. Given the evidence of
who has or has not called, we would like to estimate the probability of a burglary.
9. Find out using Bayesian network - probability of the state of Smoking knowing the
state of Cancer

10. In the network given below ,Knowing that the grass is wet, what is the
probability that rain is the cause?