Q. 1
Artificial Intelligence
Difficulty: Hard
(1 Mark)
In linear regression, what fundamental assumption is violated when the variance of the residuals is not constant across all levels of the independent variables?
A
Homoscedasticity (resulting in Heteroscedasticity)
✓ Correct
D
Linear independence of predictors
💡
Step-by-Step Explanation & Concept Rationale
Heteroscedasticity occurs when error terms have non-constant variance, leading to inefficient OLS coefficient standard error estimates.
Q. 2
Artificial Intelligence
Difficulty: Medium
(1 Mark)
Which regularization technique adds a penalty equal to the sum of the absolute values of the coefficients (L1 penalty) to the loss function, inducing feature sparsity?
A
Lasso Regression (L1 Regularization)
✓ Correct
B
Ridge Regression (L2 Regularization)
💡
Step-by-Step Explanation & Concept Rationale
Lasso adds lambda * sum(|beta_j|), driving irrelevant feature weights to exactly zero, thus performing automated feature selection.
Q. 3
Artificial Intelligence
Difficulty: Medium
(1 Mark)
What is the primary difference between L1 (Lasso) and L2 (Ridge) regularization?
A
L1 penalizes absolute magnitude and can set weights to zero; L2 penalizes squared magnitude and shrinks weights toward zero without setting them strictly to zero
✓ Correct
B
L1 is for classification only; L2 is for regression only
C
L1 increases model variance; L2 increases model bias
D
L1 is non-differentiable everywhere; L2 is non-convex
💡
Step-by-Step Explanation & Concept Rationale
L1 uses diamond-shaped contour constraints promoting sparse solutions; L2 uses spherical contours shrinking weights smoothly.
Q. 4
Artificial Intelligence
Difficulty: Medium
(1 Mark)
What does the 'Bias-Variance Tradeoff' represent in machine learning?
A
The conflict between an algorithm's error from erroneous assumptions (Bias) and its sensitivity to small fluctuations in training data (Variance)
✓ Correct
B
The trade-off between training speed and inference latency
C
The balance between dataset size and RAM usage
D
The compromise between CPU and GPU hardware costs
💡
Step-by-Step Explanation & Concept Rationale
High bias causes underfitting (oversimplified model); high variance causes overfitting (capturing noise). Total error = Bias^2 + Variance + Irreducible Noise.
Q. 5
Artificial Intelligence
Difficulty: Medium
(1 Mark)
In classification problems, which metric is defined as the harmonic mean of Precision and Recall?
💡
Step-by-Step Explanation & Concept Rationale
F1 = 2 * (Precision * Recall) / (Precision + Recall). It balances false positives and false negatives, especially in imbalanced datasets.
Q. 6
Artificial Intelligence
Difficulty: Medium
(1 Mark)
When evaluating a model on a highly imbalanced dataset (e.g. 99% non-flood, 1% flood disaster events), why is Accuracy a misleading performance metric?
A
A naive model predicting 'no flood' for all instances achieves 99% accuracy while completely failing to detect any real flood event
✓ Correct
B
Accuracy cannot be computed for binary classification
C
Accuracy only works for regression tasks
D
Accuracy requires all features to be standardized
💡
Step-by-Step Explanation & Concept Rationale
Accuracy paradox: high accuracy masks severe failure on the minority class. PR-AUC, F1-score, or Recall must be prioritized.
Q. 7
Artificial Intelligence
Difficulty: Medium
(1 Mark)
What is 'Precision' in a binary classification confusion matrix?
A
True Positives / (True Positives + False Positives)
✓ Correct
B
True Positives / (True Positives + False Negatives)
C
True Negatives / (True Negatives + False Positives)
D
True Positives + True Negatives / Total
💡
Step-by-Step Explanation & Concept Rationale
Precision (Positive Predictive Value) measures the proportion of predicted positive instances that were actually true positives.
Q. 8
Artificial Intelligence
Difficulty: Medium
(1 Mark)
What is 'Recall' (also known as Sensitivity or True Positive Rate)?
A
True Positives / (True Positives + False Negatives)
✓ Correct
B
True Positives / (True Positives + False Positives)
C
False Positives / (False Positives + True Negatives)
D
True Negatives / (True Negatives + False Negatives)
💡
Step-by-Step Explanation & Concept Rationale
Recall measures the model's ability to find all actual positive instances in the dataset.
Q. 9
Artificial Intelligence
Difficulty: Medium
(1 Mark)
What does an Area Under the ROC Curve (ROC-AUC) score of 0.5 indicate?
A
The classifier has performance equivalent to random guessing
✓ Correct
B
The classifier has perfect discrimination ability
C
The classifier makes 100% false positive predictions
D
The model is severely overfitted
💡
Step-by-Step Explanation & Concept Rationale
ROC-AUC plots TPR vs FPR across all classification thresholds; 0.5 is random chance, 1.0 is perfect classification.
Q. 10
Artificial Intelligence
Difficulty: Medium
(1 Mark)
In decision trees, which impurity measure is computed as 1 - sum(p_i^2) for class probabilities p_i?
A
Gini Impurity
✓ Correct
💡
Step-by-Step Explanation & Concept Rationale
Gini impurity measures the probability of misclassifying a randomly chosen element; it is the default criterion in CART trees.
Q. 11
Artificial Intelligence
Difficulty: Medium
(1 Mark)
What is the core ensemble mechanism behind 'Random Forest'?
A
Bagging (Bootstrap Aggregating) combined with random feature subspace selection at each split
✓ Correct
B
Sequential residual boosting with gradient descent
C
Linear stacking with meta-classifiers
D
Iterative hard voting on single decision trees
💡
Step-by-Step Explanation & Concept Rationale
Random Forest trains diverse decorrelated decision trees on bootstrap samples and aggregates their predictions via majority voting or averaging.
Q. 12
Artificial Intelligence
Difficulty: Hard
(1 Mark)
How does 'Gradient Boosting' (e.g. GBM, XGBoost, LightGBM) build its ensemble differently from Random Forest?
A
It trains trees sequentially, where each new tree is fitted to predict the pseudo-residuals (negative gradient of the loss function) of the previous ensemble
✓ Correct
B
It trains all trees completely in parallel on random bootstrap subsets
C
It drops random nodes during training like Dropout
D
It clusters training data using k-Means before fitting trees
💡
Step-by-Step Explanation & Concept Rationale
Boosting is additive and sequential; each base learner compensates for the errors of the preceding ensemble.
Q. 13
Artificial Intelligence
Difficulty: Hard
(1 Mark)
What key innovation allows XGBoost to achieve superior speed and accuracy compared to standard gradient boosting?
A
Second-order Taylor expansion of the loss function (Hessian), exact/approximate greedy split finding, built-in L1/L2 regularization, and sparsity-aware split finding
✓ Correct
B
Using neural network backpropagation exclusively
C
Eliminating the need for decision trees
D
Running only on quantum computers
💡
Step-by-Step Explanation & Concept Rationale
XGBoost incorporates first (gradient) and second (Hessian) derivatives in objective optimization along with shrinkage and column subsampling.
Q. 14
Artificial Intelligence
Difficulty: Hard
(1 Mark)
What is the primary architectural feature of LightGBM that makes it faster on large datasets than traditional gradient boosted trees?
A
Leaf-wise (best-first) tree growth, Histogram-based binning, Gradient-based One-Side Sampling (GOSS), and Exclusive Feature Bundling (EFB)
✓ Correct
B
Level-wise depth-first tree growth exclusively
C
Using radial basis functions in leaf nodes
D
Converting all numerical features into raw text strings
💡
Step-by-Step Explanation & Concept Rationale
LightGBM grows trees leaf-wise rather than level-wise, achieving lower loss with GOSS and histogram binning reducing memory and compute.
Q. 15
Artificial Intelligence
Difficulty: Hard
(1 Mark)
In Support Vector Machines (SVM), what is the 'Kernel Trick'?
A
Implicitly mapping input data into a higher-dimensional feature space where it becomes linearly separable, using inner product kernel functions without calculating coordinates explicitly
✓ Correct
B
Removing outliers by trimming extreme data points
C
Converting continuous labels into categorical classes
D
Optimizing weights using stochastic gradient descent
💡
Step-by-Step Explanation & Concept Rationale
The kernel trick computes inner products in high-dimensional Hilbert spaces using functions like RBF/Gaussian, Polynomial, or Sigmoid.
Q. 16
Artificial Intelligence
Difficulty: Hard
(1 Mark)
In SVM, what role does the hyperparameter 'C' play in the soft-margin formulation?
A
It controls the trade-off between maximizing the margin width and minimizing classification margin violations (slack errors)
✓ Correct
B
It sets the learning rate for gradient descent
C
It defines the number of decision trees in the ensemble
D
It sets the batch size during training
💡
Step-by-Step Explanation & Concept Rationale
Large C penalizes margin violations heavily (narrow margin, risk of overfitting); small C allows more margin violations (wider margin, higher bias).
Q. 17
Artificial Intelligence
Difficulty: Medium
(1 Mark)
In k-Nearest Neighbors (k-NN) classification, how does increasing the value of 'k' affect the model's decision boundary?
A
It smoothens the decision boundary, reducing model variance and increasing bias
✓ Correct
B
It makes the decision boundary more jagged and complex
C
It causes severe overfitting on training data
D
It reduces the training time to zero
💡
Step-by-Step Explanation & Concept Rationale
A small k (e.g. k=1) creates complex, noisy boundaries (overfitting); large k averages over broader neighborhoods (smoother, higher bias).
Q. 18
Artificial Intelligence
Difficulty: Medium
(1 Mark)
Why is feature scaling (e.g. StandardScaler or MinMaxScaler) mandatory prior to training distance-based algorithms like k-NN and k-Means?
A
Features with larger numerical ranges will dominate Euclidean distance calculations, rendering features with smaller scales virtually ineffective
✓ Correct
B
Distance algorithms will fail to compile without scaling
C
Scaling converts categorical features to integers
D
Scaling eliminates all missing values in data
💡
Step-by-Step Explanation & Concept Rationale
Euclidean distance is sensitive to scale; a feature in thousands (e.g. income) dwarfs a feature in decimals (e.g. ratios) unless standardized.
Q. 19
Artificial Intelligence
Difficulty: Medium
(1 Mark)
What is the fundamental assumption of the 'Naive Bayes' classifier that gives it the name 'Naive'?
A
All features are mutually independent of each other given the class label
✓ Correct
B
All features follow a perfectly uniform distribution
C
The target classes are always perfectly balanced
D
The data contains no outliers or missing values
💡
Step-by-Step Explanation & Concept Rationale
Naive Bayes assumes conditional independence: P(x1, x2 | y) = P(x1 | y) * P(x2 | y), which simplifies probability computation drastically.
Q. 20
Artificial Intelligence
Difficulty: Medium
(1 Mark)
In k-Means clustering, what does the 'Elbow Method' evaluate to help select the optimal number of clusters (k)?
A
The Within-Cluster Sum of Squares (WCSS / Inertia) plotted against k, looking for the point of diminishing returns
✓ Correct
B
The classification accuracy on holdout test set
C
The F1-score across multiple clusters
D
The gradient norm during backpropagation
💡
Step-by-Step Explanation & Concept Rationale
As k increases, WCSS decreases; the 'elbow' inflection point identifies where adding more clusters yields marginal variance reduction.
Q. 21
Artificial Intelligence
Difficulty: Hard
(1 Mark)
What metric measures how similar an object is to its own cluster compared to other clusters, ranging from -1 to +1?
A
Silhouette Coefficient (Silhouette Score)
✓ Correct
D
Calinski-Harabasz Index
💡
Step-by-Step Explanation & Concept Rationale
Silhouette score: (b - a) / max(a, b), where a is mean intra-cluster distance and b is mean nearest-cluster distance. +1 indicates well-clustered samples.
Q. 22
Artificial Intelligence
Difficulty: Hard
(1 Mark)
What is the primary advantage of DBSCAN (Density-Based Spatial Clustering of Applications with Noise) over k-Means?
A
It can discover clusters of arbitrary shapes and automatically identifies noise/outliers without requiring the number of clusters to be pre-specified
✓ Correct
B
It guarantees spherical clusters of identical diameter
C
It operates in linear O(1) time complexity
D
It works exclusively on text data
💡
Step-by-Step Explanation & Concept Rationale
DBSCAN groups points based on density reachability (eps and min_samples), isolating sparse noise points as outliers.
Q. 23
Artificial Intelligence
Difficulty: Hard
(1 Mark)
In Principal Component Analysis (PCA), how are the principal components constructed from the data covariance matrix?
A
As the eigenvectors corresponding to the largest eigenvalues of the covariance matrix
✓ Correct
B
As random orthogonal projections across features
C
As non-linear kernel transformations minimizing cross-entropy
D
As decision tree leaf node assignments
💡
Step-by-Step Explanation & Concept Rationale
Eigenvectors define the principal axes of maximum variance, while eigenvalues quantify the variance explained along each component.
Q. 24
Artificial Intelligence
Difficulty: Medium
(1 Mark)
Why must features be centered (zero mean) and scaled before performing Principal Component Analysis (PCA)?
A
To ensure that high-variance unscaled features do not artificially dominate the first principal component
✓ Correct
B
PCA cannot compute matrix determinants without scaling
C
To convert categorical features into continuous variables
D
To ensure the data follows a Poisson distribution
💡
Step-by-Step Explanation & Concept Rationale
PCA maximizes variance; features with larger raw magnitudes will otherwise dominate the covariance matrix regardless of information content.
Q. 25
Artificial Intelligence
Difficulty: Hard
(1 Mark)
What is the primary difference between PCA and t-SNE (t-Distributed Stochastic Neighbor Embedding)?
A
PCA is a linear technique preserving global variance; t-SNE is a non-linear probabilistic technique preserving local neighborhood structures (ideal for 2D/3D visualization)
✓ Correct
B
PCA is supervised; t-SNE is unsupervised
C
PCA is for text only; t-SNE is for images only
D
PCA requires GPUs; t-SNE runs on microcontrollers
💡
Step-by-Step Explanation & Concept Rationale
t-SNE minimizes the Kullback-Leibler divergence between high-dimensional joint probabilities and low-dimensional Student-t probabilities.