Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
You are on page 1/ 3
Hall Ticket No: Course Code: A8702
VARDHAMAN COLLEGE OF ENGINEERING
(AUTONOMOUS) II B.Tech I Semester Regular Examinations, November - 2024 (Regulations: VCE-R22) ARTIFICIAL INTELLIGENCE (CSE-AIML/CSE-DS) Date: XX November 2024 Time: 3 Hours Maximum Marks: 60 Answer all questions at one place only. Course Outcomes with Bloom’s Levels:
Bloom’s CO# CO Statement Level (L#) CO1 Apply AI techniques to solve problems of game playing, theorem proving, and L2 machine learning. CO2 Apply the propositional logic to AI designs L2 CO3 Learn different knowledge representation techniques L2 CO4 Examine the role of searching strategies in AI environment L3 CO5 Analyse the constraint satisfaction problems for problem solving L3 Questions:
PART-A (Short Answer Type Questions)
CO# BL# Marks 1. a) Define an Intelligent Agent function. CO1 L2 1M b) The expression to compute acceptance probability in simulated annealing 1M CO1 L3 is given by____________? c) The pruning condition in alpha-beta search is __________? CO2 L3 1M d) Why wumpus world is a typical example of knowledge-based agent? CO2 L4 1M e) Express horn clause in logic? CO3 L2 1M f) State modus tollens rule in propositional logic. CO3 L2 1M g) Planning in is a search problem that utilizes knowledge representation 1M CO4 L2 and reasoning. TRUE/FALSE ? h) How would you define an action/operator in a planning problem? CO4 L2 1M i) Give an example of a Utility function in decision making. CO5 L4 1M j) How modularity can ensure the effectiveness of a robotic system? CO5 L3 1M PART-B (Descriptive Questions) 2. Analyze the types of environments for autonomous taxi driver 5M application. How do you assure that an agent program is an intelligent a) CO1 L3 agent program?
Solve the water Jug problem with the capacity of the two jugs of 3 and 4 liters with no marking in them. Given a water supply with a large storage b) using these two jugs, how can you separate 2 liters of water. Formulate CO1 5M L3 the problem, write production rules and draw the state space graph to provide the solution. (OR) c) Run the BFS and DFS till Goal G is found. Note that a new node is added CO1 L3 5M to OPEN only if not already present in OPEN or CLOSED. The moment when BFS and DFS finds G, what is CLOSED and OPEN list?
Elaborate on the following concepts in simulated annealing:
States Initial State ‘ d) CO1 L2 Actions 5M Transition Model Goal Test
3. Demonstrate how alpha–beta pruning is a better approach than a
a) CO2 L2 minimax approach in game playing. 5M Perform alpha-beta procedure in the game tree below with evaluation function values at leaves are 20, 82, 19, 99, 40, 50, 34, 91, 16, 60, 42, 65, 46, 73, 27, 97, 18, 44, 35, 12, 48, 15, 14, and 63.
b) CO2 L3 5M
(OR) Encode the following map coloring problem (using three colors) as a constraint satisfaction problem (CSP) and find one solution using backtracking search.
c) ‘ CO2 L2
5M
d) Illustrate the architecture of a knowledge-based agent with neat diagram. CO2 L2 5M
4. 5M Verify the validity of the following argument using Resolution refutation. Axioms: 1. Every horse can outrun every dog. 2. Some greyhounds can outrun every rabbit. a) 3. Greyhounds are dogs. CO3 L2 4. The relationship of being faster is transitive. 5. Harry is a horse. 6. Ralph is a rabbit. Conclusion: Harry is faster than Ralph
Given that: 6. P V Q b) 7. P --> R 5M CO3 L3 8. Q --> R Prove R (OR) c) Briefly express Inference rules in first-order predicate logic (FOPL)? CO3 L3 5M Define unification in the context of logic programming and automated 5M d) CO3 L3 reasoning.
5. Define Classical Planning and five suitable example using STRIPS
a) CO4 L3 (Stanford Research Institute Problem Solver) representation. 5M Using partial-order planning find the solution for the problem given in the figure below:
b) CO4 L3
5M
(OR) Describe the main features of GraphPlan and how it differs from 5M c) CO4 L3 traditional search-based planning methods. d) Discuss hierarchical planning using suitable example. CO4 L4 5M
6. a) Compare between dynamic programming and Markov decision process. CO5 L4 5M
Define reinforcement learning and describe its key components, including b) CO5 L2 the agent, environment, states, actions, rewards, and policy. 5M (OR)
What is robotics? Discuss its key components and the main objectives of c) CO5 L2 robotic systems. 5M Briefly explain various types of sensors used and their applications in d) CO5 L2 robotic systems. 5M
