IGNOU MCS-224 - Artificial Intelligence and Machine Learning

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: 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. 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.

Q1. Differentiate among Descriptive, Predictive and Prescriptive analytics performed under Machine Learning. Q2. What are Intelligent agents in AI? Briefly discuss the properties of Agents. Q3. Find the minimum cost path for the 8-puzzle problem, where the start and goal state are given as follows: Q4. 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. Q5. Discuss the transforming an FOPL Formula into Prenex Normal Form with suitable example. Also, discuss Skolomization with a suitable example. Q6. Explain Forward Chaining Systems and Backward Chaining Systems with a suitable example for each. Q7. Draw a semantic network for the following English statement: Shyam struck Neha and Neha’s father struck Shyam. Q8: Write short notes on following a) Reinforcement Learning b) Ensemble method Q9. Explain the phases of machine learning cycle Q10. Explain working of Back Propagation and Convolution Neural Network Q11. What is pattern search? Discuss the Apriori Algorithm for pattern search. 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,-2), (2,-2)} Red : { (4,-1), (4,1), (5,-1), (6,1)} Plot a graph for the red and blue categories. Find the support vectors and optimal separating line. Q15. Explain PCA with a suitable example. Q16. Explain A priory Algorithm with a suitable example.