Scribd
Upload
21 views

Distributed Systems (BCS515D) Important Question

Uploaded by

SHIVU JADI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
21 views

Distributed Systems (BCS515D) Important Question

Uploaded by

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

IMPORTANT QUESTION

Distributed Systems (BCS515D)

Module 1: Characterization of Distributed Systems and Remote Invocation:

1. Explain the goals and challenges of distributed systems with a neat diagram.
2. Describe the concept of resource sharing in distributed systems with examples.
3. Explain the architecture of RPC with a suitable diagram.
4. Compare and contrast Remote Procedure Call (RPC) and Remote Method Invocation (RMI).
5. Describe the working of request-reply protocols with a sequence diagram.
6. Discuss the role of middleware in enabling remote invocation.
7. Explain marshalling and unmarshalling in the context of RPC with a diagram.
8. Illustrate the different communication models in distributed systems.
9. Define remote invocation and explain its components using a block diagram.
10. Discuss the challenges involved in implementing remote invocation systems.

Module 2: Distributed File Systems and Name Services:

1. What is a distributed file system? Explain its file service architecture with a neat diagram.
2. Describe the components of a distributed file system with examples.
3. Discuss the challenges in designing a distributed file system with a flowchart.
4. Explain the structure and working of the Domain Name System (DNS) using a diagram.
5. Illustrate the architecture of a name service in distributed systems.
6. Compare flat naming and structured naming schemes in distributed systems.
7. Discuss caching in distributed file systems and its role in performance improvement.
8. Explain the fault tolerance mechanisms in distributed file systems.
9. Describe the interaction between name services and directory services with an example.
10. Explain file access and consistency in distributed file systems using appropriate diagrams.

Module 3: Time and Global States:

1. Define logical clocks and explain the Lamport timestamp algorithm with an example diagram.
2. What is clock skew? Describe the process of synchronizing physical clocks with a diagram.
3. Explain vector clocks and their working with an example timeline.
4. Illustrate the concept of global states in distributed systems with a suitable example.
5. Describe the concept of causality and the happened-before relation using a diagram.
6. Discuss how consistent global states are captured in distributed systems.
7. Compare physical and logical clocks in distributed systems.
8. Explain the significance of clock synchronization algorithms using a diagram.
9. Describe the role of global states in debugging distributed systems.
10. Explain the importance of maintaining time consistency in distributed systems with examples.

Module 4: Coordination and Agreement:

1. Describe the Ricart-Agrawala algorithm for distributed mutual exclusion with a flowchart.
2. Explain the Bully election algorithm with an example and a state-transition diagram.
3. Describe the working of the Ring election algorithm with an illustration.
4. What are consensus algorithms? Explain the Paxos algorithm with a block diagram.
5. Illustrate token-based and non-token-based mutual exclusion mechanisms with diagrams.
6. Discuss the challenges in achieving consensus in distributed systems.
7. Explain coordination in group communication using a sequence diagram.
8. Describe the significance of fault tolerance in consensus algorithms.
9. Discuss how distributed systems handle failure during elections using an example.
10. Illustrate the properties of consensus algorithms with relevant diagrams.

Module 5: Distributed Transactions and Replication:

1. Differentiate between flat and nested transactions with an example diagram.


2. Explain the Two-Phase Commit (2PC) protocol with a neat flowchart.
3. Discuss the working of atomic commit protocols in distributed transactions with examples.
4. Describe the concept of concurrency control in distributed transactions using a timeline diagram.
5. Explain distributed deadlocks and their resolution mechanisms with examples.
6. Illustrate transaction recovery techniques with suitable flowcharts.
7. Explain the primary-backup replication model with a diagram.
8. Discuss quorum-based replication with examples and illustrations.
9. Describe how fault tolerance is achieved in replication systems.
10. Explain the challenges in maintaining consistency during replication with suitable examples.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy