Quiz on Distributed Systems Concepts: Test Your Knowledge for Big Data Roles

1. Concurrency
2. Global Clock
3. Independent Failures
4. No Shared Memory

1. Consistency, Availability, and Performance are always guaranteed.
2. It's impossible to guarantee Consistency, Availability, and Partition Tolerance simultaneously.
3. CAP stands for Capacity, Agility, and Portability.
4. All distributed systems must be ACID compliant.

1. All nodes having the same data.
2. Every request receiving a response.
3. The system's ability to handle large amounts of data.
4. The speed at which data is processed.

1. Accurate, Consistent, Isolated, Durable
2. Atomicity, Consistency, Isolation, Durability
3. Atomicity, Capacity, Isolation, Durability
4. Accurate, Capacity, Isolated, Durable

1. The ability to process data very quickly.
2. The ability to continue operating despite component failures.
3. The ability to prevent all faults from occurring.
4. The ability to automatically scale resources.

1. Data Replication
2. Load Balancing
3. Fault Injection
4. System Partitioning

1. Availability
2. Partition Tolerance
3. Consistency
4. Durability

1. Centralized control
2. Concurrency
3. Independent failures
4. Lack of a global clock

1. Consistency, Availability, and Performance are always guaranteed.
2. Only two out of Consistency, Availability, and Partition Tolerance can be guaranteed simultaneously.
3. Capacity always increases with the number of nodes.
4. All three of Consistency, Availability, and Partition Tolerance can be guaranteed simultaneously.

1. Eventual Consistency
2. Causal Consistency
3. Sequential Consistency
4. Strict Consistency

1. Single point of failure
2. Centralized database
3. Redundancy and replication
4. Ignoring failures

1. Bubble Sort
2. Paxos
3. Lamport Timestamps
4. Binary Search

1. Quicksort
2. Raft
3. Mergesort
4. Depth-First Search

1. The system's ability to tolerate network partitions (i.e., network failures that prevent some nodes from communicating with others).
2. The system's ability to tolerate power outages.
3. The system's ability to tolerate database corruption.
4. The system's ability to tolerate user errors.

1. A. Concurrency
2. B. Global Clock
3. C. Independent Failures
4. D. Resource Sharing

1. A. One
2. B. Two
3. C. Three
4. D. None

1. A. To ensure all components never fail
2. B. To continue operating despite component failures
3. C. To reduce the cost of hardware
4. D. To increase the speed of computation

1. A. Eventual Consistency
2. B. Sequential Consistency
3. C. Causal Consistency
4. D. Strict Consistency

1. A. Load Balancing
2. B. Data Replication
3. C. Agreement among multiple processes
4. D. Network Routing

1. A. To request resources
2. B. To provide resources
3. C. To manage network traffic
4. D. To encrypt data

1. A. MySQL on a single server
2. B. PostgreSQL on a single server
3. C. Cassandra
4. D. SQLite

1. A. Concurrency
2. B. Global Clock
3. C. Independent Failures
4. D. Resource Sharing

1. A. Consistency, Availability, and Partition tolerance can all be guaranteed simultaneously.
2. B. Only two out of Consistency, Availability, and Partition tolerance can be guaranteed simultaneously.
3. C. Consistency is always more important than Availability.
4. D. Partition tolerance is optional in distributed systems.

1. A. Eventual Consistency
2. B. Sequential Consistency
3. C. Strict Consistency
4. D. Causal Consistency

1. A. The ability to prevent all failures.
2. B. The ability to continue operating properly in the event of component failures.
3. C. The ability to predict when a failure will occur.
4. D. The ability to ignore failures.

1. A. Shared Memory
2. B. Message Passing
3. C. Direct Procedure Calls
4. D. Remote Variable Access

1. A. Single-processor desktop computer
2. B. Apache Hadoop
3. C. Embedded System
4. D. Real-time operating system

1. A. Ensuring all nodes have identical hardware.
2. B. Dealing with network latency and potential data conflicts.
3. C. Minimizing the amount of data stored.
4. D. Using a single, centralized server.

1. Concurrency
2. Global Clock
3. Independent Failures
4. Resource Sharing

1. Consistency, Availability, and Performance are guaranteed.
2. Consistency, Availability, and Partition Tolerance cannot all be simultaneously guaranteed.
3. Concurrency, Availability, and Partition Tolerance cannot all be simultaneously guaranteed.
4. Consistency, Agility, and Partition Tolerance cannot all be simultaneously guaranteed.

