Scribd
Upload
60 views2 pages

Btech Cs 7 Sem Artificial Intelligence rcs702 2021

This document contains the questions and sections for a B.Tech theory examination in Artificial Intelligence. There are 7 questions divided into 3 sections. Section A contains 2 mark questions on topics like heuristic functions, supervised vs unsupervised learning, characteristics of agents, search techniques, forward and backward chaining, and Bayes' rule. Section B contains 3 7-mark questions on topics like DFS algorithm, well-formed formulas and rules of inference, statistical learning models, PCA vs LDA, and state space approach. Section C contains 2 7-mark questions to choose from on categories of AI, natural language processing, Alpha-Beta pruning, and constraint satisfaction problems.

Uploaded by

मधुसूदन सिंह
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
60 views2 pages

Btech Cs 7 Sem Artificial Intelligence rcs702 2021

This document contains the questions and sections for a B.Tech theory examination in Artificial Intelligence. There are 7 questions divided into 3 sections. Section A contains 2 mark questions on topics like heuristic functions, supervised vs unsupervised learning, characteristics of agents, search techniques, forward and backward chaining, and Bayes' rule. Section B contains 3 7-mark questions on topics like DFS algorithm, well-formed formulas and rules of inference, statistical learning models, PCA vs LDA, and state space approach. Section C contains 2 7-mark questions to choose from on categories of AI, natural language processing, Alpha-Beta pruning, and constraint satisfaction problems.

Uploaded by

मधुसूदन सिंह
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Printed Page: 1 of 2 

Subject Code: RCS702


0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0
 
B.TECH.
(SEM VII) THEORY EXAMINATION 2020-21
ARTIFICIAL INTELLIGENCE
Time: 3 Hours Total Marks: 70
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A
1. Attempt all questions in brief. 2 x 7 = 14
Qno. Question Marks CO
a) What is heuristic function? 2 CO1
b) Write the difference between supervised and unsupervised 2  CO4
learning.
c) List down the characteristics of agent. 2  CO1
d) List some of the uniform search technique. 2  CO2
e) Differentiate between forward and backward chaining. 2  CO3
f) What is bay’s rule? 2  CO5
g) Define reinforcement learning. 2  CO4
SECTION B

P
2. Attempt any three of the following: 7 x 3 = 21
0Q

1
Qno. Question Marks CO

13
29

a. Explain DFS algorithm with suitable example. 7 CO2

2.
0E

b. Define a well-formed formula (wff) and List some of the rules 7  CO3

24
of inference.
P2

5.
c. What are Statistical learning models? Show with suitable 7  CO4
_Q

.5
example. 17
d. Define PCA. Differentiate between Principle Component 7  CO5
TU

Analysis (PCA) and Linear Discriminant Analysis (LDA)


|1

e. Explain state space approach for solving any AI problem. 7  CO1


AK

SECTION C
2
1:

3. Attempt any one part of the following: 7x1=7


:4

Qno. Question Marks CO


13

a. Describe the four categories under which AI is classified with 7 CO1


examples.
1
02

b. List various components of natural language understanding 7 CO1


2

process. Describe syntactic analysis and semantic analysis in


b-

brief.
Fe

4. Attempt any one part of the following: 7x1=7


5-

Qno. Question Marks CO


|2

a. Explain Alpha-Beta pruning? Solve the following question- 7 CO2

AKTU_QP20E290QP | 25-Feb-2021 13:41:24 | 117.55.242.131


Printed Page: 2 of 2 
Subject Code: RCS702
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0
 
b. Discuss Constraint Satisfaction problem with an algorithm for 7 CO2
solving a Cryptarithmetic problem
BASE
+ BALL
GAMES

5. Attempt any one part of the following: 7x1=7


Qno. Question Marks CO
a. Explain resolution in predicate logic with suitable example. 7 CO3
b. Trace the operation of the unification algorithm on each of the 7 CO3
following pairs of literals:
I. f(Marcus) and f(Caesar)
II. f(x) and f(g(y))
III. f(Marcus, g(x, y)) and f(x, g(Caesar, Marcus)).
6. Attempt any one part of the following: 7x1=7
Qno. Question Marks CO
a. Define decision tree? Explain it’s with suitable example. 7 CO4

P
b. How can use Expectation-Maximization (EM Algorithm) in
0Q 7 CO4
machine learning? Explain with appropriate example.

1
13
29

7. Attempt any one part of the following: 7x1=7

2.
0E

24
Qno. Question Marks CO
P2

5.
a. Give the block diagram of pattern recognition system. Explain 7 CO5
_Q

in brief.
b. What do you mean by support vector machine (SVM)? Explain 7
.5 CO5
17
TU

in detail with suitable example.


|1

 
AK

2 4
1:
:4
13
1
2 02
b-
Fe
5-
|2

AKTU_QP20E290QP | 25-Feb-2021 13:41:24 | 117.55.242.131

You might also like