Do you want to be a data scientist but don’t know what the interview will be like? I gathered these questions from doing and studying data science interviews. Here’s 10 questions you may see in a data science interview, with answers! These 10 data science interview questions are all multiple choice. There can be more than one correct answer for each question!

## 10 Questions Only Top Data Scientists Can Answer

For each question, choose all the correct answers. The average data scientist can get 6.5 correct, but the average interviewee can only get 3! How many can you get right?

- Movie Recommendation systems are an example of:
- Classification
- Clustering
- Reinforcement Learning
- Regression

- Sentiment Analysis is an example of:
- Regression
- Classification
- Clustering
- Reinforcement Learning

- Which of the following can act as possible termination conditions in K-Means?
- Reaching
*x*iterations - Assignments of observations to clusters stop changing between iterations.
- Centroids do not change between successive iterations.
- Terminate when Residual Sum of Squares falls below a threshold.

- Reaching
- Which of the following clustering algorithms suffers from the problem of convergence at local optima?
- K- Means clustering algorithm
- Agglomerative clustering algorithm
- Expectation-Maximization clustering algorithm
- Diverse clustering algorithm

- How can Clustering (Unsupervised Learning) be used to improve the accuracy of a Linear Regression model (Supervised Learning)?
- Creating different models for different cluster groups
- Creating an input feature for cluster ids as an ordinal variable.
- Creating an input feature for cluster centroids as a discrete variable.
- Creating an input feature for cluster size as a discrete variable.

- Which of the following types of datasets are not suited for K-Means Clustering?
- Datasets with many outliers
- Datasets with different densities
- Datasets with round shapes
- Datasets with non-convex shapes

- What is true about K-Means Clustering?
- K-Means is sensitive to cluster center initializations
- Bad initialization can lead to poor convergence speed
- Bad initialization can lead to bad overall clustering
- K-Means is only suitable for linearly separable datasets

- Which of the following should be applied to get the best results for K-Means Clustering?
- Run algorithm for different centroid initializations
- Adjust the number of iterations
- Test to find the optimal number of clusters
- Check the RSS after each time the algorithm runs and keep track

- List the answer choices in the correct order to perform a K-Means Clustering, leave out steps that are unnecessary.
- Assign each data point to the nearest cluster centroid
- Specify the number of clusters
- Re-assign each point to nearest cluster centroids
- Assign cluster centroids randomly
- Re-compute cluster centroids

- Which of the following metrics can we use for finding dissimilarity between two clusters in hierarchical clustering?
- Single-link
- Complete-link
- Average-link
- Triforce-link

## Correct Answers

- B, C
- You
*might*be able to argue that movie recommendation systems use classification, but they are most commonly examples of clustering or reinforcement learning. They are not examples of regression

- You
- A, B, D
- Sentiment analysis is one of my favorite NLP tasks. It uses regression, classification, and reinforcement learning, but not clustering. Topic detection, on the other hand, does use clustering.

- A, B, C, D
- These are all valid methods of ending your K-Means algorithm

- A, C
- K-Means and EM both suffer from the possibility of converging at local minimas. This is because of their randomized starts and the way that these multivariate graphs are structured. Meanwhile, agglomerative and diverse clustering algorithms don’t have this problem.

- A, B, C, D
- You can use all of these clustering techniques to help you improve your regression model. They add to the knowledge of the shape of the data.

- A, B, D
- K-Means clustering is fine on data with round shapes. Datasets with outliers throw off your centroids. Same for datasets with random densities. Since K-Means naturally lends itself to rounder datasets, non-convex data is obviously a challenge. For example, finding the means with the closest data won’t work on crescent shaped data.

- A, B, C
- All of them are true except K-Means can be used on datasets that aren’t linearly separable. K-Means lends itself best to circular datasets, but they do not have to be linearly separable, just grouped in chunks.

- A, B, C, D
- These are all standard methods applied to K-Means.

- B, D, A, E, C
- This is the right order of steps for doing a K-Means clustering.

- A, B, C
- Triforce-link is a joke. The other linkage methods are all real and valid.

I run this site to help you and others like you find cool projects and practice software skills. If this is helpful for you and you enjoy your ad free site, please help fund this site by donating below! If you can’t donate right now, please think of us next time.