ai q1. attempt any four

9
CSE VI SEM AI Q1. Attempt Any Four

Upload: ziddirazan

Post on 16-Nov-2014

452 views

Category:

Documents


1 download

TRANSCRIPT

Page 1: AI Q1. Attempt Any Four

CSE VI SEMAI

Q1. Attempt Any Four

Page 2: AI Q1. Attempt Any Four

Q2. Attempt Any Two

Q3.Attempt any Two

Page 3: AI Q1. Attempt Any Four

Q4. Attempt any Two

Q5. Attempt Any Two

Q6. Attempt any Four

Page 4: AI Q1. Attempt Any Four

Q7.Attempt any Two

Q8.Attempt any Two

Q9.Attempt any Two

(c) Q10.Attempt Any Two

Q11. Attempt Any Three (a) What are the various domains of AI?

(b) What are the requirements of intelligent agents (c) How does hill climbing ensure greedy local search? What are the problems of hill climbing? (d) Describe in brief the depth first search.

Q12. Attempt any Four (a) Examples of decomposable and non-decomposable problems

(b) Means-End Analysis for problem solving. (c) Non monotonic reasoning

(d) Hierarchical planning. (e) Expert System shells. (f) Advantages of depth-first search

Page 5: AI Q1. Attempt Any Four

Q13. Attempt Any Four

(a) What is Artificial Intelligence. Explain how an AI system is different from a conventional computing System.

(b) Distinguish between data, information and knowledge. Present an overview of knowledge representation methods.

(c) What are the different steps to solve an AI problem. Explain.(d) What is a production system? Explain with an example(e) Assume the facts

Steve only likes easy coursesScience courses are hard.All courses in the arts Department are easy.TL 301 is an arts department course.Use resolution to answer the question which course would Steve like?

Q14. Attempt any Four(a) What is a partitioned semantic net? Construct a partitioned semantic net for the

following statements?(i) The dog bit the mail carrier.(ii) Every dog has bitten every mail cairier

(b) Describe the constructs of Frame & Scripts(c) Illustrate the sterpesh-ascent hill climbing technique in detail(d) Apply constraint satisfaction algorithm to a Crypt arithmetic problem(e) Derive the parse tree for the following sentence by making use of an appropriate

grammar.Rama killed the demon.

Q15. Attempt any Four(a) With a block diagram. explain a simple model of an expert System architecture.(b) ) Explain the concept of case based reasoning(c) Differentiate Forward and Backward reasoning techniques(d) What is lhe purpose of case grammars ? Represent the following sentences using

case structure(i) The plane flew above the clouds(ii) The co-pilot flew the plane

(e) Transform the following statement into disjunctive normal form(i) ~(P&Q) & (PvQ)(ii) -(Pv~Q) & (R -> S)

Q16. Attempt any four(a) Given the following information in a database A1: if x is on top of y, y supports x A2: if x is above y, and they are touching each other, x is on top of y A3: A cup is above a book A4: A cup is touching a book

(i) Translate statements A1 through A4 in clausal form(ii) Show that the predicate supports (book, cup) is true using resolution

(b) Differentiate between uninformed and informed search(c) Develop a rule-base using PROLOG for the following relationships

Mother-in-lawDaughter-in-law

Page 6: AI Q1. Attempt Any Four

(d) Machines can be made intelligent artificially but ultimately persons make the machines. So who is more intelligent - the artificial machine or the person ? Discuss

(e)Describe the Minimax Algorithm for searching game treesQ17. Attempt any four

(a) Explain how the Alpha-Beta Algorithm is a better way to search game trees

(b) Consider the following game tree, and assume that the first player is the maximising player:

(i) Which move should the first player choose (ii) Assuming that nodes are searched left-to-right using the alpha-beta algorithm, which nodes would not be examined (c) Describe the way in which a problem should be represented in order to allow its solution using a heuristic search technique (d) Define what it means for a heuristic function to be admissible, and to be monotonic

(e)Describe the operation of the A* heuristic search algorithm

Q18.Attempt Any four (a) Prove that the A* heuristic search algorithm is optimal when applied in conjunction with a monotonic heuristic. State the conditions under which

the algorithm is also complete, and explain why this is the case

(b) Solve the following problem using constraint satisfaction.

TRUE+ FACT----------FALSE

(c) Write the sequence in AO* algorithm. [(d) Consider the statement,” The person who had assassinated the ruler

may be Baldvin or any person who intensely hated the ruler.” Showhow do we apply wff rules to convert the above statement into clauseform.

(e) Write a script for Bank RobberyQ19. Attempt Any Four (a) Give conceptual dependency representation for the following statements, (i)Meera is a good writer. (ii)He stabbed the boss using dagger.

Page 7: AI Q1. Attempt Any Four

(iii)I heard the barking of a dog. (iv)Leena handed over the tip to the writer (b) Explain various steps in NLP. (c) Write Waltz’s algorithm.Explain with example (d) Draw an ATN which should accept typical interrogative sentences in English (e) Explain the characteristics of an AI techniqueQ20. Attempt any Four

(a) Explain the role of state space approach in solving AI problem(b) . With suitable examples, explain the steps needed to convert a WFF in

predicate logic to its equivalent clause form.(c) Derive a parse tree for the sentence “RAM hated the Loin” where he

following rules are used:

S - > NP VPNP - > NNP - > DET NVP - > V NPDET - > theV - > HatesN - > Ram | loin

(d) What is an inference engine in an expert system? What are the various functions of an inference engine? Explain this with context to MYCIN.

(e) Use semantic net to represent the following fact.

“Every dog has bitten the postman”Q21. Attempt Any Two (a) How Pattern are Recognized? Explain With the help of block diagram.

(b) Explain syntactic pattern recognition with suitable Example.(c) Describe symbolic Description in Pattern Recognition

Q22. Short Note On Any Four(a) Machine perception(b) Line finding(c) Interception Semantic and model(d) Object Identification(e) Speech Recognition

Q23. Short Note on Any four(a) Horn clause(b) Self Explaining System(c) Program structure of PROLOG(d) LISP(e) Solution Guaranteed algorithms