Computer Science & IT

Q. What is the primary goal of supervised learning?
  • A. To find hidden patterns in data
  • B. To predict outcomes based on labeled data
  • C. To cluster similar data points
  • D. To reduce dimensionality of data
Q. What is the primary goal of the K-means clustering algorithm?
  • A. Minimize the distance between points in the same cluster
  • B. Maximize the distance between different clusters
  • C. Both A and B
  • D. None of the above
Q. What is the primary objective of the K-means clustering algorithm?
  • A. To minimize the distance between points in the same cluster
  • B. To maximize the distance between different clusters
  • C. To create a hierarchical structure of clusters
  • D. To classify data into predefined categories
Q. What is the purpose of a confusion matrix?
  • A. To visualize the performance of a regression model
  • B. To summarize the performance of a classification model
  • C. To optimize hyperparameters
  • D. To reduce overfitting
Q. What is the purpose of cross-validation in machine learning?
  • A. To increase the size of the training dataset
  • B. To assess how the results of a statistical analysis will generalize to an independent dataset
  • C. To reduce the complexity of the model
  • D. To improve the speed of training
Q. What is the purpose of feature scaling in machine learning?
  • A. To increase the number of features
  • B. To improve the performance of the model
  • C. To reduce the size of the dataset
  • D. To convert categorical data to numerical
Q. What is the purpose of the elbow method in K-means clustering?
  • A. To determine the optimal number of clusters
  • B. To visualize the clusters formed
  • C. To assess the performance of the algorithm
  • D. To preprocess the data before clustering
Q. What type of data is K-means clustering best suited for?
  • A. Categorical data
  • B. Numerical data
  • C. Text data
  • D. Time series data
Q. Which algorithm is commonly used for clustering?
  • A. Linear Regression
  • B. K-Means
  • C. Support Vector Machine
  • D. Decision Tree
Q. Which clustering method is more suitable for discovering nested clusters?
  • A. K-means clustering
  • B. Hierarchical clustering
  • C. DBSCAN
  • D. Gaussian Mixture Models
Q. Which clustering method is more suitable for discovering non-globular shapes in data?
  • A. K-means clustering
  • B. Hierarchical clustering
  • C. DBSCAN
  • D. Gaussian Mixture Models
Q. Which distance metric is commonly used in K-means clustering?
  • A. Manhattan distance
  • B. Cosine similarity
  • C. Euclidean distance
  • D. Hamming distance
Q. Which evaluation metric is commonly used to assess the quality of clustering results?
  • A. Accuracy
  • B. Silhouette score
  • C. F1 score
  • D. Mean squared error
Q. Which evaluation metric is commonly used to assess the quality of clustering?
  • A. Accuracy
  • B. Silhouette score
  • C. F1 score
  • D. Mean squared error
Q. Which neural network architecture is primarily used for image recognition tasks?
  • A. Recurrent Neural Network
  • B. Convolutional Neural Network
  • C. Feedforward Neural Network
  • D. Generative Adversarial Network
Q. Which of the following clustering methods is best suited for discovering non-linear relationships in data?
  • A. K-means
  • B. Hierarchical clustering
  • C. DBSCAN
  • D. Gaussian Mixture Models
Q. Which of the following clustering methods is sensitive to outliers?
  • A. K-means
  • B. Hierarchical clustering
  • C. DBSCAN
  • D. Gaussian Mixture Models
Q. Which of the following is a characteristic of K-means clustering?
  • A. It can produce overlapping clusters
  • B. It is deterministic and produces the same result every time
  • C. It can handle noise and outliers effectively
  • D. It partitions data into non-overlapping clusters
Q. Which of the following is a characteristic of neural networks?
  • A. They require structured data only
  • B. They can learn complex patterns through layers
  • C. They are only used for classification tasks
  • D. They do not require any training data
Q. Which of the following is a common application of reinforcement learning?
  • A. Image recognition
  • B. Game playing
  • C. Data clustering
  • D. Text classification
Q. Which of the following is a common evaluation metric for classification models?
  • A. Mean Squared Error
  • B. Accuracy
  • C. Silhouette Score
  • D. R-squared
Q. Which of the following is a disadvantage of K-means clustering?
  • A. It is sensitive to outliers
  • B. It requires the number of clusters to be specified in advance
  • C. It can converge to local minima
  • D. All of the above
Q. Which of the following is a disadvantage of the K-means algorithm?
  • A. It can handle large datasets efficiently
  • B. It requires the number of clusters to be specified in advance
  • C. It is sensitive to outliers
  • D. It can be used for both supervised and unsupervised learning
Q. Which of the following is a limitation of the K-means algorithm?
  • A. It can handle non-spherical clusters
  • B. It requires the number of clusters to be specified in advance
  • C. It is computationally efficient for large datasets
  • D. It can be used for both supervised and unsupervised learning
Q. Which of the following is an example of a regression algorithm?
  • A. K-Means
  • B. Logistic Regression
  • C. Random Forest
  • D. Support Vector Classifier
Q. Which of the following is an example of unsupervised learning?
  • A. Image classification
  • B. Sentiment analysis
  • C. Market basket analysis
  • D. Spam detection
Q. Which of the following is NOT a common distance metric used in clustering?
  • A. Euclidean distance
  • B. Manhattan distance
  • C. Cosine similarity
  • D. Logistic distance
Q. Which of the following is NOT a method of linkage in hierarchical clustering?
  • A. Single linkage
  • B. Complete linkage
  • C. Average linkage
  • D. Random linkage
Q. Which of the following is NOT a step in the K-means clustering algorithm?
  • A. Assigning data points to the nearest centroid
  • B. Updating the centroid positions
  • C. Calculating the silhouette score
  • D. Choosing the initial centroids
Q. Which of the following is NOT a type of hierarchical clustering?
  • A. Single linkage
  • B. Complete linkage
  • C. K-means linkage
  • D. Average linkage
Showing 31 to 60 of 65 (3 Pages)