CPQ Concept

Practice
2025 Questions

© WWW.MADEEASY.IN
 DATA SCIENCE & ARTIFICIAL INTELLIGENCE

01 Machine Learning
Learning

Q.1 Consider the following data points Point (P1) : Q.5 Consider the data points, grouped into a clusters
(3, 8), Point and (P2) : (4, 7). Using the K-means using the K-means clustering algorithm with an
clustering with a initial centroids of Cluster (K1) : initial means of K1 : 4.25 and K2 : 6.75.
(3, 4) and Cluster (K2) : (7, 4) to group the points Data points:
into a clusters. To which cluster above data 2.75, 7.85, 5.92, 6.75, 8.75, 4.25, 5.45, 7.78
points are grouped respectively. What are the new centroids of a clusters
respectively after the first iteration of a clusters.
Ans. (K 1 and K 1)
Q.6 Which of the following graph is used in the
Q.2 Consider the following data points grouped into
K-means clustering algorithm to specify the
a 2 clusters using K-means clustering. Initial
optimal K-value for the data points partitioning.
clusters are cluster (K1) members are {a1 and
(a) Bath-tub curve (b) Elbow curve
a3}. Cluster (K2) members are {a2, a4, a5}. After
(c) Dendogram (d) Eigen vector
the 1st iterations data point a4 is swapped into
‘K1’. What are the new centroids in the K-means Q.7 What is the primary goal of the K -means
clustering. clustering algorithm.
(a) To maximize the distance between the
Q.3 Consider the following data set and form
points in different clusters.
2 clusters using K-means clustering with an
(b) To minimize the distance between the points
initial centroids of K1 = 6, K2 = 10.
in the same cluster.
Data points: 5, 12, 8, 12, 20, 7, 24, 16, 3, 14.
(c) To maximize the number of clusters.
What are the final clusters using the rounding
(d) To minimize the number of clusters.
technique in the mean calculation.
Q.8 How is the number of clusters (K) typically
Q.4 Consider the following data points grouped into
chosen in K-means clustering?
a 2 clusters using K-means clustering algorithm.
(a) Arbitrarily
K1 : {P2, P6, P3, P7}
(b) Using the size of the data set
K2 : {P1, P4, P5, P8}
(c) Using the elbow method
After the 1st clustering, if even points all are
(d) It is always set to ‘3’
grouped into K1 and odd points all are grouped
into K2. What are the new centroids for the next Q.9 What is the purpose of the elbow method in
iteration. K-means clustering?
P1 : 13, P2 : 8, P3 : 5, P4 : 7, (a) To visualize the centroids of clusters
P5 : 6, P6 : 14, P7 : 4, P8 : 1. (b) To reduce the dimensionality of the data
Data points are: (c) To initialize the cluster centroids
a1 : (4, 5), a2 : (8, 6), a3 : (5,7), a4 : (2, 3), a5 : (9, 8) (d) To determine the optimal number of clusters.

© Copyright www.madeeasy.in
2 CPQ 2025 • Data Science & Artificial Intelligence

Q.10 Which of the following best describes K-means Q.15 Consider the data point set. What is the
clustering? dissimilar data matrix with respect to the data
(a) A supervised leaning algorithm for set.
classification. P1 : (6, 7), P2 : (3, 4), P3 : (5, 8), P4 : (2, 4)
(b) An unsupervised learning algorithm for
Q.16 Consider the following dissimilar matrix:
dimensionality reduction.
A B C D
(c) An unsupervised learning method algorithm
A 0
for partitioning the data points into a fixed
B 8 0
number of partitions.
C 2 9 0
(d) An unsupervised learning method to
B 7 5 4 0
represent the data grouping using
dendograms. What is the 2nd cluster formed using the single
linkage in the bottom-up clustering method.
Q.11 Which of the following linkage criteria is not
commonly used in the agglomerative clustering? Q.17 Consider the following dissimilar matrix and form
(a) Single linkage (b) Complete linkage the clusters using agglomerative clustering with
(c) Average linkage (d) Random linkage complete linkage technique.
A B C D
Q.12 In agglomerative clustering which of the
A 0
following is used to measure the dissimilarity
B 10 0
between two clusters?
C 8 9 0
(a) Euclidean distance criteria
B 12 6 7 0
(b) Manhattan distance criteria
(c) Linkage criteria What is the maximum distance between the
(d) Sum of square distance criteria 2nd cluster and 3rd cluster.

Q.13 Which linkage method considers the maximum Q.18 Which of the following is a characteristic of
distance between the points in different clusters? divisive clustering?
(a) Single linkage (b) Centroid linkage (a) Starts with many clusters and merges them
(c) Complete linkage (d) Average linkage (b) Starts with one cluster and splits it
(c) Relies heavily on centroid calculations
Q.14 What happens when the single linkage criteria
(d) Uses a fixed number of clusters from the
used in the agglomerative clustering?
beginning
(a) The algorithm always merges the pair of
clusters that have the minimum maximum Q.19 Consider the following minimal spanning tree.
distance. 3.4
(b) The algorithm always merges the pair of
clusters with the minimum average distance. 1.2
A B E
(c) The algorithm always merges the pair of
clusters with the minimum distance between 1.8 2.8
their closest points. C D

(d) The algorithm always merges the pair of What are the cluster formed using the top-
clusters with the minimum distance between bottom clustering technique.
their centroids.
„„„„

www.madeeasy.in © Copyright