0% found this document useful (0 votes)
23 views3 pages

Distributed Systems Updated Question Bank

The document is a cleaned and updated question bank for a course on Distributed Systems, organized into six modules covering various topics such as design issues, communication methods, election algorithms, load balancing, fault tolerance, and file systems. Each module includes specific questions aimed at exploring key concepts and algorithms relevant to distributed systems. Additionally, a summary of repetitions highlights frequently addressed topics throughout the modules.

Uploaded by

Manav Purswani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
23 views3 pages

Distributed Systems Updated Question Bank

The document is a cleaned and updated question bank for a course on Distributed Systems, organized into six modules covering various topics such as design issues, communication methods, election algorithms, load balancing, fault tolerance, and file systems. Each module includes specific questions aimed at exploring key concepts and algorithms relevant to distributed systems. Additionally, a summary of repetitions highlights frequently addressed topics throughout the modules.

Uploaded by

Manav Purswani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Distributed Systems - Cleaned &

Updated Question Bank


Module 1
 • Differentiate between NOS, DOS and Middleware in the design of distributed systems
 • What are different issues and goals related to distributed systems?
 • Discuss design issues in distributed systems
 • Compare NOS and DOS
 • What are the services offered by middleware?
 • Discuss various issues and goals related to design of distributed system

Module 2
 • What is 1:M and M:1 group communication?
 • What is RPC? Explain working of RPC in detail
 • Explain various forms of message-oriented communication with suitable example
 • Explain Absolute ordering and Casual ordering process with the help of example for
many to many communications
 • Differentiate between RMI and RPC
 • Explain group communication
 • What is Remote Procedure Call? Describe the working of RPC in detail

Module 3
 • Explain Bully election algorithm with suitable example
 • Explain Raymond’s algorithm for mutual exclusion
 • What are physical clocks? Explain any one physical clock synchronization algorithm
 • Explain the need of election algorithm
 • Justify how Ricart-Agrawala’s algorithm optimized the Message overhead in achieving
mutual exclusion
 • 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
 • Explain Chandy -Misra-Hass Algorithm for distributed deadlock detection
 • Discuss Raymond’s tree based algorithm of token-based distributed mutual exclusion
 • Explain synchronization in DFS with its challenges
 • Explain Bully election algorithm
 • What is distributed mutual exclusion? Explain how Suzuki-Kasamí's broadcast
algorithm achieves distributed mutual exclusion
 • What is physical clock? Explain any one physical clock synchronization method
Module 4
 • Explain code migration and its techniques
 • Explain different load estimation and process transfer policies used by load balancing
algorithms
 • Explain desirable features of global scheduling algorithm
 • Justify how load balancing is useful in distributed system
 • What is need of code migration? Explain the role of process to resource and resource
to machine binding in code migration
 • Explain different load estimation policies and process transfer policies used in load
balancing approach of distributed system

Module 5
 • Explain how Monotonic read consistency model is different than Read your Write
consistency model
 • What is fault tolerance? Explain failure models
 • What are different data centric consistency models
 • Discuss and differentiate various client consistency models
 • Explain any five data centric consistency models with example data stores
 • What is fault tolerance? Describe different types of failure models

Module 6
 • Explain file caching schemes
 • Write a short note on Replication and the types of it
 • List desirable features of distributed file system. How are modifications propagated in
file caching scheme
 • Discuss Google file system (GFS) as a scalable distributed file system
 • What are desirable features of a good DFS?
 • Explain various file caching schemes

Summary of Repetitions
 • Explain issues/design in distributed systems – 2 times
 • What is RPC / Remote procedure call with transparency – 3 times
 • Explain Bully algorithm – 3 times
 • Explain Raymond’s tree-based algorithm – 2 times
 • Ricart-Agrawala’s algorithm and message overhead optimization – 2 times
 • Code migration and issues – 3 times
 • Load estimation and transfer policies – 3 times
 • Global scheduling features – 2 times
 • Fault tolerance and failure models – 3 times
 • Data centric consistency models – 3 times
 • File caching schemes – 2 times
 • Features of DFS – 2 times

You might also like