Artificial Intelligence — DU B.Sc. (Hons) Computer Science Previous Year Question Papers

Nine of the paper : Artificial Intelligence Attempt,any four questions from section B. All parts of a question must be answered together. 1 (a) Explain the architecture of a lcaming agent with its components. (b) (5) Mention any two diffiercnccs between Breadth First search (BFS) and Depth I<`irst search (DFS). Illustrate the result of BFS and DFS on the following tree. (c) Consider the following predicates: i. ii. I)etcrminc whether the above expressions can be unified. If unification is possible, find the most general unifier (MGU). If not., clearly explain the reason. (d) What is the Chomsky Hierarchy of Grammars? Write the properties of Type 0, Type I, Type 2, a]id Type 3 grammars.with examples. (e) How clothe cut (!) operator and fail predicate affect backtracking? Write a prolog program to implcmeiit fact Or, 1<`) that computes the factorial of a nuinber N, storing the result in F. using appropriate CD primitives: i. The boy threw the ball. ii. She ate an apple. 2 (a) Convert the following into clausal form: (7) Al: If x is a student, then x studies. A2: Rahul is a student. A3: If someone studies, they pass. Express the following sentences as conceptual dependency structures: Charlie drove the pickup fast. Ram is a programmer. accelerating, and steering. i. Identify the components of an intelligent agent in this system by specifying: Performance ii. Draw a diagram of the agent structure showing the interaction between the agent and its environment. iii. Is the sclf-driving car an example of Weak Al, Strong Al, or Narrow Al? Justify your answer. 3 (a) Prepare a script for "Online shopping" using appropriate script elements (roles, props, (7) places, scenes, entry conditions and post conditions etc.). (b) Explain Turing Test approach to Al. How is Turing Test approach different from the (8) rational Agent approach? 4 (a) . Differentiate between the following: (8) i. Fully observable vs. partially observable environment ii. Deterministic vs. stochastic environment iii. Model-based agent and Goal-based agent iv. Goal-based agent and Utility-based agent (b) Write a Prolog program to perform the following list operations: (7) 1. Check whether an element is a member of a list. 2. Find the length of a list using recursion. 3. Concatenate two lists. 4. Find the sum of elements in a list. 5 (a) Define Heuristic Search technique. Why should a heuristic function of A* underestimate? (7) (b) Consider the following game tree with ply depth 2 where the indicated scores are from the (8) MIN player's point of view. Which move A should choose and why? Which nodes will be pruned according to the a-B pruning procedure? Give justifications of each. NIN PLY. B D MAX PLY. 6 (a) Using the Constraint Satisfaction approach, solve the following crypt-arithmetic problem: (7) Show all the steps. (b) What are the differences between Recursive Transition Network (RTN) and Augmented (8) Transition Network (ATN)? Given a grammar G= (Vr, VN, S, P)