SEMESTER EXAMINATION DECEMBER-2023

Course Name:- B.Tech Semester:- V

Paper Name: Artificial Intelligence Paper Code:- TCS 501
Max Marks-70
Time-3 Hrs + 20 minutes per hour extra time for V.I. &examinees with writer.
arfr ars-70

Instructions:
compulsory
" Thequestion paper consists of three sections namely A, B, C. AIl sections are
Section A- Each question carries 3 mark. Allquestions are compulsory.
words. Each
"Section B- Answer anv 5out of7 given questions in maximum one hundredfifty (150)
question carries 7 marks.
Section C- Answver any 2 out of 3 given questions in maxímum three hundred (300) words. Each
question carries 10 marks.

Section-A(u 3)
Objective Questions( t 8 TOTT
1. Answer all the following questions. 5x3 =15

What used in determining the nature of the learning problem?

a)Environment
b)Feedback
c)Problem
d) Allof the mentioned

ii) Which of the following is a component of Artificial Intelligence?

a) Learning
b) Training
c) Designing
d) Puzzling

ii)In artificial Intelligence, knowledge can be represented as

a) Predicate Logic
b) Propositional Logic

c) Compound Logic
d) Machine Logic
iv)What are the composition lor agents in
artificial intelligence?
a)Program
b)Architecture
c)BothProgram&Architecture
d) None of the mentioned
v) Which agent deals with happy and unhappy states

a)aimpleReflexAgent
b)ModelBasedAgent
c)LearningAgent
d) Utility based agent
Section -B(avE )
Short Answer Questions (aEsa T
2. Answer any five of the following questions in maximum 150 words. 5x7=35

Define Artificial Intelligent? List down the characteristics of intelligent system.

ii. What do you understand by problem formulation? Explain PEAS representation withAutomatd
car drive example.
iii. What is Searching? Differentiate between uninformed and informed search.
iv. What is Breadth first search? Explain the BFS strategy with algorithm.
V. How problem can be defined as state space search? Explain 8 puzzle problem.
vi. Discuss Simple reflex agent with its architecture. Differentiate between strong Al and weak AI.
vii. Explain Reinforcement Learning. What are the needs of Reinforcement Learning?

Section -C(qug-H)
Descriptive Questions taarucH& TM
3. Answer any two of the following question in maximum 300 words. 2x10=20

Explain Bayes Theorem and briefly discuss about Bayesian Belief Network.
ii) Explain the evolution of Artificial Intelligent in detail.
iii) Write short note on:
(a) Learning Agent
(b) Modus Ponens
(c) Disjunctive Syllogism
 28
Roli No.

Dr.ShakuntalaMisra National Renabilitation University, Lucknow

Institute of Engineering and Technology
Department of Computer Science
1st Sessional Examination- (2023-24)
Semester: 5th
Course Name: B.Tech. (CSE)
Paper Code: TCS-501
Subject Name: Artificial intelligence
examinees with writer.
Time- 1.5 Hrs+ 15 minutes per hour extra time for V.l. & Max Marks-20

Instructions:
and C. All sections
The question paper consists of three sections namely A, B,
are compulsory.
compulsory.
" Section A- Each question will carries 01 mark. Allquestions are
with maximum fifty
" Section B- Answer any 5 out of 6n the given questions
(50)words. Each question will carries 2 marks.
maximum one
" Section C- Answer any 1out of 2in the given questions in
hundred fifty (150) words. Each question will carries 5 marks.

Sectign -A
Objective Questions
5x1=05
1. Answer all the following questions

(i) Which of the following is not atype of Artificial Intelligence agent?

a) Learning Al b) Goal-based c) Simple reflex d) Unity-based
not
technique that was developed to determine whether a machine could or could
(ii) A
demonstrate the artificial intelligence known as the
a) Boolean Algebra b)Turing Test c) logarithm d) Algorithm

(ii) Which agent deals with the happy and unhappy state?
a) Utility-based b) Model-based c) Goal-based d) Learning Agent

(iv) Which data structure conveniently used to implement BFS?

a) Stacksb) Queues c) Priority Queues d) All of the mentioned
(v) Which search strategy is also called as blind search?
a) Uninformedsearch b) Informed searcn c) Simple reflex search d) Allof above
 ulsory.
Section-B 2 ds
Short Answer Type Questions
ds
2. Answer any five of the following questions inmaximum 50 words. 5x2=10
(i) Define goals of artificial intelligence.
(0)Differentiate between uninformed and informed search.
bi)Define PEAS representation and write PEAS for medical diagnosis system
(iv)What is heuristic search technique in Al?
(v)Briefly explain Bi-directional search.
(vi) Explain with diagram model-based agent.

Section-C 20
(Descriptive Questions)
3. Answer anyone question inimaximum 150words. 1x5-05
() Write short notes on the state of art of artificial
inteiligence and differentiate
between weak and stong Al.
(ii) How dces Chinese room argument
challenge Turing test?

