1. Define distributed system.
2. Differentiate between message-passing and shared memory systems.
3. Define process synchrony.
4. List out the features of distributed systems.
5. State the importance of message ordering in distributed systems.
6. Outline what does Lamport’s clock ensure.
7. State clock skew in distributed system.
8. What is snapshot recording.
9. Define mutual exclusion in distributed systems.
10. State the main idea behind Lamport’s mutual exclusion algorithm.
11. Discuss the major design issues and challenges in distributed computing with suitable
examples.
12 Describe the various primitives used for distributed communication and explain their
role in system coordination.
Compare and contrast message-passing systems and shared memory systems with real
13
time examples.
Analyze the different models of communication networks and their impact on
14
distributed systems.
Simplify the Network Time Protocol (NTP) and analyze its role in physical clock
15
synchronization.
Compare and contrast different message ordering paradigms in distributed systems
16
with real-time examples.
Explain how asynchronous execution with synchronous communication works and
17
discuss its challenges.
Discuss synchronous program order in asynchronous systems and its effect on
18
distributed system performance.
Apply Lamport’s mutual exclusion algorithm to a distributed system scenario and
19
construct a step-by-step explanation with an example.
Identify the working principles of token-based algorithms in distributed mutual
20
exclusion and build an explanation highlighting their advantages.
