|
|
Title Name | IGNOU MCS 224 2024 Solution |
---|---|
Type | Soft Copy (E-Assignment) .pdf |
University | IGNOU |
Degree | MASTER DEGREE PROGRAMMES |
Course Code | MCA-NEW |
Course Name | Master of Computer Application |
Subject Code | MCS 224 |
Subject Name | Artificial Intelligence and Machine Learning |
Year | 2024 |
Session | - |
Language | English Medium |
Assignment Code | MCS-224/Assignmentt-1//2024 |
Product Description | Assignment of MCA-NEW (Master of Computer Application) 2024. Latest MCS 224 2024 Solved Assignment Solutions |
Last Date of IGNOU Assignment Submission | Last Date of Submission of IGNOU MCS-224 (MCA-NEW) 2024 Assignment is for January 2024 Session: 30th September, 2024 (for December 2024 Term End Exam). Semester Wise January 2024 Session: 30th March, 2024 (for June 2024 Term End Exam). July 2024 Session: 30th September, 2024 (for December 2024 Term End Exam). |
Assignment Code | MCS 224/2024 |
|
Ques 1.
Classify AI on the basis of the functionalities of AI. Also discuss some important applications of AI.
Ques 2.
Define Supervised, Unsupervised and Reinforcement learning with a suitable examples of each
Ques 3.
Compare Artificial Intelligence, Machine Learning, and Deep Learning.
Ques 4.
Find the minimum cost path for the 8-puzzle problem, where the start and goal state are given as follows:
Start State
1 | 2 | 3 |
4 | 8 | - |
7 | 6 | 5 |
Goal State
1 | 4 | 7 |
- | 8 | 6 |
2 | 3 | 5 |
Ques 5.
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
Ques 6.
Discuss the transforming an FOPL Formula into Prenex Normal Form with suitable example. Also, discuss Skolomization with a suitable example.
Ques 7.
Explain Forward Chaining Systems and Backward Chaining Systems with a suitable example for each.
Ques 8.
Prove that following properties hold for fuzzy sets
(i) Commutativity
(ii) Associativity
(iii) Distributivity
(iv) Demorgan’s Law
Ques 9.
Briefly discuss the various Ensemble methods.
Ques 10.
What is logistic regression? Explain with the help of a suitable example.
Ques 11.
Explain Decision Tree algorithm with the help of a suitable example.
Ques 12.
Explain Naïve Bayes Classification Algorithm with a suitable example.
Ques 13.
Explain K-Nearest Neighbors classification Algorithm with a suitable example.
Ques 14.
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.
Ques 15.
Compute the Linear Discriminant projection for the following two-dimensional dataset:
= (4, 2), (2, 2), (3, 2), (3, 5), (3, 4)
= (8, 7), (9, 6), (7, 7), (9, 8), (10, 9)
Ques 16.
Explain FP Tree Growth Algorithm with a suitable example.
|
IGNOU Doubts & Queries
Click to Contact Us
Call - 9199852182 Call - 9852900088 myabhasolutions@gmail.com WhatsApp - 9852900088