This is the official question paper of Artificial Intelligence Paper of B.Sc. (Hons.) Computer Science Course at the University of Delhi.
Question 1 is compulsory.
Attempt any four questions from question 2 to question 8.
Part of a question must be answered together.
Some symbols may not be visible on mobile devices. Hence we recommend that you use a desktop to view the solutions to the questions.
Question 1 (a): What do you understand by the term "Rational Agent"?
Question 1 (b): What would be the output of the following statement in Prolog, and why?
? - A is 6 + 3, B = 5+4, A = B.
Question 1 (c): Construct the truth table for the expression (A&(A∨B)). What single term is this expression equal to?
Question 1 (d): Write the joint distribution of x1, x2, x3, x4, x5 and x6 as a product of chain conditional probabilities for the following network.
Question 1 (e): Develop a parse tree for the sentence "Raja slept on the sofa".
Question 1 (f): Compare and contrast Depth-first search and Breadth-first search.
Question 1 (g): Transform the following into Conjunctive Normal Form (CNF):
P ∨ (~P & Q & R)
(~P & Q) ∨ (P & ~Q) & S
Question 1 (h): Express the sentences given below into Conceptual Dependency Structures:
Ram drove the car fast.
Rita gave Sita a bunch of flowers.
Question 1 (i): Give the properties of Type 1 and Type 2 grammars from the Chomsky Hierarchy of grammars.
Question 1 (j): In the following two-ply game tree, the terminal nodes show the utility values computed by the utility function. Use the Minimax algorithm to compute the utility values for other nodes in the given game tree.
Question 1 (k): Write about the limitations of Hill Climbing Search.
Question 2 (a): Describe the water-jug problem. Also, give a suitable state space representation for this problem.
Question 2 (b): Transform the following into clausal form.
∃x ∀y (∀z P(f(x),y,z)→(∃u Q(x,u) & ∃v R(y,v)))
Question 3 (a): Write a Prolog program maxlist (L, Max) to find the greatest number Max in the list L.
Question 3 (b): Find the probability of event A when it is known that some event B occurred. From experiments, it has been determined that P(B|A) = 0.84, P(A) = 0.2, and P(B) = 0.34.
Question 4 (a): Determine whether the following sentence is satisfiable, contradictory or valid.
S: (P ∨ Q) ⇒ (P & Q)
Question 4 (b): Find whether the following sets are unifiable or not? If they are unifiable, find most general unifier (m.g.u.) otherwise give justification why they are not unifiable.
Question 4 (c): Give PEAS Description for a Taxi Driver Agent.
Question 5 (a): When do we say that the search is admissible? You can take the example of A*.
Question 5 (b): What is a horn clause? Give an example.
Question 5 (c): Solve the following crypt arithmetic problem using constraint satisfaction.
Question 6 (a): What is a Truth Maintenance System (TMS)? Give the architecture of a problem solver with a TMS in the form of a diagram.
Question 6 (b): Express the following concepts as an associative network structure with interconnected nodes and labelled arcs.
Company ABC is a software development company. Three departments within the company are Sales, Administration and Programming. Joe is the manager of programming. Bill and Sue are the programmers. Sue is married to Sam. Sam is an editor for the Prentice Hall. They have three children and they live on Elm Street. Sue wears glasses and is five feet four inches tall.
Question 7 (a): What is default reasoning?
Question 7 (b): Translate the statements A1 through A4 into clausal form. Show that the predicate supports(book,cup) is true using resolution.
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 the statements A1 through A4 into clausal form.
(ii) Show that the predicate supports(book, cup) is true using resolution.
Question 8 (a): Based on the context-free grammar represented by the following parse tree, draw the corresponding Recursive Transition Network (RTN).
Question 8 (b): Draw the block diagram of the learning agent and explain its working.
END OF PAPER