Practice
Solution
Step 1: Understand LFU eviction criteria
LFU evicts the cache entry with the lowest access frequency to keep frequently used items.Step 2: Analyze eviction candidate state at step 4
The candidate selected for eviction must have the lowest frequency count; frequency is not reset or ignored.Final Answer:
Option D -> Option DQuick Check:
LFU evicts lowest frequency count keys [check]
Solution
Step 1: Trace Replication Worker reading WAL entry
Worker reads the log but crashes before applying, so replica state unchanged.Step 2: Understand retry behavior on restart
Since transaction not applied, worker retries applying on restart ensuring consistency.Final Answer:
Option B -> Option BQuick Check:
Unapplied transaction retried after crash [check]
Solution
Step 1: Trace Database Proxy behavior at Step 4
Upon detecting primary failure, the proxy marks it unavailable and waits for leader election to complete before routing queries to the new leader.Step 2: Eliminate other options
Forwarding immediately to old primary (A) causes timeouts; queuing indefinitely (C) stalls clients; returning errors without retry (B) reduces availability.Final Answer:
Option A -> Option AQuick Check:
Proxy reroutes queries only after leader election [check]
Solution
Step 1: Analyze conflict resolution approaches
Vector clocks allow detection of concurrent conflicting versions without blocking writes, enabling asynchronous conflict resolution.Step 2: Eliminate other options
Centralized locking serializes writes, causing high latency and bottlenecks. Synchronous quorum writes enforce consistency but increase latency and reduce availability. Consistent hashing routes keys but does not resolve conflicts.Final Answer:
Option A -> Option AQuick Check:
Vector clocks enable asynchronous conflict detection and merging [check]
Solution
Step 1: Identify stateful bottlenecks
RTMP ingest servers maintain stateful TCP connections per broadcaster, limiting how many connections each server can handle.Step 2: Compare scaling constraints
Transcoders (A) can be scaled horizontally with more instances. Kafka (C) can add partitions but has practical limits. CDN edges (D) scale well with caching. RTMP ingest (B) hits connection limits first due to TCP statefulness.Final Answer:
Option D -> Option DQuick Check:
Stateful TCP connections on RTMP ingest servers limit horizontal scaling [check]
