Scribd
Upload
28 views2 pages

Que. Paper - ARTIFICIAL INTELLIGENCE

Uploaded by

abhishek
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
28 views2 pages

Que. Paper - ARTIFICIAL INTELLIGENCE

Uploaded by

abhishek
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Hall Ticket No: Course Code: A8702

VARDHAMAN COLLEGE OF ENGINEERING


(AUTONOMOUS)

II B.Tech. I Semester Continuous Assessment - II, November - 2024


(Regulations: VCE-R22)
ARTIFICIAL INTELLIGENCE
(CSE – AIML / CSE – DS)
Date: 03 December 2024 Time: 2 Hours Maximum Marks: 30
Answer all questions in Part-A at one place only.
Answer any FOUR questions in Part-B.
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,
L2
and 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 (Multiple Choice / Fill in the Blanks / Match the Following / Short Answer Type Questions)
CO# BL# Marks
1. a) What is a model in a logical system.? CO3 L2 1M
b) Convert into CNF form: (R ∨ E) → (C → D) CO3 L3 1M
c) ”Represent the sentence “No student can fool all the other 1M
students” in First-order logic. CO3 L3

d) What do you mean by a "state" in automated planning? CO4 L2 1M


e) Justify the role of task in hierarchical Planning.? CO4 L2 1M
f) Identify two key applications of Automated planning CO4 L2 1M
g) What do you understand by exploration and exploitation in AI ? CO5 L2 1M
h) How a policy is decided by a Reinforcement learning (RL) agent? CO5 L4 1M
i) List out two applications of reinforcement learning. CO5 L2 1M
j) Unify the following : Knows(John,x) & Knows(y, smith) CO3 L3 1M
PART-B (Descriptive Questions)
2. “Every horse can outrun every dog. Some greyhounds can outrun every 5M
rabbit. Greyhounds are dogs. The relationship of being faster is transitive.
CO3 L3
Harry is a horse. Ralph is a rabbit.” Use resolution to prove Harry is faster
than Ralph.

3. Specify the rules of inference and skolemization in first-order logic (FOL). CO3 L2 5M

4. Define planning problem and how would you represent states, goals, and 5M
CO4 L3
actions using a suitable example.?

5. Construct and explain planning graph algorithm with sa uitable example. CO4 L3 5M
6. How would you analyse the differences between active and passive 5M
CO5 L4
reinforcement learning.

7. Discuss the importance of robot perception in autonomous robots. CO5 L2 5M

You might also like