D326 DTMG 3179 Advanced Data
Management
Finals Assessment Review
(Questions & Solutions)
2025
©2025
, Q1. Which of the following best summarizes the CAP theorem in
distributed data management?
A. A distributed system can provide consistency, availability, and
partition tolerance simultaneously.
B. In the presence of a network partition, a distributed system must
choose between consistency and availability.
C. Partition tolerance is optional if strong consistency and high availability
are achieved.
D. The CAP theorem only applies to NoSQL databases.
ANS: B
Rationale: The CAP theorem states that when a network partition
occurs, a distributed system must choose between consistency and
availability, as it is impossible to guarantee all three properties
(Consistency, Availability, and Partition tolerance) simultaneously.
---
Q2. Which data management system is most suitable for handling very
large-scale, unstructured data across distributed nodes?
A. Relational Databases
B. NoSQL Databases
C. In-Memory Databases
D. Hierarchical Databases
ANS: B
Rationale: NoSQL databases are designed for scalability and flexibility
while managing unstructured or semi-structured data in distributed
environments, making them preferable for Big Data applications over
traditional relational databases.
---
©2025
, Q3. In distributed data management, the term “sharding” refers to:
A. Replicating data across multiple servers for redundancy
B. Splitting data horizontally across servers to distribute load
C. Encrypting data to improve security
D. Archiving historical data to offline storage
ANS: B
Rationale: Sharding partitions the data horizontally into smaller, more
manageable pieces (shards) distributed on separate nodes. This
technique improves scalability and performance.
---
Q4. Which consistency model prioritizes availability and partition
tolerance over immediate consistency?
A. ACID
B. BASE
C. Linearizable
D. Causal Consistency
ANS: B
Rationale: The BASE model (“Basically Available, Soft state, Eventually
consistent”) sacrifices strong consistency for higher availability and
partition tolerance, making it a common choice in large-scale distributed
systems.
---
Q5. Which consensus protocol is most widely recognized for ensuring
agreement among nodes in a distributed system?
A. Two-Phase Commit
B. Paxos
C. Raft
D. Byzantine Fault Tolerance
©2025
Management
Finals Assessment Review
(Questions & Solutions)
2025
©2025
, Q1. Which of the following best summarizes the CAP theorem in
distributed data management?
A. A distributed system can provide consistency, availability, and
partition tolerance simultaneously.
B. In the presence of a network partition, a distributed system must
choose between consistency and availability.
C. Partition tolerance is optional if strong consistency and high availability
are achieved.
D. The CAP theorem only applies to NoSQL databases.
ANS: B
Rationale: The CAP theorem states that when a network partition
occurs, a distributed system must choose between consistency and
availability, as it is impossible to guarantee all three properties
(Consistency, Availability, and Partition tolerance) simultaneously.
---
Q2. Which data management system is most suitable for handling very
large-scale, unstructured data across distributed nodes?
A. Relational Databases
B. NoSQL Databases
C. In-Memory Databases
D. Hierarchical Databases
ANS: B
Rationale: NoSQL databases are designed for scalability and flexibility
while managing unstructured or semi-structured data in distributed
environments, making them preferable for Big Data applications over
traditional relational databases.
---
©2025
, Q3. In distributed data management, the term “sharding” refers to:
A. Replicating data across multiple servers for redundancy
B. Splitting data horizontally across servers to distribute load
C. Encrypting data to improve security
D. Archiving historical data to offline storage
ANS: B
Rationale: Sharding partitions the data horizontally into smaller, more
manageable pieces (shards) distributed on separate nodes. This
technique improves scalability and performance.
---
Q4. Which consistency model prioritizes availability and partition
tolerance over immediate consistency?
A. ACID
B. BASE
C. Linearizable
D. Causal Consistency
ANS: B
Rationale: The BASE model (“Basically Available, Soft state, Eventually
consistent”) sacrifices strong consistency for higher availability and
partition tolerance, making it a common choice in large-scale distributed
systems.
---
Q5. Which consensus protocol is most widely recognized for ensuring
agreement among nodes in a distributed system?
A. Two-Phase Commit
B. Paxos
C. Raft
D. Byzantine Fault Tolerance
©2025