1. Monolithic
2. Client-Server
3. Centralized
4. Hierarchical

1. To provide a global clock.
2. To establish causality between events.
3. To ensure strict consistency.
4. To manage resource allocation.

1. Eventual Consistency
2. Causal Consistency
3. Strict Consistency
4. Weak Consistency

1. Centralized Control
2. Redundancy and Replication
3. Single Point of Failure
4. Ignoring Failures

1. The system's ability to handle network partitions (i.e., network failures that isolate parts of the system).
2. The system's ability to allocate resources efficiently.
3. The system's ability to maintain data consistency across all nodes.
4. The system's ability to handle a large number of concurrent requests.

Which of the following is NOT a characteristic of distributed systems?

1. Centralized control
2. Concurrency
3. Lack of global clock
4. Independent failures

What does the CAP theorem state?

1. Consistency, Availability, Partition Tolerance can all be achieved simultaneously.
2. Only two out of Consistency, Availability, and Partition Tolerance can be achieved simultaneously.
3. CAP stands for Capacity, Agility, and Performance.
4. It applies only to centralized systems.

Which architectural style involves direct communication between peers?

1. Client-server
2. Cloud-based
3. Peer-to-peer
4. Master-slave

What is fault tolerance in distributed systems?

1. The ability to avoid all failures.
2. The ability to continue operating properly despite component failures.
3. The ability to predict failures.
4. The ability to instantly repair failed components.

Which of the following is a method for achieving communication in distributed systems?

1. Telepathy
2. Message passing
3. Smoke signals
4. Quantum entanglement

What is eventual consistency?

1. A consistency model where all updates are immediately visible.
2. A consistency model where updates will eventually be visible to all nodes.
3. A consistency model that guarantees strict ordering of events.
4. A consistency model that is only applicable to single-node systems.

Which of the following is a challenge in distributed systems?

1. Maintaining data consistency
2. Ensuring low latency
3. Handling partial failures
4. All of the above

1. A. Concurrency
2. B. Global Clock
3. C. Independent Failures
4. D. Resource Sharing

1. A. Consistency, Availability, Partition Tolerance can all be guaranteed simultaneously.
2. B. Only two of Consistency, Availability, Partition Tolerance can be guaranteed simultaneously.
3. C. Consistency is always more important than Availability and Partition Tolerance.
4. D. Availability is always more important than Consistency and Partition Tolerance.

1. A. Strict Consistency
2. B. Causal Consistency
3. C. Eventual Consistency
4. D. Sequential Consistency

1. A. The ability of a system to operate only when all components are working correctly.
2. B. The ability of a system to continue operating properly even if some components fail.
3. C. The ability of a system to quickly recover from a complete shutdown.
4. D. The ability of a system to prevent failures from occurring.

1. A. Centralized Server
2. B. Client-Server
3. C. Monolithic Application
4. D. Single-Threaded Process

1. A. To ensure that all nodes in the system have the same clock time.
2. B. To ensure that the distributed system agrees on a single value, even with failures.
3. C. To improve the performance of individual nodes in the system.
4. D. To reduce the amount of network traffic in the system.

1. A. SQLite
2. B. MySQL on a single server
3. C. Cassandra
4. D. Microsoft Access

1. A. Component concurrency
2. B. Global clock
3. C. Independent failures
4. D. Resource sharing

1. A. Consistency, Availability, and Performance are always guaranteed
2. B. Consistency, Availability, and Partition Tolerance: Choose any two
3. C. Only Consistency and Availability can be guaranteed
4. D. Performance is inversely proportional to Consistency

1. A. Ignoring failures
2. B. Centralized control
3. C. Replication
4. D. Single point of failure

1. A. Load balancing
2. B. Fault tolerance
3. C. Agreement on a single value
4. D. Data compression

1. A. Vertical Partitioning
2. B. Horizontal Partitioning
3. C. Both A and B
4. D. None of the above

1. A. To ensure all nodes have the same hardware
2. B. To provide a global clock
3. C. To synchronize clocks across distributed nodes
4. D. To reduce network latency

1. A. To encrypt data
2. B. To facilitate communication between processes
3. C. To manage memory allocation
4. D. To optimize network bandwidth