DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

SUB NAME:Artificial Intelligence (10CS764)

Question Bank

UNIT 1:

Introduction: What is AI? Intelligent Agents: Agents and environment;Rationality; the nature
of environment; the structure of agents. Problemsolving: Problem-solving agents; Example
problems; Searching for solution;Uninformed search strategies

Questions:

1. a. Define artificial intelligence. Explain the interaction between an agent and its environment.
(08Marks)
b. Explain different properties of task environment.(04Marks)
c. What is meant by uninformed search? Explain breadth-first-strategy (BFS).
(08Marks) (June 2010)
2 a. With examples, explain different types of task environments. (08Marks)
b. Explain Breadth-First-Search (BFS) strategy. (12Marks) (January 2010)

Unit2:

Informed Search, Exploration, Constraint Satisfaction, Adversial Search:Informed search

strategies; Heuristic functions; On-line search agents and unknown environment. Constraint
satisfaction problems; Backtracking search

Questions:
1. a. What is informed strategy? Explain A*search strategy.
b. Write backtracking algorithm for constraint satisfaction problem and explain it.(June 2010)

2 a. Explain A* search strategy. Prove :

i) A* using TREE-SEARCH is optimal if h(n) is admissible.
ii) A* using GRAPH-SEARCII is optimal if h(n) is consistent. (12 marks)
b. Write the algorithm for online search agent that uses depth first exploration. (08 marks)

(January 2010)

The Oxford College of Engineering Page 1

 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Unit3:

Logical Agents: Knowledge-based agents; The wumpus world as

an example world; Logic; propositional logic Reasoning patterns
in positional logic;Effective propositional inference; Agents based
on propositional logic.

Questions:

1 a. Write the syntax and semantic of propositional logic. Write BNF grammar for sentences in
propositional logic. (12marks )
b. Write forward-chaining algorithm for propositional logic. Explain it. (08 marks)(June 2010)

2 a. Write the syntax of propositional logic. Write BNF grammar for sentences in propositional logic.
(08 marks)
b. Write the algorithm for Wumpus world agent to find pits, wupuses and safe squares. (12marks )
(January 2010)

Unit4:

First-Order Logic, Inference in First-Order Logic 1:

Representation
revisited; Syntax and semantics of first-order logic; Using
first-order logic;

Questions:

1 a. What is knowledge engineering? Explain the steps involved in knowledge engineering process.
(08marks) (June 2010)
b. Write the unification algorithm. Explain. (12marks)

2. a. Write the syntax of first order logic using BNF. (08marks)

b. List and explain the steps involved in knowledge engineering projects. (12marks)(January 2010)

Unit5:

Inference in First-Order Logic 2: Forward chaining;

Backward chaining;Resolution.

The Oxford College of Engineering Page 2

 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Questions:

1 a. Write backward chaining algorithm. (08marks)

b. What is conjunctive normal form? Write the CNF for the problem given below.
i)Everyone who loves all animals is loved by someone.
ii) Anyone who kills an animal is loved by no one.
iii)Jack loves all animals.
iv)Either Jack or curiosity killed the cat. who is named Tuna.
v)Did curiosity kill the cat? (12marks) (June 2010)

2. a. Write toward chaining algorithm. (12marks)

b. Explain aspects of prolog that fall outside standard logical inference. (08marks) (January 2010)

UNIT 6:

Knowledge Representation: Ontological engineering;

Categories and objects; Actions, situations, and events;
Mental events and mental objects;The Internet shopping
world; Reasoning systems for categories; Reasoning

Questions:
1 a. Explain the ontology of situation calculus.(10 marks)
b. Explain the truth maintenance system. .(10 marks) (June 2010)

2 a. Explain with examples, how first order logic expresses facts about categories.
b. Explain the ontology of situation calculus. (January 2010)

Unit7:

Planning, Uncertainty, Probabilistic Reasoning: Planning: The

problem;Planning with state-space approach; Planning graphs;
Planning with propositional logic.Uncertainty: Acting under
certainty; Inference using full joint distributions;Independence;
Bayes rule and its use.Probabilistic Reasoning: Representing
knowledge in an uncertain domain;The semantics of Bayesian
networks; Efficient representation of conditionaldistributions;
Exact inference in Bayesian networks.

The Oxford College of Engineering Page 3

 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Questions:

1 a. Explain the process of planning graph for heuristic estimation. Write GRAPHPLAN algorithm.
(10 marks)
b. What is the Bayesian network? Explain how it is used to represent knowledge. .(10 marks)
(June 2010)

2 a. Compare how STRIPS and ADL programming languages represent planning problems. .(10 marks)
b. What is Bayesian network? Explain how it is used to represent knowledge? .(10 marks) (January 2010)

Unit 8:

Learning, AI: Present and Future: Learning: Forms of

Learning; Inductive learning; Learning decision trees;
Ensemble learning; Computational learning theory.
AI: Present and Future: Agent components; Agent
architectures; Are we going in the right direction? What if
AI does succeed?

Questions:

1 a. Write the decision tree algorithm and explain it.

b. Explain the agent components. .(10 marks) (June 2010)
2. a. Write the decision tree learning algorithm.
b. Explain how the applicability of decision trees is broadened. .(10 marks) (January 2010)

The Oxford College of Engineering Page 4