Practice
Solution
Step 1: Understand Raft's log replication mechanism
If a follower's log is inconsistent with the leader's, it rejects the AppendEntries RPC to signal a mismatch.Step 2: Leader's response to rejection
The leader decrements the nextIndex for that follower and retries AppendEntries until logs match.Final Answer:
Option B -> Option BQuick Check:
Follower rejects inconsistent logs -> leader retries with decremented nextIndex [check]
Solution
Step 1: Understand migration triggers
Data Migration Worker uses access frequency to decide tier movement; low frequency triggers move to colder tier.Step 2: Identify correct tier movement
Data with low access frequency moves from warm to cold storage, not deletion or promotion.Final Answer:
Option C -> Option CQuick Check:
Low access frequency -> warm to cold migration [check]
Solution
Step 1: Trace retrieval dependency on metadata service
The metadata service provides object location and version info; without it, retrieval cannot resolve where to fetch data.Step 2: Eliminate other options
Stale metadata retrieval is impossible without metadata service; blocking indefinitely is unlikely as client errors occur; silent integrity failures require data access, which fails first.Final Answer:
Option B -> Option BQuick Check:
Metadata service absence causes unresolved object location errors [check]
Solution
Step 1: Understand health check module role
Health checks detect unhealthy servers; without them, no updates occur to remove bad servers.Step 2: Trace routing behavior without health checks
Load balancer routes to all servers indiscriminately, including unhealthy ones, causing client errors.Final Answer:
Option D -> Option DQuick Check:
No health checks -> no removal of unhealthy servers -> client errors [check]
Solution
Step 1: Analyze timestamp and network constraints
Timestamp synchronization (A) is challenging but tolerable with NTP; network coordination (D) is minimal as IDs are generated locally.Step 2: Evaluate sequence number limits
Sequence number (B) limits per millisecond can cause blocking but can be mitigated by load balancing or sharding.Step 3: Identify machine ID allocation bottleneck
Machine ID bits are fixed (e.g., 10 bits), limiting the number of unique machines. At 10x scale, running out of unique machine IDs causes collisions or requires complex reallocation.Final Answer:
Option D -> Option DQuick Check:
Fixed machine ID bits limit scale -> collisions or reconfiguration needed [check]
