Eladio Rocha
Quiz by , created about 1 month ago

Learn the fundamental concepts of ACID compliance and the CAP Theorem in database systems. Explore how Atomicity, Consistency, Isolation, and Durability ensure reliable transactions, and understand the trade-offs between Consistency, Availability, and Partition Tolerance in distributed databases. This guide covers real-world examples, database system behaviors, and modern approaches to scalability and fault tolerance.

3
0
0
Eladio Rocha
Created by Eladio Rocha about 1 month ago
Close

ACID Compliance and CAP Theorem

Question 1 of 10

1

What does Atomicity in ACID compliance ensure?

Select one of the following:

  • Transactions are immediately readable by all users.

  • Each transaction either fully succeeds or fully fails.

  • Rules within the database are always consistently applied.

  • Data is distributed across multiple partitions.

Explanation

Question 2 of 10

1

In ACID, how is Consistency defined?

Select one of the following:

  • Data changes are immediately visible across all nodes.

  • Database rules are consistently enforced during transactions.

  • Data retrieval is consistent across replicas.

  • Transactions never conflict with each other.

Explanation

Question 3 of 10

1

What is the main goal of Isolation in ACID?

Select one of the following:

  • To allow multiple transactions to modify the same data simultaneously.

  • To prevent transactions from interfering with each other.

  • To propagate data quickly across distributed systems.

  • To write data to durable storage.

Explanation

Question 4 of 10

1

What does Durability in ACID compliance guarantee?

Select one of the following:

  • Data is stored in memory for faster access.

  • Committed data will persist even after a crash.

  • Transactions are visible across distributed systems.

  • Data propagation is eventually consistent.

Explanation

Question 5 of 10

1

Which of the following is a core concept of the CAP Theorem?

Select one of the following:

  • Scalability, Reliability, Durability

  • Availability, Partition Tolerance, Consistency

  • Atomicity, Durability, Replication

  • Redundancy, Speed, Isolation

Explanation

Question 6 of 10

1

What is the trade-off when using a database like Cassandra in terms of the CAP Theorem?

Select one of the following:

  • Sacrifices partition tolerance for strong consistency.

  • Sacrifices consistency for availability and partition tolerance.

  • Sacrifices availability for consistency and partition tolerance.

  • Provides all three: consistency, availability, and partition tolerance.

Explanation

Question 7 of 10

1

What does Availability mean in the CAP Theorem?

Select one of the following:

  • Data changes are consistently propagated immediately.

  • The system avoids single points of failure.

  • Transactions remain durable during failures.

  • Data retrieval always reflects the most recent write.

Explanation

Question 8 of 10

1

What is an example of a system that sacrifices availability in favor of consistency and partition tolerance?

Select one of the following:

  • MySQL

  • Cassandra

  • DynamoDB in eventual consistency mode

  • MongoDB

Explanation

Question 9 of 10

1

How does Partition Tolerance benefit distributed databases?

Select one of the following:

  • Ensures that no data is lost in case of system crashes.

  • Allows the system to scale horizontally across multiple servers.

  • Guarantees real-time consistency for all reads and writes.

  • Eliminates the need for replication across nodes.

Explanation

Question 10 of 10

1

What is a common characteristic of modern database systems regarding CAP trade-offs?

Select one of the following:

  • They strictly enforce the CAP Theorem limitations.

  • They provide flexibility to optimize different properties based on use cases.

  • They always prioritize availability over consistency.

  • They eliminate the need for partition tolerance entirely.

Explanation

Previous
Next