What CAP theorem states: you can have at most 2 of consistency, availability, partition tolerance

Which distributed systems property, as per the CAP theorem, suggests that during network partition, a system can either provide strong consistency but not both high availability and partition tolerance?

Consistency over availability and partition tolerance

What consistent hashing does: minimizes remapping when nodes join/leave

Consistent hashing minimizes data redistribution during nodes' addition or removal

What bank conflicts are in shared memory — multiple threads accessing the same bank

Shared memory conflicts arise when multiple threads concurrently access the same bank in a banking system

What the Nyquist theorem says: sample at ≥ 2× the highest frequency to avoid aliasing

Nyquist theorem: Sample rate ≥ 2*highest frequency to prevent frequency aliasing

What database sharding does: splits data across machines by a partition key

Database sharding distributes data across multiple machines using a partition key for scalability and performance

How do lock-free data structures manage concurrent access to shared memory in a multithreaded environment?

Lock-free data structures use atomic operations to ensure concurrent access without traditional locking mechanisms