DEPARTMENT OF INFORMATION TECHNOLOGY

Academic Year(2015-2016)Even Semester

QUESTION BANK
ARTIFICIAL INTELLIGENCE
UNIT-I
Introduction

History of AI
Intelligent agents
Structure of agents and its functions
Problem spaces and search
Heuristic Search techniques
Best-first search
Problem reduction
Constraint satisfaction
Means Ends Analysis.
PART A (2 MARKS)

1.
2.
3.
4.
5.

Define Constraint Satisfaction

Define Production System.
Define Agent
Define Artificial Intelligence in terms of rational acting.
Can we consider Breadth first search and depth first search as special cases of best-case

search? Justify your answer.

6. What is to be done to define a problem?
7. Point out the issues in designing search program
8. What do you mean by AI?
9. List the four types of agent programs.]
10. Define rational agent
11. How will you measure the problem solving performance?
12. State the reasons when the hill climbing often gets stuck
13. List down the characteristics of intelligent agent?
14. What do you mean by local maxima with respect to search techniques?
15. What are the functionalities of an agent function?
16. What are four components to define a problem? Define them.
17. Why problem formulation must follow the goal formulation?

18. Give the PEAS description of an interactive English tutor system

19. what is local minima problem
20. What is the use of heuristic functions?
21. How to improve the effectiveness of a search based problem solving technique?
22. Define a data type to represent problems and nodes.
23. How does one characterize the quality of heuristic?
24. Formally define game as a kind of search problems.
25. Differentiate blind search & heuristic search.
26. Define iterative deepening search.
27. Differentiate greedy search & A* search.

PART- B (11 MARKS)

1.
2.
3.
4.
5.

Explain Model-based agent and Goal-based agents in detail.

Neatly sketch out A* algorithm.
What can AI do today? Explain.
Explain the problem characteristics.
Develop a hill climbing algorithm based on heuristic approach which avoids climbing

false foot hills.

6. Apply the concept of constraint satisfaction over 8-Queens problem and narrate the steps
involved in solving this.
7. Explain Simple-reflex and Utility-based agents in detail
8. Neatly sketch out AO* algorithm.
9. Discuss the Best-First Search with an example.
10. Describe the Means-Ends Analysis algorithm.
11. What are the four basic types of agent program in any intelligent system? Explain how
did you convert them into learning agents?
12. What is Greedy Best First Search? Explain with an example the different stages of
Greedy Best First search.
13. Define a problem and its components . Explain how a problem solving agent works?
14. How an algorithms performance is evaluated? Compare different uninformed search
strategies in terms of the four evaluation criteria.

UNIT-II
Knowledge Representation
Approaches and issues in knowledge representation
Knowledge-Based Agent
Propositional Logic

Predicate logic
Unification
Resolution
Weak slot-filler structure
Strong slot-filler structure.
PART- A (2 MARKS)

1. List the various issues in representing knowledge.

2. Define Frame.
3. What is an intersection search?
4. Define conceptual dependency.
5. Define frame problem in situation calculus
6. State the significance of Dempster-Shafer Theory
7. List the four properties of knowledge representations
8. Compare declarative knowledge and procedural knowledge
9. What is resolution?
10. Joe, tom and Sam are brothers-represent using first order logic symbols.
11. List the canonical forms of resolution.
12. What is the significance in using unification algorithm?
13. what is unification algorithm?
14. how can you represent the resolution of predicate logic?
15. Define universal and existential quantifiers.
16. What are the limitations in using propositional logic to represent the knowledge base?
17. Differentiate between prepositional versus first order logic
18. How can you represent the resolution in predicate logic?
19. Define First Order Logic.
20. Define a knowledge Base
21. Define Synatx,Semantics and Entailment.

PART- B (11 MARKS)

1.
2.
3.
4.
5.

Cite and explain the resolution algorithm for predicate logic.

Discuss CYC Strong slot filter structure.
Explain the approaches to knowledge representation.
Write the steps to convert a WFF into clause form.
Highlight and discuss the features of assumption-based and justification based truth

maintenance systems in detail.

6. Using semantic nets and frames, explain the characteristics of weak slot filters.
7. Mention the various issues in knowledge representation relationships among attributes.
8. Discuss the semantic nets weak slot filter structure.
9. Discuss the various approaches to knowledge representation
10. Discuss the Predicate logic in detail.
11. (i) Define the syntactic elements of first-Order logic
(ii) Illustrate the use of first-order logic to represent knowledge.

UNIT-III
Reasoning under uncertainty

Logics of non-monotonic reasoning

Implementation
Basic probability notation
Bayes rule
Certainty factors and rule based systems
Bayesian networks
Dempster - Shafer Theory
Fuzzy Logic.
PART- A (2 MARKS)

1. Point out the important problems in implementing non-monotonic reasoning.

