Artificial Intelligence - December 2016

MU Computer Engineering (Semester 7)

Total marks: --
Total time: -- INSTRUCTIONS
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary

Solve any four questionQ.1(a,b,c,d,e)

1(b) Define heuristic function. Give an example heuristics function for 8-puzzle problem. Find the heuristics value for a particular state of the Blocks World Problem. 5 marks

1(c) Comapare and Contrast problem solving agent and planning agent. 5 marks

1(d) What are the problems/frustrations that occur in hill climbing technique? IIIustrate with an example. 5 marks

1(e) Represent the following statement into FOPL.
i) Every tree in which any aquatic bird sleeps is beside some lake.
ii) People try to assassinate rulers they are not loyal to. 5 marks

2(a) Consider the given instance of 8-puzzle.
!mage Compare and contrast uninformed search strategies with respect to solving 8-puzzle problem. 5 marks

2(b) Draw and describe the architecture of goal based agent. 5 marks

2(c) Convert the following propositional logic statementinto CNF (A↔B)→C 5 marks

3(a)(i) The law says that it is a crime for an American to sell weapons to hostile nations. The country Nono, an enemy of America, has some missiles, and all of its missiles were sold to it by Colonel West, who is and American.
i) Represent the above sentences in first order predicate logic(FOPL) 5 marks

3(a)(ii) Convert them to clause from. 5 marks

3(a)(iii) Prove that "West is Criminal" using resolution technique 5 marks

3(b) What are the basic building blocks of Learning Agent? Explain each of them with a neat block diagram. 5 marks

4(a) Apply alpha-Beta pruning on following example considering first node as MAX
!mage 5 marks

4(b) Draw general archirtectural diagram of Expert system. Explain every component in detail of this block with an example. 5 marks

5(a) Give the initial state, goal test, successor function, and cost function for the travelling salesperson proble(TSP). There is a map involving N cities some of which are connected by roads. The aim is to find the shortest tour that starts from a city, visits all the cities exactly once and comes back to the starting city. 5 marks

5(b) Prove the admissibility of A* 5 marks

5(c) Explain a partial order planner with an example. 5 marks

6(a) Given a full 4-gallon jug and an empty 3-gallon jug, the goal is to fill the 4-gallon jug with exactly 2-gallons of water. Give state space representation. 5 marks

6(b) The gauge reading at a nuclear power station shows high values if the temperature of the core goes very high. The gauge also shows high value if the gauge is faulty. A high reading in the gauge sets an alarm off. The alarm can also go off if it is faulty. The probability of faulty instruments is low in a nuclear power plant.
i) Draw the Bayesian Belief Network for the above situation
ii) Associate a conditional probability table for each node. 5 marks