(lease write your Exam Rott Noy Roll Ni First Term Examination 30 hrs February 2017 Paper Code: ETCS.319 Max Marks: 30 ' Subject: Artificial Note: Attempt any three questo, neluding Q.No. 1 which is com (elligence Qn. ory. 8) How many categories do intelligent System all int? ‘Bricfly explain their horizon too? ) Explain knowledge based system in coment of Artifical Intelligence 6), Mite the pseudocode program for Model Based Renan Agent 4) Construct the truth table for = A. v0) = (PVR) (RV Q)) 2 Fela Yow mean by fis and bound varible?Idcity fc and Bound variable the following wit YS GY PG, 1A Vx (QO) V ROW) =e, 9) 4) Slt problem of snp hous tt ming ek fm ony OF ia ean ear paknmk om USH, CARRY, WAL, PICKUPSPUTDOWN HALE Wy Discontent on ar Sec xing wit ne — 6 @, (5) ee enema) oR) (TQ Prowe tha Ris te by Reston wr bb) Diferennate between propasitional logic and Fist onder logic withthe hep or enn “ atisfaction procesure for soli the flowing exyptarihinc a) Trace te const Probe FOUR + MICE FOUND w ty a et ig an one oe ed en the casinos are clooked, then the tourist teade will decline IF the ae a czech tpl wil bc apy The pag meade dete. hh Therefore te races ever be happy a(Pease write Your Exam Roll No) QNe.2 Nes Not a ») Exam Roll No-.. MID TERM EXAMINATION SIXTH SEMESTER [B.TECIL| FEB-2019 Sie: aici ae pa tat Mark: 90 Ae Tite queon ince Na which compat Mow do You define Aric nteigence in terms ofits ask domain? Hw production system useul for solving Al problems? dom ro7SHE required forthe representation of kiowledgeina particular domain? ‘Abrwblem- solving search can proceed either forward or backward What {aetors determine the choice of direction fora particular peeblene esxay Whats AU? How do you compare hunan intelligence wth atic intligence? 5) ow do you define the characteristics of Problem. foe the selon thats tied me crurstances under whichthe Slaton must take pes} Consider trying to solve the pea using hl climb ins, Can you ind a heuristic Sunetion that makes this work? Make sure orks onthe folowing example 2/3 ff al Show tha hoe means nds anys cole set salve the pra ing from one pace to another. Assume tha Sipe tke the take cop aed ‘heavatlale operators ae walk, 1) Assume the following fics: them ones ean cures J Allcourses m Htumanitis are easy Use resolution ta ane the ston “What rouse wall Mahe iy st(Please Write your Rall No. mmediately) Koll oll No Mid-Term Examination B.Tech — VI Semester April, 202 Subject — Artificial Intelligence Max Mart s: 30 QNo. Tis Compulsory. Attempt any tno more Question frovs the rest. (2°5°10 marks) Miate Propositional logic and FOPL with ¢ nuple 6.) What ts PEAS? Specify PEAS for an Aerospace System. ©) Obtain disjunctive normal form of PYCPS (av qe 1) > 41 Explain Turing Test, Why Turing Test was eritivised ani! als» explain Chinese room Argument Test. ©) Dilferentiate OR graph and AND-OR graph (92.31) Whit ts heuristic search? Explain Hill Climbing and its lr b.) Explain erative Deepening Depth F (5 marks) 1 Search with example, (5 marks) Q3. a4) Represent the following facts in FOPL: (S marks) 1) All men are mortal 1) Some pet dogs are dangerous 1.) All basketball players are tall 18.) Lapton is a tea Seu ws are sick today ploy: by Cigck the validity of fullowing argument: S marks) ‘o> 161 vet the job and work hard, then L will yet promoted IF yet promoted, then | will be pps. Lill not be happy. Therefore, either I will not get the job or [vill not work hae! H Satistiv tien proved O43.) Solve following cryptographic puzzle using Constr FOUR MICE ‘OUND aL) Discuss forward and backward chaining with suitable example (S marks)di cs (Please write your Exam Ro Na Bam Rll Ne MID TERM EXAMINATION SINSTUSEMESTERC RTECHL Eein200 [Pier Cove: E1319 —— — Sabi: Ait tigeace ~] Fime: 130 Hours Maxima Marks: 30 ARNON Tee gens tg ON ne nN GNGT 9) Whats hears astm? ie an example 5) What acecommon Al tecnigss used inal apleation domain? <1 ftat approaches quired forthe representation of awa domain” (0) Stes an application domain where backward chaning sual? QNaz » alo 1g? FOr the agent water ug date Space destpton ‘s} Lupin to solve paca using hil big. Can you ind a hour ome Gergana Make sure rks onthe flowin scampi Tz] pizs} : fetste; prise bi , the misao cli se tthe problem ot Get ST Sita bene ‘onthe Eola tng roman pce ‘s ‘he quests "What sos et Mahan tbea . slr (ease write your Exam Roll No. alt No, First Term Examination er 1B, ‘Siath Semester (B-TECH| sum ae ‘Time: 1:30 rs Max Marks: 30 Paper Code: ETCS-310 Subject: Artificial tntetigence Note: Attempt any thres question including Q4No, {which ie compalsry on exs) 2 Refine) Inteligence Anil nelience <) Agent d) Logical Reasoning. ) What do you mean by PEAS? Specify PEAS for Medial diagnos rants «Differentiate berween Declarative and procedural Knowle wth example 1) Formulate Predicate logic statment for “All cats ike fh cats eat enenthing they like and Tom isa eat” Does Tom eat ish? ©), What isa Skotem funtion? Espn with example on 8) What do you mean by Hill Climbing search technique? What ae various probe eneoumtered ia i? o 1) Write an algo For Bes First Search algo. ° oo 4) Consider the following axiom: iL Anyone whom Mary iss football ta. ii ‘Any student who doesn't pass doesat ply. John isa student who does at tly doesn't pass “Anyone who doesnt play not footal star Prove tha i Joh doesnt study, dhe Mary dose Iikes Joh, 1) Diteremiate between forward chaining ard backward chaining with the help of| o 0 example (04.8) Trace the constraint stisfction procedure fo saving the following eptarthmetie Problews BROWN + YELLOW purple a 1b What athe properties oppositional clea, explain with example. oFfererP tety FIRST TERM EXAMINATION SIXTH SEMESTER B-TECILtetrony 2018) “Paper Code: ETCS-310(CSEAT) Toe lod 12 Hour wot ‘Note Question No.1 company, Ate any 2 quo fom te et 3) Wi: PEAS dscns for Mail Dios Syste, ») Whats sews htm? Explamitcoopasne 8) Conrare heme comply of res tse and eve hn 4) Give examples of Decomposable and Predicts ene ee table problems | &) Diflereniate between OR graph and AND-OR graph axs-r0 (QQ. 8) Wht are the problems of Hill Clsibing algorithm? tn what ways they cam be del wt 1) >) Wine the algorithm of Means Ends Analysis ia 6) Describe Leaming Agent i 5. 8) Eaplan differences berween Propositional logic and Fist omer predicate logic. D)Show the backward cost propagation of AO® sig ofthe following graph if the cos of ‘ode D changed fom 8 10 3 now. aloo fe]o o teense etre mcrae oe ee Cane ee gy whuepepointn Bs 1 (05s) Trace the Constraint Satsiction procedure solving the following rypto arithmetic problem. save TREE SAAR a 1) Consider the flowing sateent ‘y xevz a neal Sy 1) Ries al seal 2 vy ampene wo WheSYLLABUS ARTIFICIAL INTELLIGENCE SIXTH SEMESTER Applicable from the Academic Session 2023-24 | Discipline(sVEAB/OAE | Semester] Group _| Sub-group Paper Code CSEATICSTIT 6 PCE, PCE-3 CIE-374T ECE 6 PCE PCE-1 ECE-318T | ‘AUCSE-AIML 6 PC PC “ALBOZT EAE 6 AI-EAE AI-EAE-1 AI-302T EAE 6 AIML-EAE | AIML-EAE-1 AJ-302T Marking Scheme: 1. Teachers Continuous Evaluation: 25 marks 2. Term end Theory Examinations: 75 marks Instructions for paper setter: 1. There should be 9 questions in the term end examinations question paper. The first (*) question should be compulsory and eover the entire syllabus. This Question should be objective, single line answers or short answer type question of total 115 marks. 3. Apart from question 1 which is compulsory, rest of the paper shall consist of 4 units fs per the syllabus, Every unit shall have two questions covering the corresponding tunit of the syllabus. However, the student shall be asked to attempt only one of the two questions in the unit. Individual questions may contain upto 5 sub-parts/sub-questions. Each Unit shall have a marks weightage of 15. UNITI ‘AI Definition, Problems, Techniques, Models, Defining Problem as a state space search, production system, Characteristics, Search methods and issues in the design of search problems. INo. of Hrs. 10] UNIT It Knowledge representation issues, mapping, frame problem. Predicate logic, facts in Jogic, representing instance and Isa relationship, Resolution, procedural and declarative Knowledge, matching, control knowledge. Symbolic reasoning under uncertainty, Non monotonic reasoning, statistical reasoning. UNIT (No. of Hrs. 10] Game Playing, minimax search, Alfa beta cut-ofls, Natural Language Processing, Learning, Explanation-based learning, discovery, analogy, Neural net learning and Genetic Learning, INo. of Hrs. 1 jo. of Hrs. 10) UNIT IV / Fuzzy logic systems, Perception Networks, Kem nd action, Expert system: Inference in Bayesian INo. of Hrs. 10] ins Clustering Algorithm, Machine learning,SYLLABUS (2016-17) ad erie ARTIFICIAL INTELLIGENCE (ETCS-310) Instructions to Paper Setters: Mi 1. Question No.1 should be compulsory and cover the entire syllabus. This question 8 have objective or short answer type questions. It should be 25 marks. hello i four units as per the syllabu, 2. Apart from Question No. 1, rest of the paper shall consists of four units as ps Every unit should have two questions. However, student may be asked to attempt only question from each unit. Each question should be of 12.6 marks. Objective: To learn the basies of designing intelligent agents that can solve general purpo, problems, represent and process knowledge, plan and act, reason under uncertainty and cq n from experiences shoul UNIT-I Introduction: Introduction to intelligent agents. Problem solving: Problem formulation, uninformed | search strategies, heuristics, inforn search strategies, constraint satisfaction. Solving problems by searching, state sp formulation, depth first and breadth first search, iterative deepening. {71, T2](No. of hrs. | ‘UNIT-I Logical Reasoning: Logical agents, propositional logic, inferences, first-order lo inferences in first order logie, forward chaining, backward chaining, unification, resolub [T1, T2}(No. of hrs. ‘UNIT Game Playing: Scope of Al-Games, theorem proving, natural language processing, vis snd speech processing, robotics, expert systems, AI techniques-search knowleé abstraction. [T1, T2}[No. of brs. UNIT-IV Learning from observations: Inductive learning, ee learning theory, Explanation based learning, earning decision trees, computa Applications: Environmental Science, Robotics, Aerospace, Medical Sciences ett 4 ences (T1, T2}{No. of hrs: New Toy Q.1. Wha Ans. Pro! task. It lays d essential contr * Itis als knowledge wh applied to any | knowledge dep Examples + Tying: performing spe This skill is usv + Riding to maintain bal practice and ex; * Operat procedures, suc’ skills are often | © Perforr perform surgery how to close wor Example The followin way: var 12 var b=(]; for(var i=0; i b.pushiali } console logtb Output 11,2,3,4,5) Q.2. What is Ans. Declar: certain task. It la only the knowled knowledge. Thus, declarative knowlNew Topics Added From Academic Session (2023-24) Onwards SIXTH SEMESTER [B.TECH] ARTIFICIAL INTELLIGENCE UNIT-T Q.1. What is Procedural Knowledge? PS ) - Procedural or imperative knowledge clarifies how to perform a certain Eee. s down the steps to perform. Thus, the procedural knowledge provides the aad MM: 7| essential control information required to implement the knowledge, Z ion shoul, * It is also known as imperative knowledge. * Procedural knowledge is a type of responsible for knowing how to do something. * It can be directly trategies, procedures, agendas, etc. * Procedural it can be applied, knowledge which syllabue applied to any task. # Itincludes rule: npt only knowledge depends on the task on whicl Examples + Tying shoelaces: This is a typical example of procedural knowledge. It involves performing specific movements with the fingers and hands to tie shoelaces in a knot, This skill is usually acquired through practice and repetition. | ‘+ Riding a bicycle: This involves the execution of several coordinated movements to maintain balance on a bieyele. People learn how to balance, steer, and pedal through practice and experience. + Operating a computer: Knowing how to use a computer involves a set of procedures, such as navigating through software and using keyboard shortcuts. These skills are often learned through experience and by following user manuals. + Performing surgery: Surgeons must have a wide range of procedural skills to perform surgery, including how to use surgical instruments, how to make incisions, and how to close wounds -der logi Example resolutio ‘The following example shows how to copy an array using JavaScript in a procedural fhrs.l way var a=[1, 2,3, 4,5 aa var bel); paaieda for(var i=0; i hy, P. University-[B.Techl-Akash Book 023-1 enee the * SyStem "and the Step 3: Construct knowledge base rules: Create a matrix of room temperature values versus target temperature values that an air conditioning system is expected to provide. RoomTemp. | Very Cold | Cold Warm Hot Very Hot MTarget | Very_Cold _| No_Change | Heat Heat Heat Heat [Cota Cool No_Change | Heat Heat Heat Warm Cool Cool No_Change | Heat Heat Hot Cool Cool Cool No_Change | Heat Very_Hot | Cool Cool Cool Cool No_Change Build a set of rules into the knowledge base in the form of IF-THEN-ELSE | structures. Sr.No.| Condition ‘Action ae 1 TF temperature = (Cold OR Very_Cold) AND | Heat target = Warm THEN 2. IF temperature=(Hot OR Very_Hot) AND Cool target = Warm THEN 3 IF (temperature=Warm) AND No_Change (target = Warm) THEN inpu : ae Step 4: Obtain fuzzy value: Fuzzy set operations perform evaluation of rules. The operations used for OR and AND are Max and Min respectively. Combine all results of evaluation to form a final result. This result is a fuzzy value. era Step 5: Perform defuzzification: Defuzzification is then performed according to membership function for output variable.Sixth Semester, Artificial Intelligence The key application areas ef fuzzy logic are as given. Automotive Systems © Automatic Gearboxes * Four-Wheel Steering * Vehicle environment control Consumer Electronic Goods ‘+ Hi-Fi Systems ¢ Photocopier Domestic Goods © Microwave Ovens * Refrigerators + Toaster: Machines Environment Control * Air Conditioners/Dryers/Heaters * Humidifiers Advantages of FLSs © Mathematical concepts within fuzzy reasoning are very simple. * You can modify a FLS by just adding or deleting rules due to flexibility of fuzzy logic. + Fuzzy logic Systems can take imprecise, distorted, noisy input information. * FLSsareeasy to construct and understand. * Fuzzy logicis a solution to complex problems in all fields of life, including medicine, as it resembles human reasoning and decision making. Disadvantages of FLSs © ‘There is no systematic approach to fuzzy system designing. * They are understandable only when simple. * They are suitable for the problems which do not need high accuracy. * Television '5 # Still and Video Cameras ‘5 ¢ Vacuum Cleaners * WashingFIRST TE . TRS ‘SIXTH eee MINATION IFEB. 2016) 7 SEMESTER [B.TEO ARTIPICIAL INTELLIGRNO ee ome RTH L INTELLIGENCE [ETc Notes Mlempt Qo. 1 which iscomputsory and Reasoning, Nel? Imeligence Gin Aric attigenee il Rent ny gen Ans. (a) Intelligence Avery general mental capabilit fee lsales the ality to vedson, plan, solve praen, thik ae hee capability for comprehend or “figuring out” what to do 310) M.M.: 30. n quickly and learn from experienes. I skill, or test-taking smarts. Rather, it reflects, broa He fone four strroundings—"eatehingon,”"makingseree nt eee Intelligence can be achieved by ) Deep Thinking (ii) Good Reasoning (ii) Le Ans. (ii) Artificial Intelligence: Artificial intelligence (AL) is an area of computer humans. Itis also a field of study which tries to make computers “smart”’The goal of Al research is to create computer programs that can learn, solve problems, and think logically. AI involves many different fields like computer science, mathematics, linguistics, psychology, neuroscience, and philosophy. : oR A field of computer science and engineering concerned with the computational understanding of what is commonly called intelligent behavior, and with the creation of artifacts that exhibit such behavior. Ans. (iii) Agent: An agent is anything that can be viewed as perceiving its ~ environment through sensors and acting upon that environment through effectors. For eg: Ahuman agent has eyes, ears, and other organs for sensors, and hands, legs, mouth, and other body parts for effectors. ing from past Experience sensors percepts environment actions actuators . i i ing: Itis why that concerns analysis o inten ann asec om Free t de pou understand by PEAS? Specity PEAS for medical ca for Performance measure Environment, Actuator, Sensors a - en eens Healthy patent minal ts, WSS « Environment: Patient, hospital, pharmacy, doctors, nurses, equip! i2.2016 ‘Sixth Semester, Artificial Intelligence + Actuators: Sereen display (questions, tests, di Keyboard (entry of symptoms, findings, pati jive knowledge and procedural ice with example : ive knowledge isa descriptive representation of knowledge. It tel ‘Ans. Deelara rk r vas facts what thing ave tisexpressed ina factual statement, such as “Thereis a positive ‘ssoiation between smocking and cancer” This type of knowledge is considered shallow, rlarative knowledge is ion that experts ean verbalize fr surface-tove fepectally important inthe intial stage of knowledge acquisition Procedural knowledge considers the mannerin which thing work uncer differ sete ofcfreumstanee, The following is an example: "Compute the ratio between the price Tithe ration anger than 1, cher the van ‘Srastire ante earings per : Sheet Tune procedural knowlege cues ste bt st'nstructions i may also inlaid explanations: PF for Allcats ike fish, oats eat sulomatie responses to stimol Q.1.(d) Formulate Predicate logic statement for All cs ng they like, and Tom is a eat". Does Tom ent fish 7 1 Rae (YO cata) (ean yeasts net) cotton ys tm ets sh Q in? Explain with example. “4 to remove existential qunatifen, {Q.1.(e) What is a skolem functio Universal Ans, Skolem funetions are functions thatare use« ens in wit The existential quantifiers are replace by the functional tert {Quantfiers willbe removed too, but thir variables will remain variables Example: 3x vy Loves (x.y) is aatisfabl ifthere is an x that makes loves (x,y) true no matter they ‘The value ofx must be the same for any Replace xby afresh constant, say, . Wy Loves (S,9) ‘Sis called a Skolem constant. @2.(a) What do you mean by hill climbing search technique? What are th various problem encountered init? ‘ Ans. Hill climbing isa local search technique. It is an iterative algorithm th starts with an arbitrary solution to a problem, then attempts to find a better solut by incrementally changing a single element ofthe solution. Ifthe change produces abe solution, an ineremental change is made to the new solution, repeating until no fur improvements canbe found. Iti relatively simple to implement. Hill climbing ean use to solve problems that have many solutions. Its not guaranteed that hill elim will ever come close to the optimal solution a unica! maxima: A problem with hill climbing i that it wil find only local maxi c heuristic is convex, it may not reach a global maximum.) University 1 Teet) AR Publish ‘Qin Writean algorithm fr est Ans. (b) The algorithm is repr meee etn alist, OPEN, const whore Fs the 44 Expand node 0 she ik angus it rods tm a sh se nature by vending the algorithm back w the second te. oie whom ary hes onal stn Sa eateries Pay) a Junie a atadont who docs ot study dosnt ast Ans. student(john) . ‘yx (atudent(x) Mostudyid ~Passtx)) lay is nota football star oy anyone wha docan' ihn. Wat Playx)->>Sta ®) Go Prove that i£John doesn seg Stadytohn-Laves Mary ohn) a erniatbeowoen orwned chaining anbecoaedchinE the help of example. * -« a? 6) ‘Ans, Comparison betstee Ccuaining: Backvard ce oom een approach nwheh Youur fn oa twas 0 osiningi a cone tm a era ae Often this entails is than sn eager aN Often Caning isa data-driven spprench on approach we start from available Fran ep a it eomes in, o from abasic, iy to drave conclusions. “Eucample: Suppose you want travel fom 'etanbul to Diyarbakie and there ane direst voyages. There are two basic Ways Ye sm aiscuss: 1 Start with al wovaees hee aie Diyarbakir and find where €50h ¥ sated. Continue the proctes arm you find Istanbul. This search Proce age Jy backward chaining 2: Start wis aaa ages that originate from Ian ‘and mi "Then ook up ail the voyages Feaving these ararediate cities; conte the P= SS ‘until you find Diyarbakir. This search process rcaled forward chaining. is tion ofknowledge has diferent chaining. Backwat ge has Upned a rica to avoid CHP athe of reasoning. Forward chaining, on fan exhaust vtstudy then Mary doesn't likes john. 1» Forward and Backward 1 Theeso Mg in waren, ‘aime atngunesse carer ype other hand is like search.4.2016 Sixth Semester, Artificial Intelligence 2 Rackward chaining systems are good for d they are,not good for planning, design, process monitoring, Forward chaining systems can handle all these tasks. 3. Forward chaining system, includes writing rules to ma backward chaining systems automatically manage sub goals. 4 Lots of output Hypothesis + Lots of data up front = > Use Forward Chaining, Fey, output Hypothesis + Must query for data = > Use Backward Chaining, 5. Backward chaining engines query for new facts, whereas forward chaining relic ‘on the application asserting facts to the rule engine. 6. In backward chaining, classification task nd quite a few other. , age sub goals. Whergy ch is goal directed, so rules can be applied that ar s891Y to achieve the goal ard chaining the whole proces i not diverts towards goal, so when to stop the rules in not known 7. Ifthe facts that: has to be established lead to a large number of conclusion, but y number of ways to reach that particular conclu out rather than information in, then backward chaining should be used. On the other hay ifthe number of ways to reach a particular conclusion is large, but the nurnber af conclusing likely to be reach using the facts is small, then forward chaining, is preferred 44. (a) Trace the constraint satisfaction procedure for solving the followig cryptarithmetic problem: BROWN +YELLOW ee « PURPLE ssinall, then there is eaore informatig 1 2 3 4 5 6 WR NE BY BROWN +YE990W PURPLE Ans. 0 oO Let assume 9 in L so that BROWN +YESSOW PURPOE so that and 0+9 =P Let O is the highest value than 9 which in 8 BR8WN Ba +YES98W Mee SURE eS pemenavae 3 3 W cast be O other wise N Be en so thatw=4 6E9901 —— ex: int val of tr a ur| inorpretation, Forex waity (Teoh) AB Publisher Net NeKat ed otaeas Q.4.{6) What are the properties of propos! ional calculus, explain with wo example. ‘Ans. Properties of propositional calculus statements: Gd) Valid: A sentence is valid, if itis true for all values of inputs or for every ‘PoaP iv valid since every interpretation of P results in a true alue for Pv>P. interpretation for which itis true is called (ii) Satisfiable: A statement having one For ex: If statement P is satisfiable “it will have atleast one interpretation taint ja true, However, P will not necessary be valid beoz itis not patinfiabl of P for which the vall true for every interpretation of P. (ii) Unsatisfiable: It is also called called unsatisfiable if there is no interpretation for hwatisfiable because itis false for every interpretation of P. io) Equivalence: Two statements 61 and s2 are 4) interpretation they have the same truth ‘value, For ex: two statements th have the same truth value for ‘every interpretation of P. equivalent since bot {o) Logical Consequence: Statement’ ot ipgaid tobe logical consequence of 81 iti watinfied by all interpretations ae vich satisfy 81. For ex: out of given sentences Pand P2Q, Pin said to be torical ne aaequence of Pc peeause for every interpret for which Pais true, P isalso true ‘contradiction. A statement or preposition is ‘which it is true. For ex: Pv>P is uivalent if for every sments P and ~(P) are tationAMINATION [APR. 29, SECOND TERM eS eTr R [B.TECH] 1g) SIXTH SEM ARTIFICIAL INTELLIGENCE [ETCS- $10) Time 1:90.30 sutsory and any two more questions. M, hich is com ay bn Note: Auiempt Qo 1h alco tality eutot QL. How does gam je itt is worth continuing as the BOW rate day iswhereyou decides tree that offers litte possibility Forimproye ploration of a sub-tree tha ‘called futility cut off the limitation of expert system. Terminating over known paths Q.1.(6) Exp! Limitations of expert aytems: esa very small range of domain : oaaaeeetaiyTanetion in the domain ofthe extracted, cognitive, logical thi, nly function in the dom: 2, They mai process oo. 3. They are not able to make use of comman sense 5. They are non-self referral systems. Q.1.(@) List out main components of Learning Agent. Ans. Following are the components of learning agent: * Perception * Critic * Learner or learning element * Problem generator + Performance element Q.1.(@) What is morpheme? What is its importance in the language? Ans.Morpheme is a primitive unit of meaning in a language. The importanc: morpheme is that without it one cannot find the crux of the sentence. It helps in gin meaning to the sentence. Q.L(e) How many types of speech recognition system exist and what type signals are used in speech recognition. t Ans. There are two types of speech recognition. One is ealled speaker-depence and the other is speaker—independent. Speaker-dependent software is commonly us {or dictation software, while speake r-independent software is more commonly found telephone applications. Speaker-dependent software works by learning the unique characteristics of a ‘sing person's voice, in a way similar to voice recognition. New users must first “train” t software by speaking to it, so the computer can analyze how the person talks. Speake independent software is designed to recognize anyone’s voice, so no training is involve This means itis the only real option for applications such as interactive voice respon ‘stems where businesses can't ask callers to read pages of text before using the syst Speech recognition engines that are speaker independent generally deal witht fact by limiting the grammars they use. By using a smaller list of recognized words, Speech engine is more likely to correctly recognize what a speaker saad Acoustic signals are used in speech recognition system 2. (a) Generate parse tree of the following: (@ Theard the kids listening to the radio. Aman wanted to go to market with Ayan,LP. University-(B-Tech)-AB Publisher 2016-7 ‘Ans. (i) [heard the kids listening to the radio, | heard the kids listening to the racho Ver . / foun phvase ® i | ~ z E Determinant Mab phrase > | pace the lds Prepositional \ dun @ prose cy ratio Sing i) Aman wanted to go to market with Ayan. ‘agnan wanted to goto market with Ayan e Noun phrase Neces ‘Noun phrase (lo go to market with Ayan) Q Aman Veto a / ~ ‘verb phrase (go to market with Ayan) Prepositional Qi phrase / \ ] Lot 7 2 of Prmneatinal Noun Prepestcnm "noun ( se We (2) | a to ‘Market with Ayan ‘d 7 vi Q.2. (6) Solve the following with alpha beta’ pruning: 6) gl he r 5 owing are the stePs* Ans. FollSemester, Artificial Intelligence Sixth 82016 Step-2: Need not bev =: pruned f= Step-4:LP. University-(B.Tech)-AB Publisher 20169 Step-6: Step-7: Step-8:10-2016 Sixth Semester, Artificial Intelligenc, eS / / |acTtis step is prunes Step-9: Step-10: Step-11: Step-12:LP. University-B.0 ty-€B.Tech)-AB Publisher 2016 6-l1 Step- This step is. oe Q.3. (a) Whi the ae = Explain Explanation based rial ete anaci intelligence system? ‘Ans. Role of Learnii e earning: Machine learningis the " improve automatically through experience a Unsupervised learning is the ability to fine stream of input. Supervised is at oe cr to find patterns ina str determine what category s Se ‘and numerical regression. Classification is used to Se eae ry something bole in after sexing nner of examples of ng the relationship between inputs is the allempt woreda ¢ function that Shoufd change as the inputs change. In‘ hate areeeart let and predicts how the outpi good responses and punished for bad ones. These can ee din tar Lorahernie areors, using concepts like utility. Th analyzed in terms of decision theo nd the penformanc am The mathematica ‘analysis of machine learning algor tionat learning theory. ‘of theoretical computer science known 05 within developmental robotics, developmental learning approaches were elaborated for lifelong cumulative acquisition of repertoines ‘of novel skills by a robot, through for Memos self-exploration and social interaction ‘with human teachers, and using fuidance mechanisms such as active eg maturation, motor synergies, andimitaton Explanation Based Learning: Taplanation-based learning (EBL) ss form of smachire learning that exploits a very strong, 0 TE perfect, domain theory to make Tfoneralizations or form concepts from training examples. cm example of EBL using 2 perfect domain theory is a program that learns to play chess by being shown examples: & teecife chess position that eontaing 2” {important feature, cay, “Forced loss of black ‘queen in two moves,” includes many jrrelevant features, reage the specific scattering of Pann Tt reed, EBL can take a single taining sucnple and determine whatare the Welevant features in order to form & generalization. 'A domain theory is perfect oF vomptete if it contains, in PHN, all information needed to decide any question erst the domain, For example,‘ domain theory for hese is simply the rules of ches a Mngt roles, in principle its possible to deduce the best move in any situation: vrowover actually making Such 3 “jeduction is impossible jin practice due to any Tpinatoric explosion. EBL vst training examples ‘make searching in Pyeductive consequences enain theory efficient in Bracke way vo deduce each tains example from the system's existing datahe of Tavinga Doane example extends the irenain-theory database, a aa classify future examples that are ‘similar to the training example very 4 a ce a drawback of the ‘method—the cost numerous—Wwas ana! jyzed by Minton-1 tntelligenes Somester, Artificial features in thet table using 0 Inductive, and Abductive n Deductive,| nti 6 rducveandabiucivsPeTOR® ion aa general rule ae saps eplcatin In dadoctive 2d proc race from th coming, ifthe original ssser [rotrue, then the conclusion must also be true. For example, math is deductive 5 Hx=4 : Andity =1 ° Then de+y=9 : nthiexampl, i lagi neetity that 2+ eq 9; x+y mus! equal. amnattarof ac roa eyolc lg uses language tat tothe rater lice he may ‘etal aon, compet ith ts operators and syntax. Inductive reasoning: Begins with servation that are specific ana imei spe and proceeds generated contusion thas ikely but hot era, liga ‘cumulated evidence, Conlusons reached by the inductive method are nat lence ‘cents no amount findutive evidence gearantees the conclusion, The heey there o ay tka that al he posse evidences been gathered ed thee og cist ne ortho bit unoborved esate that might ivalgate my veh For example, Albert Einstein observed the m was ive yearsold and became facinatad with Space around the compa sth ditional observation (ot moving tang, for example) andthe vee at nas 24 mathematical tol (dedotion), resulted in a rule that hn cheery could predict events that were as ye unobeervo, Abductive reasoning: Typically begins wth an incomplete setof observations and proceed tothe likeliest possible explanation forthe sel. Abduette ence jovement ofa pocket compass when he the idea that something invisible in the pplication of abduetive reasoning. The ive, intuitive, even revolutionary. Einstein's work, for and vavelna re dustinductive and deductive, but involved areatveleapdineeecae, imi auatization that scarcely seemed warranted by the mere cbsereaton ot moving trains and falling elevators, Q.4.a) Write short note on Al techniques Ans. Following are the techniques of Al: ‘The Neural Network: This technol of the human brain, Cells or storage lo 4areestablished in the computer. As int 6 logy is based loosely upon the cellular structure ‘cations, and connections between the locat he human brain, connections among the eelLP. University stronathened or weakened {ete an Publ ie pain The ‘ut the canoes boning eae Sern wae eae Patterns of the ex — ‘expert, who has devel "se systems are usually b ies expert who has developed them mentally ater ee ee {apecialty area establishes these ues. A hoe data ¥ area, estalishes these rules, specialist, known a4 wedge ond aS allow sophisticated processes oe run w ee tenet othe i tae, these rl are packages such as Tax Gassc cass ofthe econ See erate cat and Turban Acai euro Ue econ "ena one he cu Eee speech and converts them into text content. The process, made he 1y lots of computer memory and fast processors, works like this: . 2 «+ First your continuous voice sound waves, eee ind waves, eaptured by aaicrophone, are fedinto i metered Aika captring snapshot at very eh a tiem ah a pci nm ea mae cans ee i Sr Pays pate et Su nseaat ested see nei Scene te ten es functions, which are ‘relationships among criteria, to grade, ‘candidates. Tay ot sire tchane ee nate Recetas hod Know ring are the detailed stePS He gontic aor works Thaystack. GAS use & met) ‘and error: Followester, Artificial Intelligence sixth S —— st “high fitness” criteria; fae par ea ee is ; ‘ sJation meets caapernaips a selection strategy an, 2. Ifa candidate in the por erent set using a selection Oe oa, 4. Select the best of the em i. eet the : maintenance, then oe 4. Reproduce using €r08 a create sligent agents (1A), now often known 8 “bots”, are yp, can b ‘ gents: Intelligent a Intelligent Agents user, Using directeor™™ (cost itive asks for @ om echnology that performs difficult or repet e arovided list of instructions kne™™%, Tt de coche oy led timetable, the IAs oxecute a orice ga" from capability nie 8, form script The intelligent agen a ee arity ean then can a eae 3 that can stay att Ins oer A techniques: pect ded tous by computer processors that ca Stay anette “ever diligent” capability ‘ou ve Adwork 24 hours ay 7 days a Weeks anda s Q:4.6) Explain the role of AI in the field of Medical scienc Aero o 2017 (Page No.: 28-2017) ne ») Refer Q9 of End Ferm Exam 2017 (Page : Ans.4 (by Refer Q9 TE T 1 a END TERM EXAMINATION [MAY. 2016] MM, 4! Note: Attempt any five questions including QNo. 1 which is compulsory select one quest, from each unit. . Q.1. Write short note on the following: 26x10) (a) How does the Artificial Intelligence (AI) solves problems for which nor practically feasible algorithm exist? 2 Ans, Artificial intelligent system is based on learning. Due to this reason it give P< best possible solution. Also because of heuristic function in Al one can able to find th. optimal solution. Q.1.(b) How is an expert system different from other conventional software Ans, Expert systems differ from other conventional software as in that the knowledy base in expert system is more comp] lex due to less reliance on the end-user to evaluat: the results. Q.1. (ce) ferentiate between knowledge base and data base. Ans. Difference between database and knowledge base: [Data Base (DB) Know ledge Base (KB) 1. It is defined as a collection 1. Ithas information at a higher level of data representing facts. of abstraction. 2. Itis larger than a KB. 2. Itis smaller than a DB. 3. Changes are fast. 3. ‘Changes are gradual. 4. All information needs to be 4. Ithas the Power of inferencing. stated explicitly. 5. It is maintained for operational 5. Ibis used for data analysis and purposes. planning. 6. Knowledge is represented by 8. Knowledge is represented by log relational network or orrules, |___ hierarchical model.Tit, Q.1.4d) Differ yetween st rentiate en st rong ALand weak AL qeast equal to h ray |] ent puns. a fanay 2 Tecate wath the ceaton ot some | 2 Sere canal ve [ coma ge Weis th etn fe em mputer-based AL tha Mnputer based Al that can reason ff iene Aegean pele aie cr in te dn ag | thomstin the oatanaton (eras —< oing” is sometimes referred oneiog ers ato | 4. “Helping” is called as weak AI Ss. We nave sil to achieve the | 5. w We now aioe 5. We have already reached the objective [objectives of strong i] of strong AL a Qe) Explain Turing test for AI- ] “Ans. In 1950, Alan Tu 1 | Alen Turing proposed “Turing Test, In this we havo tw One person tte ‘ om from machine uit [computers ether perso The intern ator ask question to both. The goal ofthe machine £278 listofeal =) other Peator into believing that tis the person if satisfies we can sexs like human being or itis intelligent, oe 7 ann What is heuristic search? Give an example. =25) Ans. eee sazareh san artifialintaligence search technique tha emPsTo ecause of exponential nature ch no forits moves. ‘of problems. gives [F polynomial number. ‘Example of Heuristic search is Hill ‘climbing search strategy. ithe | Q.1-(g) What do you mean, by reasoning under uncertainty? Ans. The reasoning under ‘uncertainty is focused on the uncertainty of truth value, are? (that is, to allow and procest *Feath values other than “true” and “false” edge) THCeVSIOPS system that reasons with uncertainty msAnt to provide the following ne 7 Soe ‘explanation about the origin and natur® of the uncertainty * away to represent ‘uncertainty ina formal language 1 asetof inference rules that derive ‘anvortain (hough well justified) conclnsic™ ent LP. University y-(B.Tech)-AB Publisher 2016-15 Ans. Difference bet Diff between strong Al and weak AL IC St jf Astrong A Strong AT { wa ee AL calins that computers | 1. Aweal AT week at LS aA | Gh aure re eed oom Heuristics play a major role in search strategies Tehelps to reduce the number of alternatives nom Ot ‘exponential number to 1 mechanism for uncertainty manage teristics of knowledge representation system? for any particular domain should + anefficient memory-control Q. 1.(h) What are the charse ‘Ans. A good knowledge representation system possess the following properties: 1, Representational Adequncy the ability knowledge that might be needed in that domain. 2. Inferential Adequacy the ability to manipulate the representational structures to derive new structures (corresponding to new Treo wledge) from existing StuctotS 'g, Inferential Efficiency” ability to incorporate additional information into the knowledge structure vhich can be used to focus ‘the attention of the inference mechanisms in the most promising directions ae sqnal Efficiency- the ability acquire new info I the seatahould be ee sentra its own knowledge acquisition, but direct insertion of P would be acceptable: {ferent kinds of to represent all the di Information by a knowledse engineersemester, Atiicial Intelligence Wetting 2 arte scareh andi ey ‘ alpha bet hat are Qwh : Ans. ALPHA-BETAP" ctrategy: it reduces the ves that are obviously bad for the Junge eae ted stars with vinfnity ang ge) Qe) Fr the MIN nodes, the SOP" CNT rea with -infinity and increase yt) Ans. H rhe AN pes, compe start wth init and ne eget = tine For Mite alpha-Beta procedure des Saag mney the Al ‘i rithm for -game tree. Vv -splain Minimax algo! a : G17 Bamlnin ipe two players ave called Maximizer ang q, 1949 Ans, In Minin get the highest score possible while the minimizer ty 1945 The maximizer (71 ie while minimizer tries to do opposite ml isso the lowest score possible .d with it. In a given state sory board state has a value associate i Every board stare ore ofthe board will tend to be some positive ya has upper hand ‘hen Cr hand in that board state then it ill end tobe got! 1996 aan nate of the board are calculated by some heuristics which ang ¢™% Salve The va “ every type of game i ‘Example: Consider a game which has 4 final states and paths to reach ers are from root to 4 leaves of a perfect binary tree as shown below. Assume yy maximizing player and you get the first chance to move, i.e., you are at root | opponent at next level, 196 196 Min . 19 Since thi B4 J . ince this is a backtracking b: ithm, it tri ; backtracks and makes a decision USOTthm, it tries all possible move: jug a3 ths itLP. Universi ity-(B.Tech)- AB Publisher ‘Dh la trig nt Q.2.4a) Expl Loy om me @) Explain origin and histor my Serer -y of Artificial Intelligence. . ie Ye Milestone /Innovati “ Si Karel Capek play named “Rossum 7 toa Bs come ‘robot” in English. IRUR} opens in 2 a neural networks tid in sac Asimov, Columbia Unive estes acon A eco Ne U niversity alumni, coined the term Robotics fa Aan Tring Ting at yaar aes : “omputing Machinery and Intelligence. Cla eae ae aon ee eee Chea Pagingaateear = fehnecriny sine scm ified tie Destin ot : ons s nning Al program at Carnegie Mellon Universit — oa ge naeeniraa WT showed that compte understand natural lang e well enouy apne tng wdersta ‘quae well enough tosolve algebra word problems and 1965 Joseph Wei ceph Weizenbaum at MIT bul Yo pl baum at MIT built ELIZA, an interactive problem that ; carries on a dialogue in English. 1969 Scientists at Stanford Research Institute Developed Shakey, a robot, equipped with locomotion, perception, and problem solving, | 1973 The Assembly Roboties group at Edinburgh University built Freddy, th Famous Scottish Robot, ‘capable of using vision to locate and assembl4 models. 1979 The first computer-controlled autonomovs vehicle, Stanford Cart, was butt 1985 Harold Cohen created and “demonstrated the drawing program, Aaron 1990 Major advances in all areas of AT = srations in machine learning + Significant demonsti ‘ Case-based reasoning . ‘Multi-agent planning: + Scheduling + Data mining, Web Crawler * jatural language understanding and translation "Vision, Virtual Reality-Games 1997 The Deep Blue Chess ‘Program beats the then world hess champion, Garry Kasparov. 2000 Interactive robot Pet pecome commercially available MIT iy displays Kismet, a70b0t ‘with a face that expresses emotions: The cabot Nomad expTores remote regions of Antarctica and Tocates meteorites earch formulation of well known water Q.2.(6) Write and explain| state space 5 ‘ad-gallon one and jug problem. in Ans. : --Jug Problem: You are give , ° Ste re inhas ee nited water which YOUCTE see to fill the juss and ee a cigs any messuring maTRINES ontor, Artificial Intelligence swe wil represent a sate into water i the Alon Cr iia ate OO pgs 9 3-THO HALE SPACE TOTES poy eden tein wet operator tat wl ake Fm ney anther tay) v4) 1 ale on Bay 043 " inal iue 2 : yes : pty al jngon ground (sy) ay ‘ * x20 « Bmply eljugonground ay) x0 yoo 5. Pourwater from3galjug (9) F436) toil gal jog Oextyatandy>0 € Pourwaterfom-4asljug (xy) v3) toil glug dexsy2dandx>0 2.Pourdlot water trom gal (xy) -s¢a930) {ina «ga jug Osx+y23andx>0 & Pourallofwaterfrom 4¢al (xy) taxey) Jug into 3-gl jug Oex+ysBandx20 .@2(©) Describe the production rule for solving above problem Demonets {he working of Breadth-first search on water jug problem (Assume stata oalstate). ‘Ans, The various operators (Production Rul jroblem may be stated as given inthe following fi tule No. | Production Rule that are available to solve: igure 7) Filth dejo, ified, - if ¢litre jug isnot | ities, | isnot ut : hy wos Pour some water out of the litre jug. ‘litre jug is not empty. (i) tii) % Empty some waterou of if j>0, if Sitre jugis poetic ij) —oj ie ne i) Empty the 4-litre. Jug on the ground, if | tea ‘ite jug isnt empty Empty the 3. | itso Lis a Slitre jug is not: jug on the ground, if empty,LLP. University 0: Tech)-AB Pub aii, | Ente tke oped sane ce 7 3-litre jug is not empty. i a ‘ yeyrecaand iso | jug ifthe combined contents ee eine sa wovking of Breadth First ecarch on water jug problem is ven below Water Jug Search Tree | ‘gorithm using eryptarithemat's « __ .n constraint satisfaction 8) .3.(a) Explai problem. Tall ‘Ans. Many pr pe viewed as problems of ns hich the goal is (2 | Constraint satisfac fof constraints propagated as far a ‘ihe through out hesssta, Promagigane. A guess abou SOC eri aided as a new Constr it, Propegationcanthenocom vith this new er Propane N= 3, we ean propadste Tra pleof a erypt aitbmeti probles SEND {MORE Problem: ne [No two letters have the 8 must be as shown 0D ied & also we Bet ot that B= 2. same value, roblem, We have he output we Proce tnitial state: ime digts ‘he sin of Si ee that initial eonaition sat taint satisfaction in disover some probes we discovered & aah AsitN = E41, we added sehgorithm. Int algorithon WAranIogd (03:0) Weiteand explain A* aor , nolan ito xpiningivingexamates , tha in whe te sa tenets nandWapiathe heurieticestionie © ing” oe inn tna goal, Thus, Rn) etimates the lowest total otf vo lpi ier am optimal path aa gal ito eure fndon ae nase ‘heerlen tranny amtaine net cae {Remon it eh eu “nate “Aa nd sort QUEUE y= «uit “TTaOB mtn ate ne AND Peni ede tain nate Anon Phenom ~~ IF goal reached Then ‘success ELSE failure 7 @41o) Explain the inference rules in proposi . 6 : Ans. Pilon nite (0 Modus Ponens or Implication Elimination am nics anata taser Ia ie thoren is prved with ope nt Be ntsc 'ogically follows fom the axioms) © axioms, je. the theoresNAN Publisher sore, bee ett | inere ing ae 3) $6) Double-Nogation oa) positive sentence can be inferred. “ pee : (6) Unit Resolution Fy ent Resolution Prom a dinetin fon of snes alae wpb a (oi) Modus Totens © =B-6 rline a= 0a bine ae = sr, fe) oreauivalently ais tre) Peter tebe Abduction Rule ot e209 [oF wor Ceres Itis nota sound inference ral! not plo wth hehe o these ues Tet Cero nck ten every cove is white. every eb na flour legs avon every Petiale Chee bulalo is white” a 4 ) Solve the followin validity of following argument cow is white then, it has four legs fev [ekhite. The milk is black. Therefore, @ “ans. Assume the following prepositions P: The milk is black @ Every cow is white R: Every cow has four lees ‘3: Every buffalo is white ‘7; Bvery bulfalo is brisk1, Artificial Intelligence mPa . iat a e (iv) F a using lines (d) and (e) and rules f thes ST: premise i J of lines (e) and (6 (@)S*T using modus ponens of {h): using rule of simplification Je of simplification io) Euplain the rus to unity two predicates os ee Jes in an inference system (such, nification & inference rules i ‘ ; ee ee ee ee t son tichsars bose on PROLOG, where the unification also play an important ru sel variables must be universelly qualified. Whenever you see a variable ina. variables must be univ f rapesioal dar -y-h era expression, assume that it is universally qualified. This allow us 8 substitutions, : , + Existentially quantified variables may be eliminated by replacing them with. tants that makes the sentence true. For example, Ex mother (x, bill), we can replace Xwith a constant designating bill's mother, ann, to get mother (ann, bill). Q.5. (6) Represent following facts as predicates and convert them to clause form, explaining the steps of conversion. (8) @ Any student who is intelligent or hard working will pass the exam in good marks, (ii) Any student who is passed with goods marks gets a job. Ans. “Anyone passing his or her artificial intelligence exam and winning the lottery is happy. But anyone who studies or is lucky can pass all his exams. Pete did not study butis lucky. Anyone who is lucky wins the lottery. Is pete happy?” Step 1: Change sentences to first order logic. 1. “Anyone passing his or her artificial intelligence exam and winning the lotte winning (¥X) (Pass(X,ai) v WIN (X, lottery => Happy(X)) 2. “Anyone who studies or is lucky can pass all his exams" (VX) (Studies (X) v Lucky (X) => Pass (X,Y) 3. "Pete did not study but is lucky" udy (pete)*Lueky (pete) 4. “Anyone who is lucky wins the lottery” (VX) (Lucky(X) => Wins (X,lottery)) Steps to convert predicate form 1. Eliminate all implications = 2. Reduce the scope of All - to single term.* ‘happy to clause form: