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 distributed systems engineering, covering consensus protocols (Raft/Paxos), the CAP theorem, and vector clocks. 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: BChoose between consistency (C) or availability (A)
When network partitions occur, a distributed system must either reject writes/reads to maintain identical state (Consistency) or accept operations and risk divergent data (Availability).
Richtige Antwort: ARandomized election timeouts for each candidate node
Raft uses randomized election timeouts (e.g., 150ms–300ms) so one node times out and initiates an election before others, avoiding split votes.
Richtige Antwort: BWhen network disconnection causes distinct sub-clusters to each believe they are the legitimate leader
Split-brain occurs when a network partition cuts cluster communication, causing nodes on both sides to elect independent leaders and accept conflicting writes, risking corruption.
Richtige Antwort: BThe exact causal relationship and concurrency between distinct distributed events
While Lamport timestamps provide total ordering, vector clocks maintain vector arrays that can differentiate whether two events are causally related or occurred concurrently.
Richtige Antwort: BIf the coordinator crashes permanently after the prepare phase, participants must wait indefinitely for a decision
In 2PC, if participants vote 'yes' and the coordinator fails before broadcasting 'commit' or 'abort', participants cannot independently resolve the transaction and hold locks indefinitely.
Richtige Antwort: BReaching agreement on a single value among a group of unreliable processors over an asynchronous network
Paxos guarantees safety and consensus among distributed nodes communicating over an asynchronous, lossy network, as long as a quorum of non-faulty nodes is reached.
Richtige Antwort: AAll read and write operations appear to take place atomically at a discrete point in time between their invocation and completion
Linearizability ensures that every operation appears to execute atomically at a specific instant between its start and finish, matching the behavior of a single, central copy of data.
Richtige Antwort: BBy utilizing TrueTime API, which leverages GPS receivers and atomic clocks to bound timestamp uncertainty
Google Spanner's TrueTime API provides bounded time uncertainty intervals backed by atomic clocks and GPS, allowing the database to assign monotonic commit timestamps globally.
Richtige Antwort: ATo ensure that read and write operations intersect at least one up-to-date node by satisfying R + W > N
A quorum (strictly majoritarian, or configured such that Read quorum + Write quorum > Total nodes) guarantees that any successful read operation overlaps with at least one node containing the latest write.
Richtige Antwort: BTo efficiently disseminate cluster membership, node state, and failure detection information peer-to-peer
Gossip protocols periodically exchange state metadata between random peer pairs, eventually diffusing cluster membership and node health across the entire network in O(log N) rounds.
Richtige Antwort: AReaching consensus when nodes may not only fail or drop packets, but also send conflicting or malicious messages
The Byzantine Generals Problem models scenarios where actors can act maliciously or deceitfully (arbitrary/Byzantine faults), requiring algorithms like PBFT to guarantee consensus.
Richtige Antwort: AA data structure that can be replicated across nodes and resolved concurrently without coordination or merge conflicts
CRDTs (operation-based or state-based) rely on mathematically commutative and idempotent operations, allowing concurrent updates across replicas to converge to the exact same state without locks.
Richtige Antwort: BClock drift, network jitter, and leap seconds make physical clocks unreliable for strict global ordering
NTP cannot guarantee perfect physical clock synchronization due to network latency, virtualization skew, and clock drift, making reliance on wall-clock time risky for transactional ordering.
Richtige Antwort: BTo distinguish between older, stale leadership reigns and current cluster states
Epoch/term numbers act as logical clocks, allowing nodes to identify and disregard outdated commands or heartbeats emitted by disconnected or partitioned former leaders.
Richtige Antwort: BDuring a read query, the coordinator compares data versions from multiple replicas and asynchronously updates out-of-date nodes
When a client reads data with a high consistency level, the coordinator queries multiple replicas; if it detects stale data, it returns the latest version to the client and writes updates to the stale nodes.
Richtige Antwort: BDeterministic consensus is impossible to guarantee in an asynchronous network if even a single process is subject to unannounced crash failure
The landmark 1985 FLP theorem proved that in a purely asynchronous network, no deterministic consensus protocol can guarantee both safety and liveness if even one node can crash.