โ† All Data Engineering Flashcard Decks

Real-Time Streaming Architectures Flashcards

7 cards from real Data Engineering practice questions. Tap to flip, then mark Knew It or Still Learning โ€” missed cards come back until you master them.

Read the first 7 Real-Time Streaming Architectures flashcards as text
  1. A sliding window with a 10-minute size and 2-minute slide produces a new window every:

    Answer: 2 minutes

    The slide interval determines window emission frequency, so a new window starts every 2 minutes.

  2. In Kafka, what does log compaction retain?

    Answer: The latest value for each message key

    Log compaction keeps at least the most recent value for every key, discarding older duplicates.

  3. Which scenario most justifies exactly-once over at-least-once semantics?

    Answer: Financial transaction aggregation where duplicates corrupt totals

    Duplicate counting in financial aggregation produces wrong results, demanding exactly-once.

  4. What is the main trade-off of a larger watermark delay (more lateness tolerance)?

    Answer: Higher latency before results are emitted

    Allowing more late data means windows stay open longer, delaying when results are produced.

  5. In a Kafka Streams application, a KTable represents:

    Answer: A changelog stream interpreted as an evolving table of latest values per key

    A KTable models the latest state per key, updated as new records arrive on its changelog.

  6. Which factor most directly limits the maximum parallelism of a Kafka topic's consumers in one group?

    Answer: The number of partitions

    Each partition is consumed by only one member, so partition count caps group parallelism.

  7. What does an idempotent producer in Kafka prevent?

    Answer: Duplicate messages caused by producer retries

    An idempotent producer deduplicates retried sends so each message is written once per partition.