influe
 Roil No. 283 3 2 s6 Den
Dr. Shakuntala Misra National
Rehabilitation University, Lucknow
Institute of Engineering and Technology
Department of Computer Science & Engg
Sessional Examination-2nd (2022-23)
Course Name: -B.Tech (CS) Semester: - 5th
Subject Name: - Artificial intelligence Paper Code: -TCS-501
Time - 1Hrs + 15 minutes per hour extra time for V.l.
& examinees with writer.
Max Marks-20

Instructions:
" The question paper consists of three
sections namely A, B, and C. All sections
are compulsory.
Section A- Each question will carries 01 mark. All questions are
Section B- Answer any 5 out of 6 in the given questions with compulsory.
(50) words. Each question will carries 2 marks. maximum fifty
" Section C- Answer any 1out of 2in
the given questions in maximum one
hundred fifty (150) words. Each question will carries 5 marks.

Section -A
1.
Objective Questions
Answer allthe following questions 5x1=05
Translate the following statement into FOL.
"For every a, if a is a PhD student, then a has a
master degree"
a) va PhD(a) -> Master(a) (b) a PhD(a) ->
fc) A is true, B is true Master(a)
I1.
td)A is false, Bis false
Apropositton has a specific truth value
(a)true (b) false
(c) true or false (d) none
II. Predicate logic isan extension of propositional logic having
a) predicate b)qualification ç) both d)
IV. How many types of quantifiers none
are there in AI
a) 2 b)3 c)4
V. The different types of d) 5
machine learning are?
a)supervised b)Unsupervised c) Reinforcement d) all of three inf
 hraa

Section-B
Short Answer Type Questions
2. Answer any five of the following questions in
maximum 50words. 5x2=10
1. Define Chain rule

II. Define Bayesian network

M. Define Hidden MarkoV model

IV. Define Markov decision process

V. Define how inferencing is done in Bayesian network
VI. Define active reinforcement learning.

Section-c
(Descriptive Questions)
3. Answer any one question in maximum 150 words. 1x5=05

I. Define Reinforcement learning

II. Consider the following Knowledge Base prove by resolution the goal
státement

a) The humidity is high or the sky is cloudy.

b) If the sky iscloudy, then it willrain.
c) If the humidity is high,ther it is hot.
d) It is not hot.
GOAL:It willrain
 SEMESTER EXAMINATION, DECEMBER -2022
Course Name:-B.Tech(CS) Semester:- 5
Paper Name:-Artificial Intelligence
Paper Code:-TCS-501
Time- 2 Hrs + 20 minutes per hour extra time for V.l. &
examinees with writer. Max Marks-70
fecocH 3/G-70
Instructions:
The question paper consists of threesections namely A, B, C.
Section A- Each question carries 04 marks. All sections are compulsory.
All questions are
compulsory.
Section B- Answer any 2out of 4 given questions in
question carries 10 marks. maximum hundred (150) words. Each
Section C- Answver any 2 out of 3 given questions in
question carries 15 marks. maximum five hundred (250) words. Each

Section -A(vG 3)
1. Objective Questions(gg WA)
Answer all the following questions.
5x4=20

Which of the following is not a type of Artificial

Intelligence agent?
a) Learning agent
b) Goal based agent
c) Simple reflexX agent
d) Unity based agent
ii Heuristic function h(n) is
a) Lowest path cost
b) Cheapest path from root to goal node
c) Estimated cost of
cheapest path from root to goal node
d) Average path cost
iii) Which algorithm is used for solving temporal
probabilistic reasoning?
a) Hillclimbing search
b) HMM
c) BFS
d) DFS
iv) Which search is equal to minimax search but
eliminates the branches that can't influence the final
decision?
a) DFS
b) BFS
c) Alpha-beta pruning
d) None of these
 Translate the following statement into FOL.
"For every a, if ais a PhD student, then a has a master degree"
a) a PhD(a) -> Master(a)
b) a PhD(a) -> Master(a)
c) Both
d) None of these

Section -B(ug-)
Short Answer Questions (Gst R)
2. Answer any two of the following questions in
maximum 150 words. 10x2=20
i) Explain in detail Markov Model and its
applications in
i) Differentiate between Uninformed and Informed SearchArtificial Intelligence.
iüü) Define Turing test and how does Chinese room technique.
iv) What is PEAS information? Design the argument challenge Turing test?
PEAS information for Taxi Driver
Agent.
DescriptiveSection-C(qug-H)
Questions (taGruIcHF TAT)
3. Answer any two of the following
question in maximum 250 words.
2x15-30
What is reinforcement learning. differentiate between
learning. active and passive
reinforcement
ii) Discuss the history of Al in brief.
iii)
Differentiate between utility-based Vs Goal based
Agent with the help of suitable
example