PANIMALAR ENGINEERING COLLLEGE CHENNAI CITY CAMPUS

DEPARTMENT OF ARTIFICIAL INTELLIGENCE AND DATA SCIENCE

AL3391-ARTIFICIAL INTELLIGENCE

QUESTION BANK

UNIT 1

1. Define an agent.
2. Define Artificial Intelligence (AI).
3. What is the role of agent program?
4. What are the components that define a problem in Artificial Intelligence.
5. Give the general model of learning agent?
6. What is an agent function? Differentiate an agent function and an agent
program.
7. Compare Deterministic vs Stochastic environment
8. Give PEAS description for Part picking robot.
9. What is meant by Turing test?
10. State the concept of rationality.
11. Give the structure of agent in an environment.
12. List some of the uninformed search techniques.
13. What are the steps involved to solve a problem in AI?
14. List the properties of task environments.
15. What is a task environment? How it is specified?
16. Why problem formulation must follow goal formulation?
17. List down the characteristics of intelligent agent.
18. What are the factors that a rational agent should depend on at any given time?
19. Differentiate between Intelligence and Artificial Intelligence.
20. Give performance evaluation measure for
BFS,DFS,UCS,IDDFS,DLS

PART B

1. Define the properties of an environment. Give PEAS description table for agents such as
an automated taxi driver, ATM system, Medical diagnosis system.
2. Demonstrate any two uninformed search strategies in detail.
3. Explain the architecture of agent.
4. What is an intelligent agent? Explain the terms such as percept, percept sequence, agent
function and agent program with vacuum cleaner example.
5. Explain the components necessary to define a problem.
6. What is the difference between informed and uninformed search strategy?
 7. Describe in detail the various definitions of Artificial Intelligence.
8. Explain in detail about structure of typical intelligent agents with example.
9. Explain the following uninformed search strategies =>BFS,DFS,UCS
10. Explain the following uninformed search strategies =>DFS,IDDFS,DLS.

PART C

Explain in detail the structure of intelligent agents.

UNIT 2

PART A

1. List the various search strategies.

2. List the various informed search strategies.
3. What is heuristic search strategy?(AU-2014) OR What is the power of Heuristic Search
Strategy.(AU-2004,2005)
4. What is the advantage of heuristc function?( AU-2009,2011)
5. Define the effect of heuristic accuracy on performance.(AU-2013)
6. Define Greedy BFS.
7. Define A* search.
8. Differentiate greedy search and A* search.
9. Define admissible and consistent heuristic.(AU-2010,16)
10. What is Recursive BFS?
11. What is local search?
12. Define Global minimum and Global maximum.
13. What do you mean by local maxima with respect to search technique.(AU-2011)
14. Define Hill climbing search.
15. Define variants of hill climbing search.
16. Give the drawbacks of hill climbing search. OR State the reason when hill climbing often
gets stuck. (AU-2010).
17. How can we avoid ridge and plateau in hill climbing (AU-2012)
18. Define annealing.
19. What is an online search agent? OR What is the use of online search agent? (AU-2016)
20. Give the procedure of IDA* search.

PART B

1. Explain in detail about A* algorithm.

2. Explain in details about variants of A* algorithm.(IDA*,SMA*,MA*)
3. Explain the working of hill climbing algorithm.
4. Explain the types of hill climbing techniques.
5. Explain the performance of online search algorithm in an unknown environment.
6. Explain various local search algorithm in detail.
7. Discuss Greedy BFS and Recursive BFS.
8. Explain various informed or heuristic search technique.
9.

16. Consider the following 8-puzzle problem where we have a

10.
10.Discuss how searching is done in non deterministic and partially observable environment.

UNIT 3

PART A

1. What is a game?
2. What is Nash equilibrium?
3. Give applications of game theory.
4. What is a game tree?
5. What is a ply in game tree?
6. What is minimax algorithm?
7. What is alpha beta pruning?
8. How can minimax also be extended for game of chance.
9. What is stochastic games?
10. How alpha beta pruning overcome the drawback of minimax algorithm?
11. What is constraint satisfaction Problem.
12. List the types of constraints in CSP.
13. List the types of assignments in CSP.
14. Define forward checking and backtracking in CSP.
15. Define MRV and LCV in CSP.
a. Minimum remaining values heuristic chooses the variable with the fewest “legal”
values.
b. Least constraining value heuristic prefers the value that rules out the fewest
choices for the neighboring variables in the constraint graph.
16. Define Constraint Propagation.
17. Define Cycle Cutset.
18. How do we represent the structure of problems in CSP.
 19. What is Tree Decomposition.
