Scribd
Upload
149 views2 pages

MCS 224

Uploaded by

rpsjha
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
149 views2 pages

MCS 224

Uploaded by

rpsjha
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

Course Code : MCS-224

Course Title : Artificial Intelligence and Machine Learning


Assignment Number : MCAOL(III)/224/Assign/2024
Maximum Marks : 100
Weightage : 30%
Last date of Submission : 30th April, 2024 (for January session)
31st October, 2024 (for July session)

This assignment has sixteen questions of 5 Marks each, answer all questions. Rest 20 marks are
for viva voce. You may use illustrations and diagrams to enhance the explanations. Please go
through the guidelines regarding assignments given in the Programme Guide for the format of
presentation.

Q1: Classify AI on the basis of the functionalities of AI. Also discuss some important applications of AI.

Q2: Define Supervised, Unsupervised and Reinforcement learning with a suitable examples of each

Q3: Compare Artificial Intelligence, Machine Learning, and Deep Learning.

Q4: Find the minimum cost path for the 8-puzzle problem, where the start and goal state are given as
follows:

1 2 3 1 4 7

4 8 - - 8 6

7 6 5 2 3 5

Start State Goal State

Q5: Consider the following graph. The numbers written on edges represents the distance between the
nodes and the numbers written on nodes represents the heuristic value. Find the most cost- effective
path to reach from Noda A to node J using A* Algorithm.

10
A 2

4 5
1 F
3
3 B
2 4 G
H 3
D 2 1
3
1 2
I
2 C 7 2

5 5
E
3 3 J
3
Q6: Discuss the transforming an FOPL Formula into Prenex Normal Form with suitable example.
Also, discuss Skolomization with a suitable example.

Q7: Explain Forward Chaining Systems and Backward Chaining Systems with a suitable example
for each.

Q8: Prove that following properties hold for fuzzy sets


(i) Commutativity (ii) Associativity (iii) Distributivity (iv) Demorgan’s Law

Q9: Briefly discuss the various Ensemble methods.

Q10: What is logistic regression? Explain with the help of a suitable example.

Q11: Explain Decision Tree algorithm with the help of a suitable example.

Q12: Explain Naïve Bayes Classification Algorithm with a suitable example.

Q13: Explain K-Nearest Neighbors classification Algorithm with a suitable example.

Q14: For the given points of two classes red and blue:

Blue: { (1,2), (2,1), (1,-1), (1,-2)}


Red : { (3,1), (4,3), (3,5), (6,3)}

Plot a graph for the red and blue categories. Find the support vectors and optimal separating
line.

Q15: Compute the Linear Discriminant projection for the following two-dimensional dataset:
X1 =(x1, x2) = (4, 2), (2, 2), (3, 2), (3, 5), (3, 4)
X2 = (x1, x2) = (8, 7), (9, 6), (7, 7), (9, 8), (10, 9)

Q16: Explain FP Tree Growth Algorithm with a suitable example.

You might also like