0% found this document useful (0 votes)
96 views5 pages

MCS-224 Jun 2024

The document outlines the examination structure for the MCS-224 course on Artificial Intelligence and Machine Learning, scheduled for June 2024. It includes compulsory and optional questions covering various topics such as AI types, algorithms, and analytics. The exam consists of theoretical and practical applications, requiring students to demonstrate their understanding of key concepts in AI and machine learning.

Uploaded by

aneesohmzzz8
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
0% found this document useful (0 votes)
96 views5 pages

MCS-224 Jun 2024

The document outlines the examination structure for the MCS-224 course on Artificial Intelligence and Machine Learning, scheduled for June 2024. It includes compulsory and optional questions covering various topics such as AI types, algorithms, and analytics. The exam consists of theoretical and practical applications, requiring students to demonstrate their understanding of key concepts in AI and machine learning.

Uploaded by

aneesohmzzz8
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/ 5

Download other previous papers from www.ignoubaba.

com

No. of Printed Pages : 5 MCS–224

MASTER OF COMPUTER

APPLICATIONS (MCA-NEW)

Term-End Examination

June, 2024

MCS-224 : ARTIFICIAL INTELLIGENCE AND

MACHINE LEARNING

Time : 3 Hours Maximum Marks : 100

Weightage : 70%
Note : Question No. 1 is compulsory. Attempt any

three questions from the rest.

1. (a) Compare Artificial Narrow Intelligence

(ANI), Artificial General Intelligence (AGI)

and Artificial Super Intelligence (ASI). 6

P. T. O.
Download other previous papers from www.ignoubaba.com

[2] MCS–224

(b) Explain Chinese room test as Criticism to

Turing test, with suitable example. 5

(c) Write steps to transform FOPL (First

Order Predicate Logic) to PNF (Prenex

Normal Form). Apply the steps to

transform x (Q( x )  x R( x , y)) to PNF. 6

(d) Explain forward chaining systems with

suitable example. 6

(e) Draw block diagram for the machine

learning cycle. Also list the steps involved

in machine learning cycle. 6

(f) Explain the working of FP growth

algorithm. Give advantages of FP growth

over Apriori Algorithm. 6

(g) Compare clustering and classification. Give

suitable example for each. Also, list the

algorithms for each. 5


Download other previous papers from www.ignoubaba.com

[3] MCS–224

2. (a) Compare descriptive, predictive and


prescriptive analytics, performed under
machine learning. 6

(b) Explain Min-Max search algorithm with


suitable example. Give properties of Min-
Max search algorithm. Also, write its
advantages and disadvantages. 7

(c) Write and explain Depth First Search


(DFS) algorithm. Give time and space
complexity of DFS algorithm. Also give its
advantage and disadvantage. 7

3. (a) Given C(x) = “X is a used car dealer”, and


H(x) = “X is honest” then translate the
following into English sentences : 5

(i) x C( x )

(ii) x H( x )

(iii) x C( x )  ~ H( x )

(iv) x (C( x )  H( x ))

(v) x (H( x )  C( x ))

P. T. O.
Download other previous papers from www.ignoubaba.com

[4] MCS–224

(b) What do you understand by the term

„Resolution‟ in AI ? Discuss the utility of

Resolution mechanism in AI. Apply it to

conclude „Raman is mortal‟ from the

knowledge given below : 7

(i) Every man is mortal

(ii) Raman is a man

(c) Write short notes on any two of the

following, with suitable example for each :

(i) Frames

(ii) Scripts

(iii) Semantic nets

4. (a) Compare model-free reinforcement

learning with mode-based reinforcement

learning. Also, discuss the sub-classes of

model-free reinforcement learning. 6


Download other previous papers from www.ignoubaba.com

[5] MCS–224

(b) Write and explain Bayes‟ theorem. Also,

write and explain Naive Bayes‟ algorithm

with suitable example. 7

(c) Write short notes on any two of the

following (give example for each) : 7

(i) Support Vector Machines


(ii) Support Vector Regression
(iii) Polynomial Regression
5. Explain any four the following with suitable

example for each : 4×5=20

(a) Principal Component Analysis

(b) Apriori Algorithm

(c) Hierarchical Clustering

(d) Generative Adversarial Networks

(e) Auto Encoders

MCS–224

P. T. O.

You might also like