2. State Bayes theorem.
3. What do you mean by non monotonic reasoning.
4. Define marginal independence of a variable.
5. How a problem is modeled in state space search?
6. What are the two common kinds of monotonic reasoning?
7. State the disadvantages of Bayes theorem.
8. What are the various basic probability statements?
9. What does Dempster-Shafer theory use?
10. Give the full specification of Bayesian network.
11. list out the advantages of non monotonic reasoning?

PART- B (11 MARKS)

1.
2.
3.
4.
5.
6.
7.

Elucidate Dempster-shafer theory

Explain the two approaches to perform Default Reasoning.
Describe the justification based truth maintainence system.
Explain Bayesian networking.
Explain the logics for non-monotonic reasoning
Discuss the Bayes rule an its use.
a) Suppose that we have two bags,each containing black and white balls. One bag
contains three times as many white balls as blacks. The other bag conatins three times as
many black balls as white. We choose one of these bags atrandom.For this bag,we select
five balls at random replacing each ball after it has been selected.The result is that we
find 4 white balls and one black. Apply Bayes rule and calculate the probability that we
were using the bag with mainly white balls. (8 marks)

b) With proper syntax and semantics,show how default reasoning deals with a system
default. (8 marks) [
8. Devise the rules and as assumed fuzzy set for an air conditioner performing the following
constraints:
a) An air conditioner is an apparatus for controlling,especially lowering the temperature
and humidity of an enclose space.An air conditioner typically has an fan which
blows/cools/circulates fresh air and has cooler and the cooler is under thermostatic
control. Generally, the amount of air being compressed is proportional to the ambient
temperature.
b) Consider an air-conditioner which has five control switches: COLD, COOL,
PLEASANT, WARM, and HOT. The corresponding speeds of the motor controlling
the fan on the air-conditioner has the graduations: MINIMAL, SLOW, MEDIUM,
FAST, and BLAST.

UNIT-IV
Planning and Learning

Planning with state space search

Conditional planning
Continous planning
Multi-Agent planning
Forms of learning
Inductive learning
Learning decision trees
Neural Net learning
Genetic learning
PART- A (2 MARKS)

1.
2.
3.
4.
5.
6.

What are the two heuristic approaches for state space search?
List the issues of decision tree induction.
State the purpose of goal test.
What is an unsupervised learning?
When do we certify the given learning problem as realizable?
How a problem is modeled in state space search?

7. What is multi body planning?

8. Distinguish supervised and unsupervised learning.
9. What are the ways to explore the state space search problem?
10. Define Decision Tree.
11. What is active and passive reinforcement learning?
12. State the advantages of inductive logic programming.
13. Distinguish between supervised and unsupervised learning?
14. State the reasons why the inductive logic programming is popular.
15. Define state space search
16. What is Conditional planning?
17. Differentiate between Forward state-space search and Backward state-space search.
18. What are the steps of planning problems using state space research
methodology?

PART- B (11 MARKS)

1. Discuss Continuous Planning.
2. Sketch out the Decision Tree learning algorithm and explain with example
3. Explain the planning with forward state-space search.
4. What is an ensemble learning?Explain.
5. List and discuss the role of various phases present in multi-agent planning system.
6. Illustrate the usage of decision trees in learning phase of AI with an influence diagram.
7. Sketch out the Decision Tree learning algorithm and explain with example.
8. Cite the two Planning algorithm that uses State-space search
9. Describe the Conditional Planning.
10. Briefly discuss the various learning methods in neural networks.

UNIT-V
Advanced Topics
Game Playing
Minimax search procedure
Adding alpha-beta cutoffs
Expert System
Representation
Expert System shells
Knowledge Acquisition.
Robotics
Hardware
Robotic Perception
Planning

 Application domains
PART- A (2 MARKS)
1. What are the two capabilities an Expert system should have?
2. List some of the application domains for robotic technology.
3. What is an robot?
4. What is a range finder?
5. Name the components of a game in the perspective of a search problem.
6. Specify the time and space complexities of minimax algorithm.
7. Define credit arrangement problem.
8. Define robotic perception.
9. Give some examples of Expert systems.
10. What are the approaches towards planning a path by a robot?
11. Explain Knowledge Acquistition.
12. Define Expert System.

PART- B (11 MARKS)

1.
2.
3.
4.

Depict the Minimax Search procedure.

State and explain the various types of sensors that are equipped with the robot.
Explain the ROBOT hardware.
List various steps involved in determining alpha beta cutoffs in a search tree. Also,
analyze heuristic improvements that are possible with this approach through an example

of making moves in chess game

5. Discuss the generic software architecture of expert system and its inference engine in
6.
7.
8.
9.

detail.
Depict the cell decomposition in path-planning methods in robotics.
List and explain any four application domains for Robotics technology.
Describe the steps of Minimax search procedure in game playing.
Explain the various components of robot hardware.