Ci QB
Ci QB
QUESTION BANK
UNIT I - INTRODUCTION
Introduction to Artificial Intelligence-Search-Heuristic Search-A* algorithm-Game Playing- Alpha-Beta
Pruning-Expert systems-Inference-Rules-Forward Chaining and Backward Chaining- Genetic
Algorithms.
Part - A
S.No Questions K Competence
Le
vel
1 Define Artificial Intelligence K1 Remember
2 List the criteria to measure the performance of different search strategies. K1 Remember
3 Describe the four categories under which AI is classified. K1 Remember
4 What are Expert Systems? K1 Remember
5 List the characteristic features of expert system. K1 Remember
6 Define Inference. K1 Remember
7 Infer some of the application domain where the agent based problem solving K2 Understand
is appropriate.
8 Give any four names of earliest expert systems. K1 Remember
9 Infer some of the uninformed search techniques. K2 Understand
10 Give the components of Game software. K1 Remember
11 Write the general form of the genetic algorithm K1 Remember
12 Show the definition of state-space search technique. K2 Understand
13 Show the meaning of heuristic search. K2 Understand
14 Compare Informed &Uninformed search with examples. K2 Understand
15 Will Breadth-First Search always find the minimal solution why? K2 Understand
16 State the Point of view of alpha-beta pruning K1 Remember
17 Appraise when hill climbing fails to find a solution? K2 Understand
18 Assess the forward chaining rules with example. K2 Understand
19 Name the three activities supported by the programs that interact with K1 Remember
domain experts to extract expert knowledge.
20 Write the ways to formulate a problem. K1 Remember
Part - B
1 Describe informed search strategies with an example. (13) K2 Understand
2 List the advantages and limitations of Genetic Algorithm. State the taxonomy K2 Understand
of the cross over operator. (13)
3 Define A*search algorithm. Discuss about the admissibility of A*algorithm. K2 Understand
(13)
4 List and describe the problem characteristics that need to be considered for K2 Understand
selecting appropriate heuristics for a given class of problems. (13)
5 (i) Distinguish A* and AO*algorithm with each other. (6) K2 Understand
(ii) Demonstrate why some times unnecessary
backward propagation occurs in ANDOR
6 Infer in details about Rule Based Systems with some K2 Understand
examples.(13)
7 i.Give the characteristics of AI problems? Explain with example(7) K2 Understand
ii.Express what is Control Strategy and Production System? How this is helpful
in AI (6)
8 Write short notes on Expert system tools and expert K2 Understand
system shell. (13)
9 How is AI useful in game playing techniques? Describe what is adversarial K2 Understand
search?(13)
10 i. Illustrate the role of knowledge engineer, domain expert and an end user K2 Understand
in an expert system. (6)
ii. Explain the difficulties involved in developing an expert system. (7)
11 Point out the procedures of genetic algorithms and what are the different K2 Understand
genetic representations
12 i.Infer what is alpha beta pruning/ search.(7) K2 Understand
ii.Explain MINIMAX search technique / algorithm with an example.(6)
13 Draw the state space graph of Hill climbing search. What are the drawbacks K2 Understand
of this algorithm? Also discuss about time space complexity of this
algorithm(13)
14 Consider the block world problem with four blocks A, B, C, D with the start K2 Understand
and goal states given below.
Assume the following two operations: Pick and a block and put it on table,
pick up a block and put it on another block. Solve the above problem using
Hill Climbing algorithm and a suitable heuristic function. Show the
intermediate decisions and states.(13)
Part -C
1 Is it advisable to apply GA’s for all kinds optimization problems? Justify.(15) K3 Apply
2 Solve the given problem. Describe the operators involved in it. Consider a Water K3 Apply
jug Problem: You are given two jugs, a 4-gallon one and a3 gallon one. Neither
have any measuring markers on it. There is a pump that can be used to fill the
jugs with water. How can you get exactly2 gallons of water into the 4-gallon jug?
Explicit Assumptions: A jug can be filled from the pump, water can be poured
out of a jug onto the ground, water can be poured from one jug to another and
that there are no other measuring devices available.(15)
3 Consider a two player game in which the minimax search procedure is used to K3 Apply
compute the best moves for the first player. Assume a static evaluation function
that returns values ranging from -10 to10, with 10 indicating a win for the first
player and-10 a win for the second player. Assume the following game tree in
which the static scores are from the first player‘s point of view. Suppose the first
player is the maximizing player and needs to make the next move. What move
should be chosen at this point? Can the search be optimized?(15)
Part – C
1 Consider the following sentences: K3 Apply
John likes all kinds of food
Apples are food
Chicken is food
Anything any one eats and isn’t killed by is food
Bill eats peanuts and is still alive
Sue eats everything Bill eats
i) Translate these sentences into formulas in predicate logic(7)
ii) Convert the formulas of part a into clause form.(8)
2 Evaluate the unification algorithm used for reasoning under predicate logic K3 Apply
with an example. Consider the following facts.(15)
a. Team India
b. Team Australia
c. Final match between India and Australia
d. India scored 350 runs, Australia scored 350runs, India
lost 5 wickets, Australia lost 7wickets.
e. The team which scored the maximum runs wins.
f. If the scores are same the team which lost minimum
wickets wins the match.
Represent the facts in predicate, convert to clause form and prove
By resolution “India wins the match”.