Artificial Intelligence — DU B.Sc. (Prog) Physical Science courses pertaining to Computer Science Previous Year Question Papers

(b) Describe the following search strategies used in AI problem solving, with one suitable example each: (i) Informed Search (ii) Means-End Analysis (4+3) 4. Parts of a question should be attempted together. 1. (a) Describe the task environment of an intelligent agent. Wha t are t he properties of a task environment? Explain any three properties with one example each. (3) (b) Define and distinguish between the following with one example each : (iii) Artificial General Intelligence (AGI) (3) (c) Transform the following sentence into Conjunctive Normal Form (CNF) : (d) What are Production Rules in knowledge representation? How do production rules differ from logic-based representations? (3) 6. (a) Explain the pr ocess of Natural Language Understanding in AI. Discuss the major stages involved, including lexical analysis, syntactic analysis, semantic analysis, and pragmatic analysis with examples. (8) (b) Explain Frames as a knowledge representation technique. Design a frame network for an educational institution and provide one fully detailed frame for a college that includes slots for: name, type, location, departments, faculty strength, and affiliated university. (7) 7. (a) (i) Write the following statements in First-Order Predicate Logic (FOPL): All humans are mortal. Socrates is a human. Every student who studies hard passes the exam. (ii) Using the resolution principle, prove that Socrates is mortal. Write all steps, including conversion to CNF, negation of the goal, and derive the empty clause. (4+4) (b) Explain the A* algorithm using f(n) = g(n) + h(n). State the admissibility condition and discuss what happens when the heuristic overestimates the cost. Also briefly explain Best-First Search and how it differs from A*. (7) (e) What is a Horn Clause in Prolog? Give two examples of Horn clauses and explain their significance in logic programming. (3) 5. (f) Differentiate between Depth-First Search (DFS) and Breadth-First Search (BFS) with the help of an example. (3) (a) Write the Chomsky Hierarchy of Grammars with one example each for Type 0, Type 1, Type 2, and Type 3 grammars. How does it relate to natural language processing in AI? (7) (g) Define Modus Ponens rule in propositional logic. Elaborate with a suitable example. (3) (b) Implement a parse tree for the sentence: “The young student solved a difficult problem” using the following grammar rules: (h) What are the benefits and risks of AI? Write three benefits and risks of AI in today’s world. (i) Differentiate between Symbolic AI and Data- Driven AI with examples. (3) DET  the | a; ADJ  young | difficult: N  student | problem; V  solved Based on this parse tree, also draw the corresponding Recursive Transition Network (j) Write a Prolog program to implement generate_ fib(N, T) where T is the Nth term of the Fibonacci series. (3)