In cybersecurity, what is a zero-day vulnerability?
Answer: A
Zero-day vulnerabilities are previously unknown exploits with no patch. They're extremely dangerous because users have no defense until vendors develop and release fixes.
Q.242Medium
Which sorting algorithm is most efficient for nearly sorted data?
Answer: A
Insertion Sort has O(n) best-case complexity for nearly sorted data. Other algorithms don't exploit this, maintaining O(n log n) regardless of initial order.
Q.243Hard
What does BASE model in NoSQL stand for?
Answer: A
BASE is an alternative to ACID, prioritizing availability and partition tolerance. It accepts temporary inconsistencies that resolve eventually (eventual consistency).
Q.244Medium
In cloud security, what is the principle of least privilege?
Answer: A
Least privilege minimizes security risk by restricting access. Users get only permissions needed for their role, reducing damage from compromised accounts.
Q.245Easy
Which of the following is a ACID property that ensures all or nothing transaction execution?
Answer: A
Atomicity ensures that a transaction is treated as a single unit - either all operations complete or none do.
Advertisement
Q.246Easy
What is the primary advantage of using INNER JOIN over OUTER JOIN in SQL?
Answer: B
INNER JOIN returns only rows that have matching values in both tables, making queries more efficient for specific requirements.
Q.247Easy
In a relational database, what does normalization primarily aim to eliminate?
Answer: B
Normalization removes data redundancy and prevents update, insertion, and deletion anomalies through organized table structures.
Q.248Easy
Which algorithm has O(n log n) time complexity and is preferred for large datasets in modern databases?
Answer: B
Merge Sort maintains O(n log n) complexity in all cases and is stable, making it ideal for sorting large datasets.
Q.249Easy
What is the primary purpose of indexing in databases?
Answer: B
Indexes create a faster lookup structure similar to a book's index, enabling rapid data retrieval without full table scans.
Q.250Easy
In the OSI model, which layer is responsible for routing and logical addressing?
Answer: C
The Network Layer (Layer 3) handles routing, IP addressing, and logical path determination for data packets.
Q.251Medium
Which of the following is NOT a characteristic of relational databases?
Answer: B
Relational databases have fixed schemas. Flexible schemas are a characteristic of NoSQL databases like MongoDB.
Q.252Medium
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.253Medium
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.254Medium
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.255Medium
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.256Medium
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.
Q.257Medium
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.258Medium
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.259Medium
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.260Hard
In database replication, what is the primary difference between synchronous and asynchronous replication?
Answer: C
Synchronous replication waits for replicas to acknowledge writes (safer but slower), while asynchronous replication doesn't wait (faster but less safe).
