Trending ▼   ResFinder  

2003 Course Artificial Intelligence

2 pages, 24 questions, 0 questions with responses, 0 total responses,    0    0
pune_eng
  
+Fave Message
 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 : 2 [3864]-254 P1306 B.E. (Electronics) ARTIFICIAL INTELLIGENCE (2003 Course) Time : 3 Hours] [Max. Marks :100 Instructions to the candidates: 1) Answer 3 questions from Section I and 3 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) Use of logarithmic tables, slide rule, Mollier charts, electronic pocket calculator and steam tables is allowed. 5) Assume suitable data, if necessary. SECTION - I Q1) a) b) Q2) a) b) Q3) a) b) Q4) a) b) Q5) a) b) Define the term Artificial Intelligence . Explain any two applications of it in detail. [9] What are weak search methods. Explain the hill climbing search method in detail. [9] OR How state space representation can be used for a water jug problem with respect to seven problem characteristics. [9] Explain A * algorithm with suitable example [9] What is predicate logic. Explain the procedure to convert formulas into clause form. [8] With suitable example, explain how, simple facts are represented in logic. What are different ways to represent a class membership. [8] OR Write short note on secondary search. [8] Explain Minimax search procedure. How the performance of the minimax procedure can be further improved. [8] What is conceptual dependency. How it is used to represent knowledge.[8] Explain how frames can be used for knowledge representation. Give an example. [8] P.T.O. Q6) a) b) OR What is meant by non-monotonic reasoning. Differentiate between statistical reasoning and probabilistic reasoning. [8] Explain how semantic nets are used for representing knowledge taking suitable example and what are conventions used. [8] SECTION - II Q7) a) b) Q8) a) b) Q9) a) b) Q10)a) b) Q11)a) b) Q12)a) b) Explain in detail how hard problem is solved using a goal stack planning. [9] What are the components of a planning system. Explain these components in detail with the example of blocks world. [9] OR What is nonlinear planning. What are the steps involved in the nonlinear planning algorithm. [9] Discuss hierarchical planning with suitable example. What are reactive systems. [9] Explain in detail how the robots navigate through the world and manipulate objects. [8] Draw and explain the architecture of image understanding. How the low level and high level knowledge is used to interpret an image. [8] OR What are the advantages of Artificial Neural Networks. With suitable [8] example explain the various applications of these N/WS. State the detailed steps of waltz algorithm for labeling. Give an example for which the waltz algorithm would not find unique labeling. [8] What is semantic analysis. With suitable example explain the conceptual parsing which uses conceptual dependency structures. [8] [8] Write short note on a finite state machine. OR Draw a schematic diagram showing the various functional elements of an expert system. Explain the functions of each of them. [8] Write a short note on Augmented Transistion Networks (ATN). How is it used for natural language understanding. [8] E [3864]-254 E 2 E

Formatting page ...

 

  Print intermediate debugging step

Show debugging info


 


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  

© 2010 - 2025 ResPaper. Terms of ServiceContact Us Advertise with us

 

pune_eng chat