
	Trending ▼ ICSE CBSE 10th ISC CBSE 12th CTET GATE UGC NET Vestibulares ResFinder

2003 Course Artificial Intelligence

3 pages, 34 questions, 0 questions with responses, 0 total responses,

	pune_eng	+Fave Message
	Profile Timeline Uploads Q & A

Home > pune_eng >

Instantly get Model Answers to questions on this ResPaper. Try now!
NEW ResPaper Exclusive!

Formatting page ...

Total No. of Questions : 12] [Total No. of Pages : 3 [3864] - 407 P 1103 B.E. (Computer Engg.) ARTIFICIAL INTELLIGENCE (2003 Course) (410445) Time : 3 Hours] [Max. Marks : 100 Instructions to the candidates: 1) Attempt three questions from Section I and three questions from Section II. 2) Answers to the two sections should be written in separate books. 3) Neat diagrams must be drawn wherever necessary. 4) Assume suitable data, if necessary. SECTION - I Q1) a) b) What is Logic programming? Explain backward and forward reasoning with an example. List the applications of Artificial Intelligence. [8] List and explain the seven characteristics of problems in AI. For any of the two problems, list out the problem characteristics : [8] i) Chess. ii) Water Jug. iii) 8 Tile Sliding Puzzle. iv) Travelling Salesman. OR Q2) a) b) Q3) a) b) What are intelligent agents? Explain the architecture of a typical agent and give at least two examples where agents are used. [8] For the following problem have a state space representation and show how the farmer got everything across the river. A farmer wants to cross the river along with the fox, goat and cabbage. The boat has a capacity to carry a person and either of the three accompanying him. The fox-goat or goat-cabbage combination if left unattended may cause the problem of being eaten by the other. Taking these constraints into account, use a state space approach and solve the problem. [8] Define Heuristics. Define a heuristic for 8 Sliding Tile puzzle problem and explain the A* algorithm to solve the problem. [10] Apply constraint satisfaction method to solve the following crypt arithmetic problem : [8] TWO + TWO = FOUR OR P.T.O. Q4) a) b) Explain Hill Climbing algorithm. Explain plateau, ridge, local maxima and global maxima. [8] Explain alpha beta cut off for the following example and show which nodes are cut off and solve considering A is maximizing node. [10] A C B D (2) E (5) F I G H (4) J KL (6) (8) (9) MN ( 1) (8) Q5) a) b) Consider the following sentences and translate the sentences into formulas in predicate logic and clause form. Prove John likes Peanuts using resolution. [8] John likes all kinds of food. Apples are food. Chicken is food. Anything anyone eats and isn t killed by is food. Bill eats peanuts and is still alive. Sue eats anything Bill eats. Write a script of going to a multiplex to watch a movie. [8] OR Q6) a) b) Represent the following in semantic networks : [8] A collage has a department Computer Engineering and Ravi is the head of the department. Varsha and Ruma are staff members of the department. Varsha is married to Ajay. Ajay is a Software Programmer. They have two children and they live on MG Road. Varsha wears glasses and is 5 feet 3 inches tall. Represent the following sentences in conceptual dependency : [8] i) Bird flew. ii) Joe ate some soup with a spoon. iii) Jane gave Tom an ice cream cone. iv) Charlie drove the pickup fast. [3864] - 407 -2- SECTION - II Q7) a) b) Describe any of the two learning methods : [8] i) Rote Learning. ii) By taking advice. iii) By parameter adjustment. iv) Learning from example. Consider the following representation of block world : [10] Start : ON (C, A) ^ ONTABLE (A) ^ ONTABLE (B) Goal : ON (A, B) ^ ON (B, C) ^ ONTABLE (C) Show how STRIPS (Goal Stack Planning) will solve this problem. OR Q8) a) b) Q9) a) b) Explain Waltz s algorithm with an example. Comment on the limitations of Waltz algorithm. [8] Consider the following representation of block world : [10] Start : ON (A, B) ^ ON (C, D) ^ ONTABLE (D) ^ ONTABLE (B) Goal : ON (C, B) ^ ON (D, A) ^ ONTABLE (B) ^ ONTABLE (A) Show how TWEAK (Non-Linear Planning) will solve this problem. Explain in brief the various steps in natural language processing. Give the grammar and show the parse tree for i) John wanted to go to the movie with Sally. ii) Print the file on the printer. [8] [8] OR Q10)a) b) Explain the Robot architecture. [8] Explain an ATN with an example, Trace it for a sentence The long file has printed . [8] Q11)a) Give detailed architecture of Expert System and explain its components. [8] Explain in details artificial neural network architecture. [8] b) OR Q12)a) b) Give any two applications of neural network. [8] Explain the characteristics of Expert Systems and explain the expert systems ELIZA & MYCIN. [8] [3864] - 407 -3-

Formatting page ...

Tags : Pune, Engineering, University of Pune, Engineering question papers, Pune University, previous year question papers, question papers, india, model question paper, pune university paper pattern, pune university syllabus, old question papers

pune_eng chat

Horizontal lines at:
Guest Horizontal lines at:
AutoRM Data:
Box geometries: