NPTEL Data Mining Week 7 Assignment Answers 2025
1. A good clustering is one having:
A. Low inter-cluster distance and low intra-cluster distance
B. Low inter-cluster distance and high intra-cluster distance
C. High inter-cluster distance and low intra-cluster distance
D. High inter-cluster distance and high intra-cluster distance
Answer :- For Answers Click Here
2. Which of the following is an exploratory data mining technique?
A. Classification
B. Clustering
C. Regression
D. None of the above
Answer :-
3. Which of the following is a hierarchical clustering algorithm?
A. Single linkage clustering
B. K-means clustering
C. DBSCAN
D. None of the above
Answer :-
4. Which of the following clustering algorithm uses a dendogram?
A. Complete linkage clustering
B. k-means clustering
C. DBSCAN
D. None of the above
Answer :-
5. Which of the following clustering algorithm uses a minimal spanning tree?
A. Complete linkage clustering
B. Single linkage clustering
C. Average linkage clustering
D. DBSCAN
Answer :-
6. Distance between two clusters in single linkage clustering is defined as:
A. Distance between the closest pair of points between the clusters
B. Distance between the furthest pair of points between the clusters
C. Distance between the most centrally located pair of points in the clusters
D. None of the above
Answer :- For Answers Click Here
7. Distance between two clusters in complete linkage clustering is defined as:
A. Distance between the closest pair of points between the clusters
B. Distance between the furthest pair of points between the clusters
C. Distance between the most centrally located pair of points in the clusters
D. None of the above
Answer :-
8. Consider a set of five 2-dimensional points p1=(0, 0), p2=(0, 1), p3=(5, 8), p4=(5, 7), and p5=(0, 0.5). Euclidean distance is the distance function. Single linkage clustering is used to cluster the points into two clusters. The clusters are:
A. {p1, p2, p3} {p4, p5}
B. {p1, p4, p5} {p2, p3}
C. {p1, p2, p5} {p3, p4}
D. {p1, p2, p4} {p3, p5}
Answer :-
9. Which of the following is not true about K-means clustering algorithm?
A. It is a partitional clustering algorithm
B. The final cluster obtained depends on the choice of initial cluster centres
C. Number of clusters need to be specified in advance
D. It can generate non-convex cluster shapes
Answer :-
10. Consider a set of five 2-dimensional points p1=(0, 0), p2=(0, 1), p3=(5, 8), p4=(5, 7), and p5=(0, 0.5). Euclidean distance is the distance function. The k-means algorithm is used to cluster the points into two clusters. The initial cluster centers are p1 and p4. The clusters after two iterations of k-means are:
A. {p1, p4, p5} {p2, p3}
B. {p1, p2, p5} {p3, p4}
C. {p3, p4, p5} {p1, p2}
D. {p1, p2, p4} {p3, p5}
Answer :-
11. Which of the following is not true about the DBSCAN algorithm?
A. It is a density based clustering algorithm
B. It requires two parameters MinPts and epsilon
C. The number of clusters need to be specified in advance
D. It can produce non-convex shaped clusters
Answer :- For Answers Click Here
