Reg. No. Reg. No.
CHENDHURAN COLLEGE OF ENGINEERING AND TECHNOLOGY CHENDHURAN COLLEGE OF ENGINEERING AND TECHNOLOGY
Pilivalam (Po), Thirumayam (Tk), Pudukkottai (Dt.) – 622 507. Pilivalam (Po), Thirumayam (Tk), Pudukkottai (Dt.) – 622 507.
M.E- I- Year-II Semester (CS) (2021-2023) M.E- I- Year-I Semester (CS) (2021-2023)
CP4252-MACHINE LEARNING CP4252-MACHINE LEARNING
SET-I Date: - / /2022 SET-II Date: - / /2022
Cycle test-I Marks: 100 Cycle test-I Marks: 100
Answer All Questions Time: 3 hours Answer All Questions Time: 3 hours
PART-A (10X2=20) PART-A (10X2=20)
1. What is machine learning? 1. Define Machine Learning.
2. List out applications of Machine Learning. 2. List out types of Machine Learning Problems.
3. Define Vector Calculus. 3. Differentiate between Information theory and Decision theory.
4. Justify Bayesian Conditional Probability. 4 What is meant by Linear Regression?
5. Define Least Square. 5. List out the advantages of ID3.
6. What is CART? 6. Define Kernel Methods.
7. Define Ensemble Method. 7 Discuss about Random Forest.
8. Write Evaluation of classification Algorithm. 8. Define K-Nearest Neighbors.
9. Define Hierarchical Clustering. 9. What is meant by Clustering Algorithm?
10. Examine the various Clustering methods. 10. Describe the Principal component analysis.
PART B – (5X13=65) PART B – (5X13=65)
11. Explain in detail about Machine Learning Process with an example. 11. (i) Describe the concept of Mathematical Foundations. (7)
(13)
(ii) Describe the Decision Tree method with examples. (6)
(OR)
(OR)
12. (i)Explain in detail about Linear Algebra & Analytical Geometry. (7)
12. Explain about Vector calculus and Optimization with suitable example. (13)
(ii) Discuss the various application of Machine Learning. (6)
13. (i)What is Bayesian Conditional Probability? (7)
13. (i)Write about Decision Tree Algorithm with example. (7)
(ii)Discuss in detail types of Machine Learning Process. (6)
(ii) Describe how the MLP is designed to be an Information theory. (6)
(OR)
(OR)
14. (i)Summarize about Linear Algebra & Analytical Geometry algorithm. (7)
14. Explain in detail about Vector calculus and Optimization. (13)
(ii)List out advantages and disadvantages of Machine Learning. (6)
15. Illustrate the Discriminative and Generative Models with example. (13) 15. Explain the following Statistics
(OR) (i) ID3. (6)
16. (i)Illustrate the Support Vector Machines. (7) (ii) CART. (7)
(ii)Illustrate Gradient Linear Models. (6) (OR)
17. Explain the - Evaluation of Classification Algorithms with suitable 16. (i) Describe the K-Nearest Neighbor Algorithm. (7)
Example. (13) (ii)Write in detail about Nearest Neighbor Smoothing. (6)
(OR) 17. (i)Write in detail about Decision Tree. (7)
18. Describe in detail about (ii)Write in detail Classification and Regression Tree (CART). (6)
(i) K-Nearest Neighbors algorithm. (7) (OR)
(ii)Logistic Regression. (6) 18. (i)Identify the difference between Tree based Methods. (7)
19. (i) Explain in detail about Clustering Algorithms. (7) (ii)Discuss an example for the Ensemble method. (6)
(ii) Explain about Hierarchical Algorithm with example. (6) 19. Explain the K-Means Algorithm with suitable example. (13)
(OR) (OR)
20. Describe the Cluster Validity method with explain about this algorithm. 20. (i)Describe in detail about Hierarchical Algorithm with example. (7)
(13) (ii)Discuss about the clustering method. (6)
PART C– (1X15=15) PART C – (1X15=15)
21. Discuss in detail the working of Support Vector Machine, its 21. (i)Create an example and explain about Lasso Regression. (8)
. Implementation and examples. (15) (ii)Describe the Linear Regression Method. (7)
(OR) (OR)
22. (i)What is CART? (8) 22. (i)Explain about K-Means Algorithm with an example. (8)
(ii) Explain the K- Nearest Neighbor methods with example. (7) (ii) Explain about Normalization and Vector Quantization. (7)