Raft Checkpoint

Work fresh traces, diagnose invalid implementations, and identify model boundaries.

Get every question correct to pass this checkpoint. You can review feedback, revise your answers, and submit again.

1. A follower is in term 8 and receives an RPC from term 6. What term should it report in its rejection?

2. Voter last log is (term=4,index=9); candidate last log is (term=5,index=7). Is the candidate at least as up to date under Raft log ordering?

Select one answer.

Only if the voter has no log No, index alone determines freshness Yes, its last term is newer Only if both indices are equal

3. A leader in term 5 finds a majority storing an entry from term 4. Can it newly commit that old entry solely by counting replicas?

Select one answer.

Only if the old entry has a small index Yes, every majority count directly commits every old entry No old entry can ever become committed No; commit a current-term entry to establish commitment of the prefix

4. AppendEntries matches prevLogIndex/prevLogTerm but later incoming entries conflict with a follower suffix. What should happen?

Select one answer.

Delete the entire log including the matching prefix Keep both versions at the same index Delete the conflicting suffix and append the leader entries Reject forever even if the leader term is current

Auto-advance on pass

Open access learning · Go · Python · C · SQL · No external dependencies

Transparency · Support this project

Join Discord