For my Distributed Systems module, can you generate some past paper questions based on…
- User
For my Distributed Systems module, can you generate some past paper questions based on these topics
Week 2 - RPC, RMI and SOAP (27 Jan - 31 Jan) Week 3 - REST (3 - 7 Feb) Week 4 - Multiplay Game Synchronization (10 - 14 Feb) Week 5 -Synchronization (17 - 21 Feb) Week 6 - RAFT and Cloud Computing (24 Feb - 28 Feb) Week 8 - Consensus and Paxos (10 - 14 Mar) Week 9 - P2P and DHT (17 - 21 Mar) Week 10 - Key Value Stores (24 - 28 Mar) Week 11 - Bitcoin (31 Mar - 4 Apr)Generate one exam question for each topic
Assistant
Okay, here is one potential exam question for each of the topics listed, designed to test understanding of core concepts in a typical Distributed Systems exam format.
General Instructions: Answer all questions. Clearly label each part of your answer. Be concise and precise in your explanations.
Question 1: Week 2 - RPC, RMI and SOAP
(a) Explain the fundamental difference between Remote Procedure Call (RPC) and Java Remote Method Invocation (RMI) in terms of their programming model and object orientation. (4 marks) (b) Describe the role of 'stubs' (or proxies) and 'skeletons' (or servers) in both RPC and RMI architectures. How do they facilitate transparency for the developer? (4 marks) (c) SOAP messages are typically transported over HTTP. Describe the basic structure of a SOAP message (Envelope, Header, Body) and explain why its reliance on XML and HTTP made it suitable for traversing firewalls, compared to earlier binary protocols. (4 marks)
Question 2: Week 3 - REST
(a) Define Representational State Transfer (REST) as an architectural style, not a protocol. (2 marks) (b) List and explain four key architectural constraints of REST (e.g., Client-Server, Statelessness, Cacheability, Uniform Interface, Layered System). For each constraint, briefly explain its primary benefit in the context of web-scale distributed systems. (8 marks) (c) Explain the concept of idempotency with respect to HTTP methods (GET, PUT, DELETE) commonly used in RESTful APIs. Why is idempotency a desirable property for distributed operations? (2 marks)
Question 3: Week 4 - Multiplayer Game Synchronization
(a) Explain the core challenge that network latency and jitter pose for maintaining a consistent game state view across all players in a real-time multiplayer game like a First-Person Shooter (FPS). (3 marks) (b) Describe the technique known as "Client-Side Prediction". How does it attempt to mask latency for the local player? What potential inconsistencies can arise from its use? (5 marks) (c) Contrast a "Server Authoritative" architecture with a purely Peer-to-Peer (P2P) architecture for game state management. Discuss one advantage and one disadvantage of each approach regarding consistency and cheat prevention. (4 marks)
Question 4: Week 5 - Synchronization
(a) In distributed systems, achieving perfect physical clock synchronization is often impractical. Explain why, and define the "happened-before" (->) relation used in logical time. (3 marks) (b) Describe Lamport's Logical Clock algorithm. Explain how timestamps are assigned to events and included in messages. What specific limitation does it have regarding determining the causal order of concurrent events? (4 marks) (c) Explain how Vector Clocks overcome the limitation of Lamport Clocks. Describe the structure of a vector timestamp and the rules for updating it upon local events and message send/receive. (5 marks)
Question 5: Week 6 - RAFT and Cloud Computing
(a) What fundamental problem in distributed systems does the RAFT consensus algorithm aim to solve? Name and briefly describe the three distinct server states in RAFT. (4 marks) (b) Explain the process of Leader Election in RAFT. Describe the roles of election timeouts, candidate state, and RequestVote RPCs in ensuring that (under normal conditions) a single leader emerges per term. (5 marks) (c) Briefly explain how RAFT uses Log Replication (via AppendEntries RPCs) to ensure that followers' logs converge towards the leader's log, contributing to fault tolerance. How might such a consensus mechanism be beneficial for managing stateful applications deployed in a cloud computing environment (e.g., across multiple virtual machines or availability zones)? (3 marks)
Question 6: Week 8 - Consensus and Paxos
(a) Define the consensus problem in the context of asynchronous distributed systems possibly subject to failures. List the three core properties that any correct consensus algorithm must satisfy (Agreement, Validity, Termination). (4 marks) (b) Describe the different roles defined in the classic Paxos algorithm (Proposer, Acceptor, Learner). Can a single process embody multiple roles? (3 marks) (c) Explain the two phases (Phase 1: Prepare/Promise, Phase 2: Propose/Accept) of the single-decree Paxos algorithm initiated by a Proposer. How do proposal numbers and the concept of quorums help ensure that only a single value is ultimately chosen (safety)? (5 marks)
Question 7: Week 9 - P2P and DHT
(a) Contrast structured Peer-to-Peer (P2P) systems (like Distributed Hash Tables - DHTs) with unstructured P2P systems (like early Gnutella) in terms of how they locate content or resources. (3 marks) (b) Explain the core idea behind Consistent Hashing in DHTs. How does it help in mapping keys to nodes and managing node joins/leaves more gracefully compared to simple modulo hashing? (4 marks) (c) Describe, at a high level, how a lookup operation (finding the node responsible for key
k) typically works in a structured DHT like Chord or Kademlia. What is the expected efficiency (e.g., logarithmic) of lookups, and what major challenge do DHTs face due to node "churn" (nodes frequently joining and leaving)? (5 marks)Question 8: Week 10 - Key Value Stores
(a) Describe the basic data model of a Key-Value Store (KVS). What are the typical core operations provided (e.g., Put, Get, Delete)? Give one common use case for a KVS. (4 marks) (b) Many large-scale distributed Key-Value Stores favour Availability and Partition Tolerance over Strong Consistency (referencing the CAP theorem). Explain the concept of "Eventual Consistency" commonly offered by these systems. (4 marks) (c) Explain why techniques like Partitioning (Sharding) and Replication are crucial for building scalable and fault-tolerant Key-Value Stores capable of handling large datasets and high request volumes. (4 marks)
Question 9: Week 11 - Bitcoin
(a) Describe the fundamental structure of the Bitcoin blockchain. How are transactions grouped into blocks, and how are these blocks cryptographically linked together to form an immutable chain? (4 marks) (b) Explain the role of "miners" and the Proof-of-Work (PoW) consensus mechanism in Bitcoin. How does the computational difficulty of PoW contribute to the security of the ledger and the process of adding new blocks? (4 marks) (c) Explain how the combination of the public blockchain ledger and the PoW consensus mechanism (specifically, the "longest chain rule") addresses the "double-spending problem" without requiring a central trusted authority. (4 marks)
Remember to tailor the marks and specific details based on the depth covered in your actual lectures. Good luck with your module!
Other models, same or similar prompt
Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.