What does CAP theorem state about distributed database systems?
Answer: B
CAP theorem proves that distributed systems can guarantee at most 2 of 3 properties: Consistency, Availability, and Partition tolerance.
Q.122Medium
In SQL, what is the difference between HAVING and WHERE clauses?
Answer: B
WHERE clause filters individual rows before GROUP BY, while HAVING filters aggregated groups after GROUP BY.
Q.123Medium
Which data structure is most efficient for implementing a LRU (Least Recently Used) cache?
Answer: B
Hash Map provides O(1) lookup while Doubly Linked List maintains insertion order and allows O(1) removal/reordering.
Q.124Medium
In cloud computing, what does the term 'eventual consistency' refer to?
Answer: B
Eventual consistency in cloud systems means that data replicas will converge to the same state after all updates have propagated.
Q.125Medium
What is the primary benefit of containerization technology like Docker in modern application deployment?
Answer: B
Docker containers package applications with dependencies, ensuring identical execution across different environments.
Advertisement
Q.126Medium
In machine learning, what is a confusion matrix primarily used for?
Answer: B
A confusion matrix shows True Positives, True Negatives, False Positives, and False Negatives, enabling comprehensive evaluation of classification accuracy.
Q.127Medium
Which encryption standard is currently recommended for securing data in transit over networks?
Answer: C
TLS 1.3 is the latest, most secure protocol standard for encrypting data in transit, replacing older protocols like SSL and TLS 1.2.
Q.128Medium
What is the time complexity of searching an element in a balanced Binary Search Tree?
Answer: C
A balanced BST maintains O(log n) search complexity by keeping the tree height logarithmic relative to node count.
Q.129Medium
What is the normal form that ensures no partial dependencies exist in a relation?
Answer: C
2NF eliminates partial dependencies where non-key attributes depend on part of a composite key. 3NF further eliminates transitive dependencies.
Q.130Medium
Which of the following is a correct SQL syntax for creating an index on multiple columns?
Answer: D
Both syntaxes are valid in SQL. The first creates a composite index, while the second creates a unique composite index.
Q.131Medium
Which sorting algorithm has the best average-case time complexity for randomly distributed data?
Answer: B
Quick Sort has O(n log n) average-case complexity, making it most efficient for random data. Though worst-case is O(n²), randomized pivot selection minimizes this risk.
Q.132Medium
What does ACID compliance in databases ensure?
Answer: B
ACID is a fundamental database property: Atomicity (all-or-nothing), Consistency (valid state), Isolation (concurrent independence), Durability (permanent after commit).
Q.133Medium
Which cloud service model provides pre-configured application environments?
Answer: B
PaaS provides a complete development and deployment environment in the cloud, including pre-configured tools and frameworks.
Q.134Medium
Which of the following best describes a graph data structure with no cycles?
Answer: B
A tree is a special case of a graph with no cycles. It has n nodes and n-1 edges, forming a hierarchical structure.
Q.135Medium
In machine learning, what does overfitting mean?
Answer: B
Overfitting occurs when a model learns the training data including its noise and irregularities, performing poorly on unseen test data.
Q.136Medium
What is the primary advantage of using MongoDB (NoSQL) over traditional relational databases?
Answer: B
MongoDB's document-based model allows flexible schemas for unstructured data and supports horizontal scaling, unlike rigid relational schemas.
Q.137Medium
In operating systems, what is a deadlock?
Answer: B
Deadlock is a situation where multiple processes cannot proceed because each holds resources needed by others, creating a circular wait condition.
Q.138Medium
What is the correct order of operations for the Big O notation from least to most complex?
Answer: A
Constant O(1) is fastest, followed by logarithmic O(log n), linear O(n), quadratic O(n²), exponential O(2ⁿ), and factorial O(n!) which is slowest.
Q.139Medium
Which normalization form eliminates all non-key dependencies?
Answer: C
3NF (Third Normal Form) ensures all non-key attributes depend only on the primary key, eliminating transitive dependencies.
Q.140Medium
What is the time complexity of quicksort algorithm in the worst case?
Answer: B
Quicksort's worst-case complexity is O(n²) when pivot selection is poor, though average case is O(n log n).
