Machine learning ECE 15EC834

QUESTION BANK

MODULE-1

Questions.

INTRODUCTION AND CONCEPT LEARNING

1. Define the following terms:

a. Learning
b. LMS weight update rule
c. Version Space
d. Consistent Hypothesis
e. General Boundary
f. Specific Boundary
g. Concept
2. What is Machine Learning? Explain different perspective and issues in machine learning.
3. List and explain the steps to design a learning system in detail.
4. Illustrate the candidate elimination algorithm with suitable example.
5. What are the important objectives of machine learning?
6. What do you mean by a well –posed learning problem? Explain the important features that
are required to well –define a learning problem.
7. Explain the inductive biased hypothesis space and unbiased learner
8. What are the basic design issues and approaches to machine learning?
9. How is Candidate Elimination algorithm different from Find-S Algorithm
10. How do you design a checkers learning problem?
11. Explain the various stages involved in designing a learning system
12. Differentiate between Training data and Testing Data
13. Differentiate between Supervised, Unsupervised and Reinforcement Learning
14. What are the issues in Machine Learning?
15. Explain the List Then Eliminate Algorithm with an example
16. What is the difference between Find-S and Candidate Elimination Algorithm?
17. Explain the concept of Inductive Bias
18. With a neat diagram, explain how you can model inductive systems by equivalent deductive
systems
19. What do you mean by Concept Learning?

S.SHOBHA ASSOC.PROF SCE BENGALURU

Machine learning ECE 15EC834

MODULE-2

QUESTIONS

DECISION TREE LEARNING

1. What is decision tree and decision tree learning?

2. Explain representation of decision tree with an example.
3. What are appropriate problems for decision tree learning.
4. Discuss Entropy in ID3 algorithm with an example
5. Compare Entropy and Information Gain in ID3 with an example.
6. Describe hypothesis Space search in ID3 and contrast it with Candidate-Elimination algorithm.
7. Relate Inductive bias with respect to Decision tree learning.
8. Illustrate Occam’s razor and relate the importance of Occam’s razor with respect to ID3
algorithm.
9. List the issues in Decision Tree Learning. Interpret the algorithm with respect to Overfitting the
data.
10. Discuss the effect of reduced Error pruning in decision tree algorithm.
11. What type of problems are best suited for decision tree learning?
12. Write the steps of ID3Algorithm
13. What are the capabilities and limitations of ID3?
14. Define (a) Preference Bias (b) Restriction Bias
15. Explain the various issues in Decision tree Learning
16. Describe Reduced Error Pruning
17. What are the alternative measures for selecting attributes?
18. What is Rule Post Pruning?

ATRIFICIAL NUERAL NETWORKS

1. What is Artificial Neural Network?

2. What is Artificial Neural Network? Explain appropriate problem for Neural Network.
3. Explain the concept of a Perceptron with a neat diagram and represent the Boolean
functions of AND, OR using perceptron.
4. Learning with its characteristics.
5. What are the types of problems in which Artificial Neural Network can be applied?

S.SHOBHA ASSOC.PROF SCE BENGALURU

Machine learning ECE 15EC834

6. Explain the concept of a Perceptron with a neat diagram.

7. Write a note on (i) Perceptron Training Rule (ii) Gradient Descent and Delta Rule
8. Discuss the Perceptron training rule.
9. Write Stochastic Gradient Descent version of the Back-Propagation algorithm for feedforward
networks containing two layers of sigmoid units.
10. Under what conditions the perceptron rule fails and it becomes necessary to apply the delta rule
11. What do you mean by Gradient Descent?
12. Derive the Gradient Descent Rule.
13. What are the conditions in which Gradient Descent is applied?
14. What are the difficulties in applying Gradient Descent?
15. Differentiate between Gradient Descent and Stochastic Gradient Descent
16. Define Delta Rule.
17. Derive the Backpropagation rule considering the training rule for Output Unit weights and
Training Rule for Hidden Unit weights
18. Write the algorithm for Back propagation.

MODULE-3

BAYESIAN LEARNING

1. What is Bayesian learning? Explain features and difficulties of Bayesian learning?

2. Explain the concept of Bayes theorem with an example.
3. Explain Bayesian belief network and conditional independence with example.
4. What are Bayesian Belief nets? Where are they used?
5. Explain Brute force MAP hypothesis learner? What is minimum description length principle
6. Explain the k-Means Algorithm with an example.
7. How do you classify text using Bayes Theorem?
8. Define (i) Prior Probability (ii) Conditional Probability (iii) Posterior Probability
9. Explain Brute force Bayes Concept Learning
10. Explain the concept of EM Algorithm.
11. What is conditional Independence?
12. Explain Naïve Bayes Classifier with an Example.
13. Describe the concept of MDL.
14. Who are Consistent Learners?

S.SHOBHA ASSOC.PROF SCE BENGALURU

Machine learning ECE 15EC834

15. Discuss Maximum Likelihood and Least Square Error Hypothesis.

16. Describe Maximum Likelihood Hypothesis for predicting probabilities.
17. Explain the Gradient Search to Maximize Likelihood in a neural Net.

MODULE-4

INSTANCE-BASED LEARNING AND LEARNING SET OF RULES

1. Describe K-nearest Neighbor learning Algorithm for continues valued target function.
2. What is instance-based learning? explain features of instance-based learning.
3. Discuss the major drawbacks of K-nearest Neighbor learning Algorithm and how it can be
corrected.
4. Define the following terms with respect to K - Nearest Neighbor Learning:
i)Regression ii) Residual iii) Kernel Function.

4. Explain Locally Weighted Linear Regression.

5. Explain radial basis functions.

6. Explain case-based reasoning.

7. Compare Lazy and Eager learning.

MODULE-5

ANALYTICAL LEARNING, COMBINING INDUCTIVE AND ANALYTICAL LEARNING, REINFORCEMENT

LEARNING

1. Compare inductive and analytical learning.

2. Explain PROLOG-EGB algorithm
3. Explain features of explanation-based learning.
4. What is deductive learning.
5. Explain KBANN algorithm with an example.
6. Explain EBNN algorithm with an example.
7. Explain FOCL algorithm.
8. Write reinforcement learning algorithm characteristics.

S.SHOBHA ASSOC.PROF SCE BENGALURU

Machine learning ECE 15EC834

9. What is Reinforcement learning algorithm and explain Reinforcement learning problem with a
neat diagram.

S.SHOBHA ASSOC.PROF SCE BENGALURU

Machine learning ECE 15EC834

S.SHOBHA ASSOC.PROF SCE BENGALURU