20. Define Conflict directed backjumping.

PART B AND C:

1.Explain minimax game playing algorithm in detail.( AU-2009,2010,2017,2019).

2.How minimax procedure can be modified to play multiplayer games.(8 mark) (AU-2009)

3.Explain alpha beta pruning with an example. (AU-2010,2017)

4.Discuss about Constraint Satisfaction Problem with an algorithm for solving Cryptoarithmetic
problem.(AU-2009,2013,2014,2015,2017,2018).

5.Explain in detail about Constraint Propagation.

6.Discuss about Backtracking in CSP.

7.Breifly describe the structure of problem in CSP.

8.Explain local search in CSP.

UNIT 4

PART A

1. What is Knowledge Based Agent?

2. Distinguish between propositional logic and Predicate logic.(AU-2010,11,13,16,17)
3. What is Horn clause and Definite Clause.
4. Name two standard quantifiers.(AU-10,13)
5. What are the limitation in using propositional logic to represent knowledge base.(AU-
2011)
6. What is the purpose of unification ?(AU-2009,2012)
7. Differentiate forward and backward chaining.(AU-15,17,18)
8. Define meta rules.
9. Define atomic and complex sentences(AU-2014)
10. Define first order definite clause.(AU-2013)
11. State the generalized modus ponens.(AU14,18)
12. What is Skolemnisation.(AU-2013)
13. Represent the following sentence in predicate form
“All the children likes sweets” (AU-2012)
14. Define causal and diagnostic rules with an example.(AU-2012)
 15. What factors justify whether reasoning is to be done in forward or backward
reasoning.(AU-2011).
16. Give the grammar to represent propositional logic.
17. Give the grammar to represent Predicate logic.
18. List various inference rules in Propositiona logic.
19. List various inference rules in Predicate logic.
20. What is resolution?

PART B

1.Write the algorithm for deciding entailment in propositional logic( 8 mark-AU-2014)

2.Give the five logical connectives used to construct complex sentences and give the formal
grammar of propositional logic.( 6mark-AU-2013).

3.Describe forward chaining and backward chaining algorithm in detail.

Or Explain inferencing process in first order predicate logic.

Apply both the algorithm to prove that “West is Criminal”.

4.Explain unification algorithm used for reasoning under predicate logic with an example.(16
mark-AU-2011).

5.Explain the steps involved in knowledge engineering Process.(AU-2011,13)

6.Describe procedure for converting sentence in to CNF With an example. (DEC-2018).

7.Relate first order logic with propositional logic and discuss in detail about the same(13 mark-
DEC 2018).

8.Explain standard quantifiers of first order logic with example (8 mark-AU-2014)

9.Give the completeness of proof of resolution(8 mark-AU-2014)

10.What are the steps to convert FOL TO NORMAL FORM.Explain each step.(8 MARK-
AU2014)

11.PROBLEMS DISCUSSED IN CLASS

 UNIT 5

PART A

1. Define Dampster –Shafer theory.

2. Define Bayes Theorem.
3. Define Uncertainity.
4. State Bayes rule.
5. Give the full specification of Bayesian Network.
6. What do you mean by hybrid Bayesian network?
7. What is reasoning?
8. What are the logic used in reasoning with uncertain information.
9. Define prior probability.
10. State the types of approximation methods.
11. State the types of inference in Bayesian network.
12. What is causal network.

PART B

1.What is Bayesian Network?How Bayesian network is used to represent knowledge in

uncertain domain.

2.Explain the method of performing exact inference.

3.Explain the method of performing approximate inference.

4.Explain in detail about causal network.

5.Define uncertain knowledge,prior probability and conditional probability. State Bayes

theorem. How is it useful for decision making under uncertainty. Explain belief network
breify.

6.How to represent knowledge in an uncertain domain.