Question Paper: Intelligent Systems Question Paper - May 17 - Information Technology (Semester 7) - Mumbai University (MU)

Intelligent Systems - May 17

Information Technology (Semester 7)

Total marks: 80
Total time: 3 Hours
(1) Question No. 1 is compulsory.
(2) Attempt any three from remaining five questions.

1(a) Explain forward chaining.
(4 marks) 00

1(b) Explain steps in state space search formulation.
(4 marks) 1562

1(c) Discuss Heuristic function using suitable example.
(4 marks) 1542

1(d) Explain goal based agent with diagram.
(4 marks) 1606

1(e) Explain in brief Expert System Shell.
(4 marks) 1592

2(a) You have two neighbors, John and Mary, who have promised to call you at work when they hear the alarm. John always calls when he hears the alarm, but sometimes confuses the telephone ringing with the alarm and calls then, too. Mary on the other hand, likes rather loud music and sometimes misses the alarm altogether. Given the evidence of who has or has not called, we would like to estimate the probability of a burglary.
Draw a Bayesian network for this domain with suitable probability tables.

(10 marks) 00

2(b) Describe Hill climbing Algorithm. What are its limitations?
(10 marks) 1543

3(a) Represent the following sentences in First Order Logic:

  • i) Every gardener likes the sun.
  • ii) You can fool some of the people all of the time.
  • iii) All purple mushrooms are poisonous.
  • iv) Every student who takes French passes it.
  • v) No person buys an expensive policy.

(10 marks) 00

3(b) What is prolog? Write Prolog program for generating Fibonacci series.
(10 marks) 1559

4(a) Compare and contrast BFS & DFS. And explain the search strategy developed to overcome the drawbacks of both.
(10 marks) 1541

4(b) Explain Learning Agent with diagram. Also explain inductive learning.
(10 marks) 1580 1581

5(a) Explain WUMPUS world with diagram. State PEAS descriptors for it.
(10 marks) 1554

5(b) Explain Min max and Alpha beta pruning algorithms for adversarial search with example.
(10 marks) 00

Q6) Write short notes on (Any Four)

  • a) Game Playing 1550

  • b) A* algorithm 1546

  • c) Partial Order planning 1564

  • d) Supervised and unsupervised learning 1582 1583

  • e) Predicate Logic. 1556

(20 marks) 00

modified 6 months ago by gravatar for Sanket Shingote Sanket Shingote ♦♦ 250 written 7 months ago by gravatar for Yashbeer Yashbeer ♦♦ 130
Please log in to add an answer.