Quiz

Database Fundamentals

0% completed

Quiz

Question 1

What does the CAP theorem state?

A

A database can achieve strong consistency, high availability, and partition tolerance simultaneously

B

A distributed system can only guarantee two out of consistency, availability, or partition tolerance

C

Partition tolerance is not necessary in modern systems

D

A system must sacrifice availability to ensure consistency

Question 2

In synchronous replication, when is a transaction considered complete?

A

When the primary node writes the data locally

B

When at least one replica acknowledges the write

C

When the transaction log is updated

D

When all replicas acknowledge the write

Question 3

Which consistency model ensures that all reads return the latest committed data?

A

Strong Consistency

B

Eventual Consistency

C

Causal Consistency

D

Monotonic Reads

Question 4

Which of the following is an example of leaderless replication?

A

PostgreSQL with synchronous replication

B

MySQL using master-slave replication

C

Amazon DynamoDB

D

Google Spanner

Question 5

What happens in asynchronous replication?

A

The primary node waits for all replicas to confirm the write

B

The primary node commits the transaction without waiting for replicas

C

Data is written simultaneously to the primary and all replicas

D

The system performs write operations on all nodes equally

Question 6

Which CAP theorem trade-off do eventual consistency systems usually choose?

A

Availability and Partition Tolerance (AP)

B

Consistency and Partition Tolerance (CP)

C

Consistency and Availability (CA)

D

Consistency only

.....

Like the course? Get enrolled and start learning!