Quorum Queues — Concept Check
Questions on Quorum Queues. Quorum queues use the Raft consensus algorithm for data safety with leader election; they offer stronger durability guarantees than classic mirrored queues in clustered setups.
Questions in this quiz
8 questions on Quorum Queues — Concept Check. Work through them here, then start the quiz to answer them and see your score.
1.A RabbitMQ cluster experiences a network partition. What ensures no message loss in quorum queues?
- ALow memory usage
- BMirroring all nodes
- CRaft consensus algorithm
- DHigh throughput
2.You notice higher latency in your RabbitMQ setup after switching to quorum queues. Why is this happening?
- AIncreased message duplication
- BHigher message priority
- CSplit-brain scenarios
- DQuorum write round-trip
3.A message is nacked and requeued multiple times in a quorum queue. What prevents it from cycling indefinitely?
- Ax-delivery-limit argument
- BManual retry counter
- CMessage mirroring
- DLeader election
4.When declaring a quorum queue, what argument is mandatory to specify its type?
- Aha-mode=all
- Bha-sync-mode=automatic
- Cx-queue-type=quorum
- Dx-delivery-limit
5.A RabbitMQ cluster has a leader node failure. How does a quorum queue handle this situation?
- AAll nodes become leaders
- BRaft elects a new leader
- CMessages are lost
- DQueue stops accepting writes
6.Which of the following is NOT a characteristic of quorum queues?
- AMessage loss on failure
- BLower throughput
- CNo split-brain risk
- DHigher memory usage
7.Why might someone mistakenly believe classic mirrored queues are more reliable than quorum queues?
- AQuorum queues have higher latency
- BMirrored queues have higher throughput
- CMirrored queues replicate to all nodes
- DQuorum queues use more memory
8.What is the default initial group size for quorum queues if not explicitly set?
- A1 node
- B5 nodes
- C3 nodes
- DAll nodes in the cluster