✅ MODULE 1: Introduction to Distributed Systems
1. Enlist the issue in designing the Distributed System? Explain
failure transparency & location transparency in detail
2. Compare NOS and DOS
3. Differentiate between NOS DOS and Middleware in the design of
distributed systems
4. Explain issues in designing Distributed system
5. What are different issues and goals related to distributed
systems?
✅ MODULE 2: Communication
1. Differentiate between RMI and RPC.
2. What are the services offered by middleware?
3. What is RPC? Explain working of RPC in detail
4. What is Remote procedure call? Explain how transparency is
achieved in RPC
5. Explain the various ordered semantics used for Many to many
communication
6. Explain various forms of message oriented communication with
suitable example
7. Explain group communication.
8. What is 1:M and M:1 group communication?
✅ MODULE 3: Synchronization
1. Explain Raymond’s tree based algorithm for mutual exclusion.
2. Explain Ricart-Agrawala’s algorithm and how it optimizes the
message overhead in achieving mutual exclusion
3. Explain Bully election algorithm.
4. Explain Bully election algorithm with suitable example.
5. Explain Lamport desynchronizes logical clock explain with
example? Which events are said to be concurrent in Lamport’s
timestamp.
6. What is logical clock? Why are logical clocks required in
distributed systems? How Lamport does synchronizes logical
clock? Which events are said to be concurrent in Lamports
timestamp
7. Explain Chandy Misra Hass Algorithm
8. Explain Chandy -Misra_Hass Algorithm for distributed deadlock
detection.
9. Explain Raymond’s algorithm for mutual exclusion.
10. Discuss Raymonds tree based algorithm of token based in
distributed mutual exclusion
✅ MODULE 4: Resource & Process Management
1. Explain key Features of Global Scheduling algorithm.
2. What are the features of Global Scheduling algorithm
3. Explain desirable features of global scheduling algorithm
4. Explain load estimation, process transfer and location
policies with respect to load balancing approach in
distributed systems.
5. Explain different load estimation and process transfer
policies used by load balancing algorithms.
6. Justify how load balancing is useful in distributed system.
7. Discuss code migration in distributed system.
8. Explain code migration and its techniques.
9. What is need of code migration? Explain the role of process to
resource and resource to machine binding in code migration.
10. Describe code migration issues in details
11. Discuss the technique to achieve the Process resilience
✅ MODULE 5: Replication, Consistency & Fault Tolerance
1. What is fault tolerance? Explain failure models.
2. What is fault tolerance? Describe different types of failure
models.
3. Explain any five data centric consistency models.
4. What are different data centric consistency models
5. Explain how Monotonic read consistency model is different than
Read your Write consistency model
6. Write a short note on Replication and the types of it.
7. Discuss and differentiate various client consistency models.
✅ MODULE 6: Distributed File Systems
1. Discuss google file system (GFS) as a scalable distributed
file system.
2. Explain desirable features of a good DFS?
3. List desirable features of distributed File system. How are
modifications propagated in file caching schemes?
4. Explain file caching schemes
5. Explain synchronization in DFS with its challenges.
✅ MODULE 1: Missing Topics
Types of distributed systems
Grid computing models
Cluster computing models
Hardware concepts in distributed systems
Software concepts in distributed systems (other than NOS/DOS)
Models of middleware
👉 Only issues, NOS/DOS, middleware services are asked — rest
untouched.
✅ MODULE 2: Missing Topics
Stream Oriented Communication
👉 Everything else like RPC, RMI, group communication is covered.
✅ MODULE 3: Missing Topics
Clock Synchronization:
Physical clock synchronization algorithms (Cristian’s,
Berkeley, etc.)
Mutual Exclusion:
Lamport’s algorithm (direct question missing)
Maekawa’s algorithm
Suzuki-Kasami Broadcast algorithm
Performance comparison of mutual exclusion algorithms
Deadlock:
Centralized deadlock detection approach (only Chandy-Misra-
Haas asked)
✅ MODULE 4: Missing Topics
Task assignment approach
Load sharing approach (only load balancing asked)
Detailed process management concepts (basic intro part not
asked directly)
✅ MODULE 5: Missing Topics
Distributed Shared Memory (DSM):
o Architecture
o Design issues
Replica management (only replication types asked)
Recovery mechanisms (only fault tolerance basics asked)
✅ MODULE 6: Missing Topics
File models
File accessing models
File replication (direct question not asked)
Network File System (NFS)
👉 Only DFS features, caching, GFS are repeatedly asked.
🎯 FINAL SUMMARY (Very Important)
🔴 HIGH CHANCE BUT NOT ASKED YET:
Physical clock synchronization
Suzuki-Kasami algorithm
Maekawa algorithm
DSM (Distributed Shared Memory)
NFS
Stream communication
🟡 LOW PRIORITY (rarely asked):
Grid & Cluster computing
Middleware models
Task assignment / load sharing
File models
💡 Strategy (very important)
80% paper comes from repeated topics (you already have them)
20% surprise → comes from THIS list