‘This question paper contains 4 printed pages} ! rowro. (1 TI Lineis) rT S.No, of Question Paper: 1491 i = Unique Paper Code 2341701, Ey me |Nameorthe Course B.Tech, Computer Science Semester vn ‘Maximum Marks: 75 Duration :3 Hours (rite your Roll No. on the top immediately on recelpt of this question paper) Question No. Lis compulsory Atempt any four from Question Nos. 2 to 7, CLL. Parts of @ question must be answered together. ' 1 @)_ Define an Agent, Agent Function and an Agent Program, 3 (0) Differentiate between knowledge-based systems and expert systems, 4 (© Why is state space representation ‘important ? 2 irst or Breadth-first ? Justify your answer. 2 (@) 1s minimax procedure Depth rel : 4) Is the following set unifiable ? If yes, obtain a most general unifier for it + 3 , W = (PA, B, B), POX. ¥, 2} ()_ Glrain Skolem standard form for the following : 3 E= ax[P(r(a)) a(s./(2)) Ok be | Scanned with CamScannerGe bay ~ int fon measure foam agent , Ge) Explain wtlty fone . ‘ (i) Discuss special eases of ill climbing : Local Maximum, Plateau and Ridge 7] as conceptual depshdeney stectures 4 (@ Express the following sentences {9 _ Bill is a programmer - (i) Joe gave Sue a flower ferences between seripts and frame structure ? What are the main d @ ‘A 3efeot tall monkey is in a room, where some bananas are suspended froin 8-feet ing. The room contains (wo stackable, movable and climbable 3-feet high high cei crates, Give the intial state, goal state, successor funtion and cost function for getting, 4 ; the bananas, ‘ wr Let h’ denote the estimate of h (the actual cost of traversing from the current node to ao a final state node). Explain in what way the efficieney of A* algorithm and reaching of 5 1 goal state is affected if 6 @ _ b alwways underestimates h. (@_W always overestimates h. £8) Consider a state space where the start space #8 number 1, and the successor function for a slate n reiums two states numbered 2n and bn + 1 4 (Draw the portion of state space for states 1 to 15. 4. Suppose the goal state is 11. List the order in which nodes will be visited for breadth — first search. &y @) Explain Cut, Fail and Cut-fail statements in PROLO! (®) Write @ PROLOG program to find GCD of two numbers, a4 . t Scanned with CamScanner' oa 1491 a) Explain Yur ‘Agent approach ? ) Develop PEAS description of the task environment for — agent S*(@) Using constraint satisfaction algorithm, sbve the following crypt arithmetic problem: 6 opp *onD | EVEN @) A game tree is as follows : Which nodes would not e examined using alpha-betw pruning procedure ° Write a stepwise explanation, ©) Diseuss the differences and similarities benwveen problem solving and planning, 3 PTO, ST Scanned with CamScanner(eee lor Consider the follo ing block worid problem and sve it using goal stack planning : 5 x () Consider wi Start i c B i AT] BI 4 c ° y ‘ —-1_ ; ON(C, A) ON(B, C) and ON(A, B) i 7 (@_ Consider the following piece of knowledge 6 Some patients like all doctofS. No patient like any quack. () Repiesent this knowledge as predicate statements, (i Prove the query “no doctor is a quack” is correct, using resolution method, (8) Derive a parse tree for the sentence “Mary slept on the chair using the. following rules : “ 4 S— NP vp NP + N. NP > DI N . VP V pp PP > PERT NP | “N > Mary/Chait V > Slept DET + the PERP ~» on 1491 2,500 te Scanned with CamScanner= 1. 7 : 5. his question paper comuains 5 printed pages.] 1807 Your Roll No. B.Sc. (H) Cothputer Science / VISem. A Paper ~ 605 (i) : ARTIFICIAL INTELLIGENCE (Admissidns of 2001 and onwards) Time » 3 Hours Maximum Marks : 75 ee (Write your Roll No. on the top immediatel on receipt of this question paper) ’ Attempt all questions. All parts of a question must be answered together. (a) What do you understand by heuristic search? How heuristics sqarch is used in AI problem solving. 3 (b) Give an example where Best First search is better than Breadth search. : 4 (©) Why is it important that an expert system be able to explain athe why and how questions related to a problem solving session? 4 (d) What is unsupervised learning? Describe how supervised learning can be used for pattern recognition. 4 (PTO. ang: ey sone: Scanned with CamScanner1807 2. (a) Find the errors in the following LISP statements and give the output in case there is no error. @ > (istp’e2) | (ii) ->(lessp 6729 3) (iii) >(@ppend ‘a ‘(e g)) 3 (&) Write an iterative function ip LISP name SUM- ALL using ‘do’ statement that takes an integer N as argument and returns the sum of the integers from 1 to N. 4 (©) Prove that if A and B are two independent events then P(A) (B) = P(A). +3 Jetermine whether each of the following sentence * is: ° 4 ¢ (i) Satisfiable | . (ii) Contradictory (iii). Valid | S1:P3Q3~P: S2: (p&q)V~ (P&Q) 83: (pVq) (P&Q) 84: pVq & ~pV~O & P L Scanned with CamScanner ay J of De pad ) wae — |o » “we 1807 (b) (b) (a) (b) Comment on the following statements giving justifications for your answers: 443 (i) At always guarantee an optimal solution for a minimization problem (it) AGF algorithm ensures that it does not get stuck into an infinite loop while generating successors in a graph Solve the given crypt-arithmetic problem using constraint fatisfaction. 5 TWO +TWO FOUR Explain any two situations where a Hill climbing algorithm may fail to find a solution, How can we deal with these situations? 5 Transform the following formula to clausal form: vxwyQ zP(x, 2) & Ply, 2)) 73 v QA ¥,¥) 3 Translate the following sentences into clausal form and use resolution technique to draw the required inference, 3 $1: Some phtients like all doctors. $2: No patient likes any quack. Conclusion: Therefore. 3 (PTO rE mua Rank nhs Scanned with CamScanner(c) Given the joint distribution of x, X32 Xzx Xq> X52 and x, as @ product of the chain conditional probabilities as: Py, os Ng) = POS | Xj, Xp, X3) PU%G 1 Xp %4 POX )PC%al X1) POSIBE) 4 Provide the causal network to represent the above + = » joint distribution 2 Jad 6. (@) Transform the following sentences into conceptual ? graph 242 Gi) Charlie drove the pickup fast. (i) Sam gave Mary a box of candy. “P ae (b) Create a movie script using the script syntax. The soript must be named and specify the track, roles, * entry conditions, props, different scenes and the * results. The script should describe the scenes for ~ movie ticket purchase and entry of the buyer in the movie hall. 6 a 7. @)__ Consider the following assertions written in Modal poly logic for the given knowledgelbase : 4 S1 : (Sam is a man) $2: M(Sam is a child). ‘ $3 : L{(Gam is a child)->L ~ (Sam is a child)) S4:1{(Sam is a man) + (Sarh is a child)} | 1807 4 Scanned with CamScannerUse Modal logic axioms and prove that : ~ (Sam is, a child), (0) Given the following parse tree, write down the 24 corresponding context free grammar. s. silly robot moved a PREP NP DET A ff | \ DET ADJ N 7 the red pyramid | to the big table Also draw an Augmented Transition Network to implement the grammar for the parse tree. | 1807 Scanned with CamScannerThis que. SHON paper coniainy 4-2 printed pages) Your Roll No. 1959 Se. Hons.) Computer Scigace/VS Sem. c Paper 605 (i) ARTIFICIAL INTELLIGENCE (Admissjons of 2001 to 2010) > Time 3 Haury Maximum Marks + 75 “Wrue your Rall Nor onthe top immediately on receipt of this question paper.) & ~ - All questions in Section A are compulsory. ~~» Attempt any four questions in Section B. ~~ Section A => 1 (a) When do you call a machine imelligent ° Name the criteria used for determining whether a machine is inte- D>. Higent or not? 142 2S . , (b) Explain the physical symbol system hypothesis 2 3 5 (c) Differentiate Depth first search and Best firs 5 the help of an example. 5 P.T.O. ? BUNK n inate Scanned with CamScannergiven below inte conceptual (i Express the se dependency siructure 4 (i Sushil ate soup with 2 spoon (it Rita gave Sita a bunch of Nowers. (a) Write the output of the following LISP statements : 4 ()— cadadr (a (be) d) (4) reverse:“atb ¢ (d)) e 1) (iit) member ‘'e (a (b (e))d ©) (iv) (lessp 22 44 179 20) | (6) Transform the follo, (ce) Draw a pictorial definition for the ti istic variable AGE. Biving Your own subjective values for AGE variables and their values, | Scanned with CamScannerSun (ay nC) (b) (a) (a) oga 1959 | Write a recursive LISP fangtion to find the nth term of o Libonacei series, where the number 1 is to be passed 4 aS an argument te a function, & Give the cons-cell representation of the following list 6 fa (b te) (d ter fg hy i Gd). ! Scetion Describe the various problems associated with Hill climbing method and explain them. 6 Write a short note’ on Neural Network Architecture: 4 How many types of non-deductive inference are there ? Explain 4 Give an example of non-monotonic reasoning and deseribe it also. 3 Develop a parse tée for the sentence “Raja slept on the 3 sofa” Scanned with CamScannerpee i959 far woing 10 a movies 4 6 tay Write at seript For going 10-8 movil thy Describe the admissibility condition for the A* algorithm, In what situations A* will give an optimal solution ? ce appropriate examples. 2122 (a) ©. Consider the following axiom : as (i) Every boy or girl is a child i) Every child gots & dol or a train or a lump of cual. (iii) No body gets any doll (iv) No child who is good gets any lump of coal. } (Conclusion) If no child gets a train, then no boy is good | Prove ig ove that given conclusion using resolution . ° 7 technique Scanned with CamScanner8 (a) > - ro) 5 ) vs Define the sentences $1, $2 and $3. $1 2. $2 > Q and ' P - Q, Detennine the probabilistic ruth values of SI, S2 and $3 when it is known that probabilities of the possible words are given by 2 PAWL) bd POW2) LB, P(W3) 4 & and P(WA) = 12. Define a prodpetion system. What type of production thesis system is appropriate for designing & chemicaf problem and why ? 243 ‘Vransform the following into dausal form : 3 | 2x Vy(Wz PMs). yy 2)) -9 Bu Q(x, u) & AVRLy, w)). ein Scanned with CamScanner6 Write short notes on the followin, iat Uninformed Search tA Heuristic Search (2) Mean End Analysis td). Resolution Principle. 1959 10 Scanned with CamScanner