BCS505B Artificial Intelligence

Question Bank, January 2025

Module – 1
1. Define an intelligent agent. Make use of Architectures in AI to explain different types of
agents.
2. Identify the influence of neural network and scientific methods on the modern
understanding of artificial intelligence.
3. Identify the benefits and applications of AI in real time.
4. Identify the significant contributions of various branches in the foundations of AI.
5. Write the major milestones in the development of AI from its inception to the present?
6. Make use of Architectures in AI to explain different types of agents.
7. Explain the structure of agent with example.
8. Identify the different types of Environments. Explain each in detail with examples.
9. Choose the PEAS for the task environment of Automatic Taxi Driver. Summarize the
properties of this task environment.
10. Choose Performance measure, Environment, Actuators and Sensors for autonomous Taxi
Driver system. Write the properties of this task environment.
11. Explain the basic kinds of agent programs that embody the principles underlying all
intelligent systems.
12. Apply the idea of agent function and agent program with the vacuum cleaner world
problem.
13. Choose Performance measure, Environment, Actuators and Sensors for Satellite Image
analysis system. Write the properties of this task environment.
14. Identify the different types of Environments. Explain each in detail with examples.
15. Identify the different types of Environments. Explain each in detail with examples.
16. Explain how the components of agent programs work.

Module – 2
1. Construct the state space for the vacuum world problem. Explain how vacuum world
problem can be formulated as problem.
2. List all uninformed search strategies. Write the differences between them.
3. What is Uniform-cost search? write an algorithm/function for the same.
4. Develop algorithm for Uniform Cost. Find the route from S to G using Uniform Cost
Search for the given graph:

Page 1 of 7
5. Develop pseudo code for Breadth First Search. Apply that pseudo code to find out the
path from A to F on the given graph. Write the status of frontier in each state.

6. Construct the steps to find the path with pseudocode for the given Problem using BFS
algorithm by considering A as initial state and M as Goal state.

7. Construct the steps to find the path with pseudocode for the given Problem using DFS
algorithm by considering A as initial state and M as Goal state.

8. Analyze the Given 8 puzzle problem and write the steps to reach the goal state.

9. Develop Iterative deepening depth-first search algorithm. Explain with example.

10. What is Iterative Deepening Search technique? Build an algorithm/function for the same
with an example.
11. Compare all the uniformed search strategies with examples.
12. Consider the missionaries and cannibals problem usually stated as follows: “Three
missionaries and three cannibals are on one side of a river, along with a boat that can hold
 one or two people. Find a way to get everyone to the other side without ever leaving a
group of missionaries in one place outnumbered by the cannibals in that place”,
a. Analyze the problem precisely, making only those distinctions necessary to
ensure a valid solution. Draw a diagram of the complete state space.
b. Simplify the problem optimally using an appropriate search algorithm.
13. Choose complete problem formulation for the following problem “You have three jugs,
measuring 12 gallons, 8 gallons, and 3 gallons, and a water faucet. You can fill the jugs
up or empty them out from one to another or onto the ground. You need to measure out
exactly one gallon.”

Module – 3
1. Apply the Greedy Best first Search (or A* Search) strategy to solve the Romania
Problem and find out the cost of solution path from Arad to Bucharest. Write the pseudo
code for the same. Write the explanation for each step.

Values of hSLD – Straight Line Distances to Bucharest

Arad 366 Mehadia 241

Bucharest 0 Neamt 234
Craiova 16 Oradea 380
Drobeta 242 Pitesti 100
Eforie 161 Rimnicu Vilcea 193
Fagaras 176 Sibiu 253
Giurgiu 77 Timisoara 329
Hirsovva 151 Urziceni 80
Iasi 226 Vaslui 199
Lugoj 244 Zerind 374
2. Apply A* Search (or Greedy Best Search) Strategy on the given graph to find out the
cost of the solution path from S to G. Write the pseudo code for the same.

3. Write a note on Heuristic search functions.

4. Distinguish backward and forward chaining with examples.
5. Explain a generic knowledge-based agents’ program. Write PEAS specification for
Wumpus world.
6. Write a function for Knowledge based agent and explain in detail.
7. Analyze the above fig, If the agent starts in square (1,1), outline a sequence of safe moves
it should take to reach the gold in Square (3,3), avoiding pits and the Wumpus.

8. Analyze the role of resolution in propositional logic, and how does it aid in automated
reasoning?
9. Recommend the key challenges of an agent faces in the Wumpus World, and how can
logical reasoning help to overcome them?
10. Prove, or find a counterexample to, each of the following assertions:
(i) If α |= γ or β |= γ (or both) then (α ∧ β) |= γ
(ii) If α |= (β ∧ γ) then α |= β and α |= γ.
11. Prove that the unicorn is both magical and horned from the given statement: “If the
unicorn is mythical, then it is immortal, but if it is not mythical, then 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.”
 Module – 4
