StudyFox
कीमतेंब्लॉगएक्सटेंशनमुफ़्त टूल
  • कीमतें
  • ब्लॉग
  • एक्सटेंशन
  • मुफ़्त टूल
  • शुरू करेंसाइन इन
StudyFox

अपने नोट्स, PDF और स्लाइड्स को फ़्लैशकार्ड, क्विज़, नोट्स और माइंड मैप में बदलें।

StudyFox खोलें

स्टडी टूल्स

  • होमवर्क हेल्पर
  • नोट मेकर
  • फ़्लैशकार्ड मेकर
  • क्विज़ मेकर
  • माइंड मैप मेकर

प्रोडक्ट

  • कीमतें
  • Chrome एक्सटेंशन
  • मुफ़्त एक्सटेंशन
  • स्टडी सेट देखें
  • ब्लॉग

सहायता

  • सहायता केंद्र
  • संपर्क करें
  • गोपनीयता नीति
  • सेवा की शर्तें

तुलना करें

  • Chegg का विकल्प
  • Course Hero का विकल्प
  • Coursology का विकल्प
  • Photomath का विकल्प
  • Gauthmath का विकल्प
  • PhotoSolve का विकल्प
  • CollegeTools का विकल्प
  • Transcript का विकल्प
  • SmartSolve का विकल्प
  • Homeworkify का विकल्प
  • AnswersAi का विकल्प
  • StudyX का विकल्प
  • Quizlet का विकल्प
  • Anki का विकल्प
  • Knowt का विकल्प
  • Brainscape का विकल्प
  • सभी तुलनाएँ

© 2026 StudyFox AI. सर्वाधिकार सुरक्षित।

  • X
  • Discord
  • Instagram
ExploreEngineering & TechData Science & AIMachine Learning Algorithms and Diagrams Quiz

Quiz · Medium

Machine Learning Algorithms and Diagrams Quiz

Applied questions on SVMs, trees, boosting, clustering, PCA, regularization and evaluation, with figures to read. For intro ML and data science courses.

by Kill h.23 questionsCreated Nov 20, 2026, 08:27 PM
Data Science & AI· Machine LearningTags#machine-learning#algorithms#quiz#diagrams

