Download DU (University of Delhi) B-Tech 7th Semester Artifical Intelligence Question Paper

FirstRanker.com

[This question paper contains 7 printed pages]

Your Roll No.

--- Content provided by FirstRanker.com ---

Sl. No. of : 6131 F-9

Unique Paper Code 12341701

B.Tech Computer Science

CS-701 Artificial Intelligence

VI

--- Content provided by‌ FirstRanker.com ---

Maximum Marks : 75

Instructions for Candidate:

Write your Roll No. on the receipt of this question paper.

1. Discuss the Turing Test approach to Artificial Intelligence. (3)
2. (c) Give an example of each of the types 0, 1, 2 and 3 Chomsky's hierarchy of grammars. (4)

--- Content provided by‍ FirstRanker.com ---

3. (d) Define a production system. Which category of production systems may be applicable for a robot navigation problem and why? (5)
4. (e) Determine which of the following are valid wffs :
   1. (P > Q) > ~R) & S) v (T A u))
   2. wff (P(x))
   3. ~~ P
   4. PQ

   --- Content provided by‍ FirstRanker.com ---

5. (f) Convert the following into Clausal Normal Form : (4)

   Vx[B(x) AH(x) > W(x v{aiM(z,x)A~azé@)]]

6. (g) Write prolog programs for the following : (6)
   1. Sort a list using insertion sort
   2. Delete all occurrences of an element in a list

   --- Content provided by‍ FirstRanker.com ---

7. (h) What is the output of the following prolog program and why ? (2)

   
   car (car1, black, 450000).
   car(car2, silver, 300000).
   car(car3, white, 400000).
   --- Content provided by‌ FirstRanker.com ---
   car(car4, black, 450000).
   getcar (Color, Cost_ Less_Than):- car(Name,
   Color, Cost),!, Cost < Cost_Less_Than, write
   . (Name). 

   The goal is :

   ? getcar (black, 350000).

   --- Content provided by⁠ FirstRanker.com ---

8. (i) Derive a parse tree for the sentence "Abhinav likes the cake", where the following rewrite rules are used : (4)

   
   S:— NP VP
   NP » N
   NP - DET N
   --- Content provided by‌ FirstRanker.com ---
   VP -V NP
   DET - the
   V - likes
   N — Abhinav ‘.IA cake 

FirstRanker.com

--- Content provided by⁠ FirstRanker.com ---

1. (a) Illustrate the operation of the Steepest Ascent Hill Climbing Algorithm using an example. (4)

   Under what situations can hill climbing fail to find a solution ? (3)

2. Comment on the relevance of h' the estimator of h, in the working of A* algorithm. (3)
3. Trace the constraint satisfaction procedure solving the crypt-arithmetic problem: (6)
4. (b) Write a short note on Utility based agents. (4)

--- Content provided by⁠ FirstRanker.com ---

5. Given the following axioms, prove the conclusion using resolution principle. (7)
   1. All hounds howl at night.
   2. Anyone who has any cats will not have any mice.
   3. Light sleepers do not have anything which howls at night.
   4. John was either a cat or a hound.
   5. (Conclusion) If John is a light sleeper, then John does not have any mice.

   --- Content provided by​ FirstRanker.com ---

1. (b) Find the most general unifier for (3)
   1. t1 = P (f(a), g(X))
   2. t1 = P(f(g(X,a)),X)
   3. t2 = P(f(Y), b)

--- Content provided by FirstRanker.com ---

2. Explain the utility of alpha and beta cuts in Minimax problem. (4)
3. 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. (2)

   [Game tree diagram description]

FirstRanker.com

1. (c) How are frames used for knowledge representation ? Explain using an example. (4)

--- Content provided by‌ FirstRanker.com ---

2. (a) Given the following parse tree, draw the Recursive Transition Network for parsing this sentence. Show the traversal of this sentence through the network. (6)

   [Parse tree diagram description]

3. (b) Transform the following sentences into conceptual graphs. (4)
   1. John is going to Boston by bus.
   2. Elsie is on a mat (Here, Elsie refers to the name of a cat)

--- Content provided by⁠ FirstRanker.com ---

1. (a) Write PDDL statements for the following actions in the Monkey banana problem given the Initial state as : (6)

   At(Monkey, A) A At (Banana, B) » At(Box,C)

   ~ Height (Monkey, Low) A Height (Box, Low)

   " Height (Banana, High) A Pushable (Box)

   A Climbable (Box)

   1. Go (x,y) : The monkey goes from location X to y.

   --- Content provided by​ FirstRanker.com ---

   2. Push (b, x, y) : Push a box b from location X to y.
   3. Climb Down (b) : Monkey climbs down from the box b.
2. (b) Give the advantages of Breadth first search over Depth First Search. (4)

FirstRanker.com

--- Content provided by⁠ FirstRanker.com ---