CITY ENGINEERING COLLEGE

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

ARTIFICIAL INTELLIGENCE – 15CS562

MODULE -1

1. Define Intelligence and Artificial Intelligence. Write short notes on problem areas in Artificial
Intelligence.
2. State Tower of Hanoi/ Missionaries and Cannibals Problem and give its State Space.
3. List four things to build a system to solve a problem.
4. Explain four characteristics to build a system in order to solve a problem. Define State Space.
5. What is Production System? Explain production system
characteristics.
6. What is Physical Symbol System? What is AI technique? How does AI exploit knowledge?
7. Define Artificial Intelligence. Explain in detail about Turing Test.
8. Explain Water Jug Problem as a state space search/ Write the Production Rules for Water
Jug Problem.
9. Give examples of Problems which are decomposable, non-decomposable, have a solution as a path
and a state.
10. What is Production System? Describe different classes of Production Systems with examples.
11. What are the issues with Steepest Hill Climbing? How it is taken care by Simulated Annealing?
12. Explain A* algorithm with example.
13. What is Means-Ends Analysis? Explain with an example.
14. What do you mean by heuristic?
15. Explain Hill climbing Heuristic search.
16. Define state space search & problem space.
17. Explain problem reduction.
18. Write short notes on Constraint satisfaction method.
19. Write AO* algorithm and explain the steps in it.
20. What is heuristic search? What are the advantages of Heuristic Search?
21. Explain annealing schedule.
22. Explain Breadth-first search and depth-first search. List down the advantages and
disadvantages of both.
23. What do you mean by an AI Technique? Discuss the tic-tac-toe problem in detail and
explain how it can be solved using AI technique.
24. What are problem characteristics?
25. Write a heuristic function for travelling salesman problem.
 26. Apply A* Algorithm to the following graph, where S is the Initial State and G is the Goal state.
The table below indicates h’ values.

State h(n)
S 6
A 2
B 4
C 1
D 2
G 0

27. How AND-OR graphs are used for problem reduction? Explain.

28. Write the algorithm for Generate and Test search.

29. Describe the issues in the design of search programs.
30. Analyze the algorithm for Agenda-driven search.

MODULE – 2

1. Differentiate between forward reasoning and backward reasoning with an example.

2. Explain Forward representation mapping and backward representation mapping.
3. Consider the following sentences:
a. John likes all kinds of food
b. Apples are food.
c. Chicken is food.
d. Anything anyone eats and isn’t killed by is food.
e. Bill eats peanuts and still alive.
f. Sue eats everything bill eats.
Prove that “John likes peanuts using resolution”.
4. Explain Unification Algorithm.
5. “Some medicines are dangerous if taken in excessive amount”. Translate the sentence into
predicate logic and then to clause form.
6. Write short notes on Predicate Logic.
7. Explain the significance of resolution technique.
8. Discuss various issues in knowledge representation.
9. Write the four properties for a good system of knowledge
representing in a particular common.
10. Explain different approaches and types of Knowledge Representation.
11. What is instance and is a relationship?. Briefly explain relationship among attributes.
12. Differentiate procedural vs declarative knowledge.
13. What is Horn Clause?
14. What is rule based system?
15. What is matching? Explain with an example.
16. Explain how knowledge can be represented using predicate logic.
17. How can resolution be used to show that a sentence is valid?
18. Consider the following facts:
a. X married to Y
b. P is Q’s brother
c. The spouse of every married person in the club is also a member of the club
d. X,P,Y,Q are all members of the club Prove by
resolution that Elder is not married
19. Assume the following facts:
a. Steve only like easy courses.
b. Science courses are hard.
c. All the courses in the basket wearing department are easy.
d. BK 301 is a basket wearing course.
20. What is the difference between Fact and Representation and its mapping in detail.
21. Explain Property Inheritance algorithm in detail.
22. Explain in detail about the Frame problem.
23. Explain representation of simple facts in Predicate Logic.
24. Explain different computable functions and its predicates.
 Use resolution to answer the question “What course would Steve
like?”

K S V Krishna Srikanth Page 5

 Use resolution to answer the question “What course would Steve
like?”

K S V Krishna Srikanth Page 6