23 questions

  1. 1

    Which model is described as a 'lazy learner' because it does essentially no work at training time?

    • k-nearest neighbors

    • B

      Naive Bayes

    • C

      Logistic regression

    • D

      Linear SVM

    k-NN just stores the training data and does all the computation when a prediction is requested. Logistic regression, SVMs and naive Bayes all fit parameters during training.

  2. 2

    In the figure, what do the points lying exactly on the two outer lines (w·x - b = ±1) of a maximum-margin SVM represent?

    • A

      Cluster centroids

    • Support vectors

    • C

      Outliers that are removed before training

    • D

      Points the model misclassified

    Support vectors are the training points on (or inside) the margin. They alone determine the separating hyperplane; moving other points changes nothing.

  3. 3

    A naive Bayes spam filter sees a word in a new email that never appeared in any spam in the training data. Without smoothing, what happens?

    • The spam probability becomes 0 for that email

    • B

      The email is automatically classified as spam

    • C

      The model raises the word's weight

    • D

      The word is ignored

    The unseen word has estimated probability 0 given spam, which multiplies the whole product to 0. Laplace smoothing adds a small count to avoid this. The wrong choice 'ignored' would only be true if the model were built to skip zero counts.

  4. 4

    Which statement about random forests is correct?

    • Each tree sees a bootstrap sample and a random subset of features at each split

    • B

      Every tree is trained on the full data with all features

    • C

      They mainly reduce bias, not variance

    • D

      Trees are trained one after another, each correcting the last

    That randomness decorrelates the trees so averaging them lowers variance. Training trees sequentially on errors describes boosting.

  5. 5

    Which pair is correctly matched?

    • A

      Boosting trains independent models; bagging corrects errors

    • B

      Both train models strictly in parallel

    • C

      Bagging reduces bias; boosting reduces variance

    • Bagging trains models in parallel; boosting trains them sequentially

    Bagging is parallel and mainly cuts variance. Boosting is sequential, each learner focusing on the previous ensemble's mistakes, and mainly cuts bias.

  6. 6

    Why must features be standardized before running k-means?

    • Euclidean distance would be dominated by features with large numeric ranges

    • B

      It automatically picks k

    • C

      Standardizing removes outliers entirely

    • D

      k-means only works on values between 0 and 1

    A feature measured in thousands would swamp one measured in fractions when distances are computed. Scaling puts them on a common footing. It does not remove outliers or choose k.

  7. 7

    In this DBSCAN diagram, what is the blue point N?

    • A

      A core point

    • A noise point

    • C

      A cluster centroid

    • D

      A border point

    N has fewer than minPts neighbors within eps and is not within eps of any core point, so it is noise. Border points (yellow B and C) are within reach of a core point. Image: Chire, CC BY-SA 3.0, via Wikimedia Commons.

  8. 8

    Which clustering algorithm can find clusters of arbitrary shape and flag outliers, without being told the number of clusters?

    • A

      Gaussian mixture with fixed components

    • B

      k-means

    • C

      Hierarchical clustering with a fixed cut

    • DBSCAN

    DBSCAN groups dense regions and marks sparse points as noise. k-means needs k and assumes round clusters.

  9. 9

    What does the first principal component of the data in this plot represent?

    • The direction of greatest variance

    • B

      The mean of the data

    • C

      A line through the class boundary

    • D

      The direction along which the data vary the least

    PC1 is the direction of maximum variance: here the long diagonal of the cloud. The second component is perpendicular to it and holds the next most variance. Image: Nicoguaro, CC BY 4.0, via Wikimedia Commons.

  10. 10

    Which regularization method can drive some coefficients exactly to zero?

    • A

      Ridge (L2)

    • Lasso (L1)

    • C

      Neither: regularization only shrinks

    • D

      Both equally

    The L1 penalty has corners at zero that make sparse solutions likely. Ridge shrinks coefficients smoothly but rarely to exactly zero.

  11. 11

    Looking at this figure, which panel shows overfitting?

    • A

      Left (straight line)

    • B

      Middle (smooth curve)

    • Right (wiggly curve through points)

    • D

      None of them

    The right-hand curve chases noise in every point: low training error, high variance. The left line is too simple (underfitting). Image: Leomaurodesenv, CC BY-SA 4.0, via Wikimedia Commons.

  12. 12

    On the bias-variance plot, what happens to the Variance curve as model complexity increases?

    • It rises

    • B

      It first rises then falls

    • C

      It stays flat

    • D

      It falls

    More flexible models are more sensitive to the particular training sample, so variance increases. Bias squared falls with complexity.

  13. 13

    A model has AUC = 0.5. What does that mean?

    • A

      Its precision equals its recall

    • B

      It is perfect

    • C

      It is correct half the time on every class

    • It ranks no better than random guessing

    AUC is the probability that a random positive gets a higher score than a random negative. 0.5 is chance (the diagonal of the ROC plot). Perfect is 1.0. Image: cmglee, MartinThoma, CC BY-SA 4.0, via Wikimedia Commons.

  14. 14

    In the precision-recall diagram, which region lowers RECALL?

    • A

      True positives

    • B

      False positives

    • C

      True negatives

    • False negatives

    False negatives are relevant items that were not retrieved: recall = TP / (TP + FN). False positives lower precision instead. Image: Walber, CC BY-SA 4.0, via Wikimedia Commons.

  15. 15

    You use 10-fold cross-validation. How many times does each observation serve as validation data?

    • A

      Nine times

    • B

      Zero times, because only the test set is used for validation

    • Once

    • D

      Ten times

    Each observation is in exactly one validation fold (and in the training data for the other nine). The ten scores are averaged. Image: Gufosowa, CC BY-SA 4.0, via Wikimedia Commons.

  16. 16

    Which of these is a data leakage mistake?

    • Fitting a scaler on the entire data set, then splitting

    • B

      Evaluating on the test set once at the end

    • C

      Standardizing using the training set's mean and standard deviation

    • D

      Using stratified sampling for the split

    Fitting the scaler on all the data lets information from the test rows influence preprocessing. Fit on training data only and apply to the rest.

  17. 17

    A model for a rare disease should rarely miss a sick patient. Which metric should you prioritize?

    • A

      Specificity

    • B

      Accuracy

    • Recall (sensitivity)

    • D

      Precision

    Recall measures the share of sick patients detected. Accuracy would look great if the model predicted 'healthy' for everyone.

  18. 18

    In reinforcement learning, what does the agent try to maximize?

    • A

      The immediate reward only

    • B

      The number of states visited

    • C

      The prediction accuracy on labeled data

    • The cumulative (discounted) reward

    The agent learns a policy that maximizes expected total reward over time, not just the next step. There are no labeled examples.

  19. 19

    True or False: Logistic regression is mainly used to predict continuous numeric values.

    • A

      True

    • False

    False. It predicts class probabilities, so it is a classification algorithm despite the name. Linear regression predicts continuous values.

  20. 20

    Which model would be LEAST affected if you did not scale the input features?

    • A

      Support vector machine with RBF kernel

    • B

      k-means

    • C

      k-NN

    • Random forest

    Tree splits only depend on the order of values within a feature. k-NN, SVMs and k-means all rely on distances.

  21. 21

    A decision tree reaches 100% training accuracy but 72% test accuracy. Which change is most likely to help?

    • Limiting depth or pruning

    • B

      Adding more identical copies of training rows

    • C

      Growing the tree deeper

    • D

      Removing the test set

    The gap shows overfitting. Limiting depth, pruning or requiring larger leaves simplifies the model. Making it deeper worsens it; duplicate rows add no new information.

  22. 22

    What does the oval in the bottom-left panel of this figure show?

    • A

      Specificity

    • Recall

    • C

      Precision

    • D

      Accuracy

    The oval covers the real-positive row: TP / (TP + FN), which is recall. Precision uses the predicted-positive column.

  23. 23

    In gradient boosting, what does each new tree try to fit?

    • A

      The original labels

    • B

      A random subset of features

    • The residual errors (negative gradient) of the current ensemble

    • D

      The average of all previous trees

    Each tree is trained on what the ensemble still gets wrong, then added with a small learning rate. Fitting the original labels again would not improve the ensemble.