||Jai Sri Gurudev||
SJC INSTITUTE OF TECHNOLOGY, CHICKKABALLPUR
Dept. of Computer Science and Design
Tutorial 3
Sub: Machine Learning(BCM601) Semester: 6 Date: 18/05/2025
Module 4: Models Based on Decision Trees & Bayesian Learning
1. Identify and explain the working mechanism of the Naïve Bayes classifier.
2. Construct a decision tree and predict the target class for a test instance (6, 1, 6.7) with the training
dataset consisting of 10 data instances and 3 attributes.
3. Apply ID3 algorithm for constructing decision tree for the following training example.
4. Explain the procedure to construct decision tree using C4.5 with example and Compare entropy,
Gini index, and classification error as impurity measures in decision trees.
5. Describe the working mechanism of the Brute force Bayes classifier and illustrate the Gibbs
algorithm with an example.
6. Explain the procedure to construct a Decision tree using CART with example and explain the
concept of Gain index and Gini index
7. Apply C4.5 algorithm for constructing decision tree for the following training example.
8. Explain the procedure to construct regression trees with example and explain the concept of
Entropies.
Module 2: Clustering & Reinforcement Learning:
9. Describe the Single Linkage (MIN) algorithm, demonstrate the process of identifying clusters with
it, and also create the corresponding dendrogram.
10. Explain the Partitional Clustering Algorithm with its advantages, disadvantages and example.
11. With neat Sketch Explain the components of reinforcement learning.
12. Detail the scope of reinforcement Learning.
13. What are Clustering Patterns and Detail about the Clustering Approaches?
14. Explain the Concept of Divisive clustering and Agglomerative clustering algorithms with an
example.
15. Explain the concept of reinforcement learning with an example.
16. Explain the concept of Q-Learning with an example.