1. Define Machine Learning? Explain the different types of Machine Learning.
2. Describe the main challenges faced in Machine Learning.
3. Using the Candidate Elimination algorithm, demonstrate how to find the Version Space
given the following set of hypotheses and examples.
4. Explain the concept of Version Spaces in Machine Learning.
5. Explain the machine learning process model along with diagram.
6. Explain in detail univariate data analysis.
7. Define big data? Explain Big data analysis framework?
8. Explain the process of obtaining Principle Component and its relevance in feature
reduction.
9. Explain the procedure for SVD? Carry out SVD on A=
10. Given the data in table, reduce the dimension from 2 to 1, using PCA algorithm.
X Y
2.5 2.4
0.5 0.7
2.2 2.9
1.9 2.2
3.1 3.0
2.3 2.7
2 1.6
1 1.1
1.5 1.6
1.1 0.9
11. Write a short note on a) Representation of a Hypothesis b) Hypothesis space c) Heuristic
space search.
12. Consider the following training data set of 4 instances shown in the table below. Apply
Find-S algorithm to find the final hypothesis.
Practical Communication Logical Job
CGPA Interactiveness Interest
Knowledge Skills Thinking offer
≥9 Yes Excellent Good Fast Yes Yes
≥9 Yes Good Good Fast Yes Yes
≥8 No Good Good Fast No No
≥9 Yes Good Good Slow No Yes
13. Why instant based learners are called lazy learners and compare instant based learning
and modeled based learning.
14. Consider the student training dataset of 8 data instances shown in the table. Based on the
performance of the student, classify the test instant (6.1, 40, 5) to check whether the
student will pass or fail in that course using KNN approach (K=3).
Project
Sl No CGPA Assessment Result
submitted
1 9.2 85 8 Pass
2 8 80 7 Pass
3 8.5 81 8 Pass
4 6 45 5 Fail
5 6.5 50 4 Fail
6 8.2 72 7 Pass
7 5.8 38 5 Fail
8 8.9 91 9 Pass
15. Write Find-S algorithm and discuss issues with the algorithm.
16. Describe the candidate algorithm. Find the maximum general hypothesis and maximum
specific hypothesis for the training examples given in the table using candidate
elimination algorithm.
Air Enjoy
Day Sky Humidity Wind Water Forecast
Temp. sports
1 Sunny Warm Normal Strong Warm Same Yes
2 Sunny Warm High Strong Warm Same Yes
3 Rainy Cold High Strong Warm Change No
4 Sunny Warm High Strong Cool Change Yes
17. Find the maximum general hypothesis and maximum specific hypothesis for the training
examples given in the table using candidate elimination algorithm.
SLNO SIZE COLOR SHAPE CLASS
1 BIG RED CIRCLE NO
2 SMALL RED TRIANGLE NO
3 SMALL RED CIRCLE YES
4 BIG BLUE CIRCLE NO
5 SMALL BLUE CIRCLE YES
18. Consider the training data set given in the table. Use Weighted-KNN and determine the
class using a given test instance (7.6, 60, 8) and for given K=3.
Project
Sl No CGPA Assessment Result
submitted
1 9.2 85 8 Pass
2 8 80 7 Pass
3 8.5 81 8 Pass
4 6 45 5 Fail
5 6.5 50 4 Fail
6 8.2 72 7 Pass
7 5.8 38 5 Fail
8 8.9 91 9 Pass
19. Consider a given data set with four instances shown in the table and apply Locally
Weighted Regression (LWR). Using linear regression model we have computed the
parameter β0=4.72 & β1=0.62 and given a test instance with x=2 and bandwidth = 0.4.
S. No Salary(in Lakhs) Expenditure(in Thousands)
1 5 25
2 1 5
3 2 7
4 1 8
20. Explain with an example Bivariate data and Multivariate data.
21. Write the difference between instant-based learning and Modeled based learning.
