Kostenlos · ohne Anmeldung · ohne Zeitlimit
Fertige Multiple-Choice-Übungsquizze, von Hand geprüft. Löse jedes Gratis-Quiz online — jede Antwort kommt mit Erklärung, und jede Quiz-Seite hat einen vollständigen Lösungsschlüssel zum Wiederholen.
Kostenlos · ohne Anmeldung · ohne Zeitlimit
Fertige Multiple-Choice-Übungsquizze, von Hand geprüft. Löse jedes Gratis-Quiz online — jede Antwort kommt mit Erklärung, und jede Quiz-Seite hat einen vollständigen Lösungsschlüssel zum Wiederholen.
IT
Deep dive into messaging architectures, comparing Kafka's distributed commit log against RabbitMQ's AMQP routing model. Beantworte jede Frage und sieh sofort, ob du richtig liegst — jedes Mal mit Erklärung.
Ein kostenloser Multiple-Choice-Übungstest mit 16 Fragen zu IT. Jede Frage hat eine richtige Antwort und eine kurze Erklärung, und der vollständige Lösungsschlüssel unter dem Quiz dient zugleich als Lernzettel. Kein Konto, kein Zeitlimit — löse ihn so oft du willst.
Dies ist ein kostenloses Multiple-Choice-Quiz mit 16 Fragen. Nach jeder Antwort siehst du, ob sie richtig war — immer mit Erklärung. Keine Anmeldung, kein Zeitlimit: Mach es so oft du willst und nutze den Lösungsschlüssel oben zum Wiederholen, vorher oder nachher.
Richtige Antwort: BKafka is a distributed append-only commit log with consumer-tracked offsets; RabbitMQ is a queue-based broker that tracks message delivery and acknowledgment
Kafka acts as a durable, partitioned commit log where consumers manage their own read offsets; RabbitMQ routes messages via exchanges into queues, tracking message states and deleting them once consumed.
Richtige Antwort: BMessages are strictly ordered only within a single partition of a topic
Kafka guarantees strict total ordering only within a single partition; messages written across different partitions within the same topic have no ordering guarantees.
Richtige Antwort: BThe set of partition replicas that are fully caught up with the partition's current leader broker
The ISR is the group of broker replicas that actively follow the partition leader and have caught up with the latest written log offsets within the replica lag threshold.
Richtige Antwort: BThe partition leader and all current in-sync replicas (ISR) have committed the message to their local logs before acknowledging
'acks=all' ensures that the record is acknowledged only after the leader and all active in-sync replicas have committed the write, providing the strongest durability guarantee.
Richtige Antwort: BProducers publish messages to an Exchange, which routes them to Queues using Bindings and Routing Keys
RabbitMQ uses an AMQP exchange-centric model: producers publish to an Exchange (direct, topic, fanout, headers), which directs messages to bound queues based on routing keys.
Richtige Antwort: BIt duplicates and broadcasts incoming messages to all queues bound to it, ignoring routing keys entirely
A fanout exchange ignores routing keys and blindly broadcasts copies of received messages to every queue currently bound to that exchange (publish-subscribe pattern).
Richtige Antwort: Bsendfile()
Kafka uses the sendfile() system call to transfer page cache data directly to the network socket, avoiding copying data into user-space memory and saving CPU cycles.
Richtige Antwort: BThe group coordinator reallocates topic partition assignments among the active consumers in the group
A consumer rebalance occurs when consumers join, leave, or fail, prompting the group coordinator to reassign topic partition ownership across surviving group members.
Richtige Antwort: BIt replaces the external Apache ZooKeeper dependency with an integrated Raft consensus mechanism for metadata management
KRaft (Kafka Raft Metadata mode) replaces external ZooKeeper clusters with a built-in Raft consensus quorum, improving scalability, partition recovery times, and cluster operations.
Richtige Antwort: BIt limits the number of unacknowledged messages the broker sends to a consumer before waiting for acknowledgments
Basic.qos prefetch limits the number of unacknowledged messages in flight on a channel, preventing consumers from being overwhelmed and ensuring fair distribution across workers.
Richtige Antwort: BLog retention policies based on time or size limits, and Log Compaction based on record keys
Kafka purges data based on time (log.retention.hours) or size limits, or uses Log Compaction to retain the single most recent record for each key.
Richtige Antwort: BAn exchange to which messages are automatically routed if they are rejected (nack), expire due to TTL, or exceed queue lengths
A DLX captures messages that fail consumption, expire due to TTL, or are dropped from full queues, rerouting them to dedicated analysis queues.
Richtige Antwort: BNetwork retries by the producer will not introduce duplicate messages into a topic partition
With enable.idempotence=true, Kafka assigns a Producer ID and sequence numbers to records, allowing brokers to identify and discard duplicate messages sent during network retries.
Richtige Antwort: BA durable, replicated FIFO queue based on the Raft consensus algorithm that replaces legacy mirrored queues
Quorum Queues implement the Raft consensus algorithm, providing stronger data safety, fault tolerance, and predictable recovery compared to legacy mirrored queues.
Richtige Antwort: BThe offset may be committed before the record was successfully handled, leading to message loss on consumer restart
Auto-commit writes offsets periodically regardless of processing success; if a failure occurs between read and write, unhandled messages are skipped upon restart, causing data loss.
Richtige Antwort: BMaintaining the latest known state for every unique message key, functioning like a durable change-log table
Log compaction keeps the latest value for every key in the partition log, allowing applications to restore point-in-time state tables (like KTables) upon cold start.