Q. Which of the following is a key advantage of using Random Forests?
-
A.
They are easier to interpret than Decision Trees
-
B.
They can handle missing values well
-
C.
They require less computational power
-
D.
They always outperform Decision Trees
Solution
Random Forests can handle missing values effectively by using multiple trees to fill in gaps.
Correct Answer:
B
— They can handle missing values well
Learn More →
Q. Which of the following is a key advantage of using Support Vector Machines?
-
A.
They require large amounts of data
-
B.
They can handle non-linear data using kernels
-
C.
They are only suitable for binary classification
-
D.
They are easy to interpret
Solution
Support Vector Machines can effectively handle non-linear data by using kernel functions to transform the input space.
Correct Answer:
B
— They can handle non-linear data using kernels
Learn More →
Q. Which of the following is a key advantage of using SVM?
-
A.
It can only handle linear data
-
B.
It is less effective with high-dimensional data
-
C.
It is effective in high-dimensional spaces
-
D.
It requires a large amount of training data
Solution
SVM is particularly effective in high-dimensional spaces, making it suitable for various applications, including text classification.
Correct Answer:
C
— It is effective in high-dimensional spaces
Learn More →
Q. Which of the following is a key advantage of using SVMs?
-
A.
They require large amounts of data
-
B.
They can handle non-linear boundaries
-
C.
They are only suitable for binary classification
-
D.
They are less interpretable than decision trees
Solution
SVMs can effectively handle non-linear boundaries through the use of kernel functions.
Correct Answer:
B
— They can handle non-linear boundaries
Learn More →
Q. Which of the following is a key application of AVL trees?
-
A.
Implementing a priority queue
-
B.
Database indexing
-
C.
Graph traversal
-
D.
Sorting algorithms
Solution
AVL trees are often used in database indexing because they provide fast search, insert, and delete operations while maintaining a balanced structure.
Correct Answer:
B
— Database indexing
Learn More →
Q. Which of the following is a key characteristic of binary search?
-
A.
It can find the first occurrence of an element
-
B.
It can find the last occurrence of an element
-
C.
It requires a sorted array
-
D.
It can work on any data structure
Solution
A key characteristic of binary search is that it requires a sorted array to function correctly.
Correct Answer:
C
— It requires a sorted array
Learn More →
Q. Which of the following is a key consideration when deploying a model for real-time predictions?
-
A.
Model complexity
-
B.
Data quality
-
C.
Latency requirements
-
D.
Training data size
Solution
Latency requirements are crucial for real-time predictions, as the model must respond quickly to user requests.
Correct Answer:
C
— Latency requirements
Learn More →
Q. Which of the following is a key feature of SVMs?
-
A.
They can only handle linear data
-
B.
They use kernel functions to handle non-linear data
-
C.
They require a large amount of labeled data
-
D.
They are not suitable for multi-class classification
Solution
SVMs utilize kernel functions to transform data into higher dimensions, allowing them to handle non-linear relationships.
Correct Answer:
B
— They use kernel functions to handle non-linear data
Learn More →
Q. Which of the following is a key requirement for implementing binary search?
-
A.
The array must be sorted
-
B.
The array must be of even length
-
C.
The array must contain integers only
-
D.
The array must be in ascending order
Solution
The key requirement for implementing binary search is that the array must be sorted.
Correct Answer:
A
— The array must be sorted
Learn More →
Q. Which of the following is a key step in Dijkstra's algorithm?
-
A.
Updating the distance of adjacent vertices
-
B.
Sorting the vertices
-
C.
Removing the vertex from the graph
-
D.
Adding edges to the graph
Solution
A key step in Dijkstra's algorithm is updating the distance of adjacent vertices based on the current vertex's distance.
Correct Answer:
A
— Updating the distance of adjacent vertices
Learn More →
Q. Which of the following is a key step in the K-means algorithm?
-
A.
Calculating the mean of all data points
-
B.
Assigning data points to the nearest cluster centroid
-
C.
Performing hierarchical clustering
-
D.
Normalizing the data
Solution
A key step in K-means is assigning data points to the nearest cluster centroid based on distance.
Correct Answer:
B
— Assigning data points to the nearest cluster centroid
Learn More →
Q. Which of the following is a limitation of binary search?
-
A.
It can only be used on sorted data
-
B.
It is slower than linear search
-
C.
It requires more memory
-
D.
It cannot find duplicates
Solution
A key limitation of binary search is that it can only be applied to sorted data.
Correct Answer:
A
— It can only be used on sorted data
Learn More →
Q. Which of the following is a limitation of Dijkstra's algorithm?
-
A.
It cannot handle negative weight edges
-
B.
It is not efficient for dense graphs
-
C.
It cannot find paths in directed graphs
-
D.
It requires a complete graph
Solution
Dijkstra's algorithm cannot handle graphs with negative weight edges, as it may lead to incorrect results.
Correct Answer:
A
— It cannot handle negative weight edges
Learn More →
Q. Which of the following is a limitation of hierarchical clustering?
-
A.
It can only handle small datasets
-
B.
It requires prior knowledge of the number of clusters
-
C.
It is not sensitive to noise
-
D.
It cannot produce a dendrogram
Solution
Hierarchical clustering can be computationally expensive and is generally limited to smaller datasets due to its complexity.
Correct Answer:
A
— It can only handle small datasets
Learn More →
Q. Which of the following is a limitation of K-Means clustering?
-
A.
It can handle large datasets
-
B.
It is sensitive to outliers
-
C.
It can find non-convex clusters
-
D.
It requires no prior knowledge of data
Solution
K-Means is sensitive to outliers, which can skew the results and affect cluster centroids.
Correct Answer:
B
— It is sensitive to outliers
Learn More →
Q. Which of the following is a limitation of linear regression?
-
A.
It can only be used for binary outcomes
-
B.
It assumes a linear relationship between variables
-
C.
It requires a large amount of data
-
D.
It is not interpretable
Solution
Linear regression assumes a linear relationship between the independent and dependent variables, which may not hold true in all cases.
Correct Answer:
B
— It assumes a linear relationship between variables
Learn More →
Q. Which of the following is a limitation of RNNs?
-
A.
They can only process fixed-length sequences.
-
B.
They are not suitable for time series data.
-
C.
They struggle with long-range dependencies.
-
D.
They require more data than feedforward networks.
Solution
RNNs struggle with long-range dependencies due to issues like the vanishing gradient problem.
Correct Answer:
C
— They struggle with long-range dependencies.
Learn More →
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
Solution
A key limitation of K-means is that it requires the number of clusters to be specified beforehand, which can be challenging in practice.
Correct Answer:
B
— It requires the number of clusters to be specified in advance
Learn More →
Q. Which of the following is a method for feature scaling?
-
A.
One-hot encoding
-
B.
Min-Max scaling
-
C.
Label encoding
-
D.
Feature extraction
Solution
Min-Max scaling is a method used to scale features to a specific range, typically [0, 1].
Correct Answer:
B
— Min-Max scaling
Learn More →
Q. Which of the following is a method for feature selection?
-
A.
K-means clustering
-
B.
Recursive Feature Elimination
-
C.
Gradient Descent
-
D.
Support Vector Machines
Solution
Recursive Feature Elimination is a method used to select features by recursively removing the least important ones.
Correct Answer:
B
— Recursive Feature Elimination
Learn More →
Q. Which of the following is a method for handling missing data?
-
A.
Normalization
-
B.
Imputation
-
C.
Regularization
-
D.
Feature Scaling
Solution
Imputation is a technique used to fill in missing values in a dataset.
Correct Answer:
B
— Imputation
Learn More →
Q. Which of the following is a method to visualize clustering results?
-
A.
Confusion matrix
-
B.
ROC curve
-
C.
Dendrogram
-
D.
Precision-recall curve
Solution
A dendrogram is a tree-like diagram that shows the arrangement of the clusters formed in hierarchical clustering.
Correct Answer:
C
— Dendrogram
Learn More →
Q. Which of the following is a potential issue when using linear regression?
-
A.
Multicollinearity among predictors
-
B.
High variance in the dependent variable
-
C.
Low sample size
-
D.
All of the above
Solution
All of the listed issues can affect the performance and validity of a linear regression model.
Correct Answer:
D
— All of the above
Learn More →
Q. Which of the following is a potential problem when using linear regression?
-
A.
Overfitting
-
B.
Multicollinearity
-
C.
Underfitting
-
D.
All of the above
Solution
All of the listed options can be potential problems when using linear regression, affecting the model's performance and interpretability.
Correct Answer:
D
— All of the above
Learn More →
Q. Which of the following is a prerequisite for applying binary search?
-
A.
The array must be sorted
-
B.
The array must be of even length
-
C.
The array must contain integers only
-
D.
The array must be in ascending order
Solution
Binary search can only be applied to a sorted array, regardless of the data type.
Correct Answer:
A
— The array must be sorted
Learn More →
Q. Which of the following is a prerequisite for implementing binary search?
-
A.
The array must be sorted
-
B.
The array must be dynamic
-
C.
The array must be of even length
-
D.
The array must contain integers only
Solution
Binary search can only be implemented on a sorted array.
Correct Answer:
A
— The array must be sorted
Learn More →
Q. Which of the following is a prerequisite for using binary search?
-
A.
The array must be sorted
-
B.
The array must be unsorted
-
C.
The array must contain unique elements
-
D.
The array must be of fixed size
Solution
Binary search requires the array to be sorted in order to function correctly.
Correct Answer:
A
— The array must be sorted
Learn More →
Q. Which of the following is a private IP address?
-
A.
192.168.1.1
-
B.
172.16.0.1
-
C.
10.0.0.1
-
D.
All of the above
Solution
All of the listed IP addresses are private IP addresses, used within local networks.
Correct Answer:
D
— All of the above
Learn More →
Q. Which of the following is a property of a Red-Black tree?
-
A.
Every node is red
-
B.
Every path from root to leaf has the same number of black nodes
-
C.
All leaves are red
-
D.
The root must be red
Solution
In a Red-Black tree, every path from the root to the leaves must have the same number of black nodes, ensuring balanced height.
Correct Answer:
B
— Every path from root to leaf has the same number of black nodes
Learn More →
Q. Which of the following is a property of Red-Black Trees?
-
A.
Every node is either red or black.
-
B.
The root must be black.
-
C.
All leaves are black.
-
D.
All of the above.
Solution
All of the listed properties are true for Red-Black Trees, ensuring balanced structure.
Correct Answer:
D
— All of the above.
Learn More →
Showing 2641 to 2670 of 3237 (108 Pages)