1. Compare the differences between terms and predicate in First order logic.
2. Distinguish between constants, variables, predicates, and functions in FOL with
engineering examples.
3. Design an FOL representation for a traffic control system that models intersections,
vehicles, and traffic lights.
4. Explain the challenges of unification when dealing with complex domains like multi-
agent systems?
5. How would you represent the following statements in FOL?
a. “Every student loves at least one course.”
b. “If a person is a professor, then they teach a course”
c. “Some dogs are pets.”
6. Construct the examples for the following:
a. Logical Equivalence b. Inference rules c. Horn clauses
7. Explain assertions and queries in first-order logic.
8. Explain the universal and existential quantification with example.
9. Consider the following problem: “The law says that it is a crime for an American to sell
weapons to hostile nations. The country Nono, an enemy of America, has some missiles,
and all of its missiles were sold to it by Colonel West, who is American.” Prove that
Colonel West is a criminal by using forward-chaining and backward chaining algorithm.
10. Write a forward-chaining algorithm for propositional logic.
11. Can Unification fail? Justify your answer with an example where two predicates cannot
be unified.
12. Analyze how a large theory can be built up from a tiny kernel of axioms by using the
example of Numbers.
13. Analyze how a large theory can be built up from a tiny kernel of axioms by using the
example of Sets.
14. Illustrate the procedure for conversion to CNF by translating the sentence “Everyone who
loves all animals is loved by someone,”
15. Compare backward chaining with forward chaining in terms of efficiency for solving
specific types of problems.

Module – 5
1. Justify that how can an uncertainty be incorporated into the Wumpus World agent’s
decision-making process?
2. Evaluate the significance of random variables and probability distributions in quantifying
uncertainty.
3. Choose the trade-offs between deterministic and probabilistic models for decision-
making under uncertainty?
4. Justify your answer. In what scenarios would a decision tree be insufficient, requiring the
use of probabilistic approaches?
5. Choose the methods that can be used to acquire probabilistic knowledge from experts,
and what are the associated challenges?
6. Analyse a health care system and explain how would you represent a medical diagnostic
system’s domain knowledge in a Bayesian network?
7. Analyze marginalization and normalization with a full joint distribution of toothache,
catch, cavity world as given in the following table.
toothache toothache
catch catch catch catch
cavity 0.108 0.012 0.072 0.008

cavity 0.016 0.064 0.144 0.576

8. Consider the full joint distribution of toothache, catch, cavity world as in the following
table:
toothache toothache
catch catch catch catch
cavity 0.108 0.012 0.072 0.008
cavity 0.016 0.064 0.144 0.576
Estimate:
(i) P(toothache) (ii) P(Cavity) (iii) P(Toothache | cavity)
(iv) P(Cavity | toothache ∨ catch) .
9. Evaluate the effectiveness of knowledge acquisition techniques for expert systems in
handling complex, domain-specific problems. Provide recommendations for improving
these techniques.
10. Contrast expert system and neural network in terms of knowledge representation,
knowledge acquisition and explanation. Identify a domain in which the expert system
approach would be more promising and a domain in which the neural network approach
would be more promising.
11. Examine the role of probability in solving problems of Wumpus world.
12. How can a Wumpus world agent represent uncertainty about the locations of pits and the
Wumpus? Justify your answer.
13. Consider two medical tests, A and B, for a virus. Test A is 95% effective at recognizing
the virus when it is present, but has a 10% false positive rate (indicating that the virus is
present, when it is not). Test B is 90% effective at recognizing the virus, but has a 5%
false positive rate. The two tests use independent methods of identifying the virus. The
virus is carried by 1% of all people. Say that a person is tested for the virus using only
one of the tests, and that test comes back positive for carrying the virus. Which test
returning positive is more indicative of someone really carrying the virus? Justify your
answer mathematically.
14. Apply Bayes’ rule for the scenario “doctor knows that the disease meningitis causes the
patient to have a stiff neck, say, 70% of the time. The doctor also knows some
unconditional facts: the prior probability that a patient has meningitis is 1/50,000, and the
 prior probability that any patient has a stiff neck is 1%.” to find out the expected number
of patients with a stiff neck to have meningitis.
15. If a factory produces 70% high-quality items and 30% low-quality items, and 80% of
high-quality items pass inspection, while 50% of low-quality items pass inspection,
Determine the probability that a randomly selected item that passed inspection is high-
quality.
16. Interpret how knowledge graphs or ontologies could be used to represent domain
knowledge for a medical diagnostic expert system.