0% found this document useful (0 votes)
18 views4 pages

Distributed Systems Questions For Exam

The document outlines various chapters covering fundamental concepts of distributed systems, including definitions, architectures, communication models, naming systems, clock synchronization, replication, fault tolerance, and security concerns. Each chapter contains detailed questions and explanations about specific topics such as types of distributed systems, middleware roles, inter-process communication, and consistency models. The document serves as a comprehensive guide for understanding the principles and challenges associated with distributed systems.

Uploaded by

poudelsrijan69
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
0% found this document useful (0 votes)
18 views4 pages

Distributed Systems Questions For Exam

The document outlines various chapters covering fundamental concepts of distributed systems, including definitions, architectures, communication models, naming systems, clock synchronization, replication, fault tolerance, and security concerns. Each chapter contains detailed questions and explanations about specific topics such as types of distributed systems, middleware roles, inter-process communication, and consistency models. The document serves as a comprehensive guide for understanding the principles and challenges associated with distributed systems.

Uploaded by

poudelsrijan69
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

Chapter 1

1. Define distributed system. Differentiate between an autonomous system and a


distributed system with examples.
2. “Distributed system acts as a single coherent system to its end user”. Justify the
statement with its features and examples.
3. Why do we need a distributed system? Explain the advantages and disadvantages of
distributed system in detail.
4. What are the main characteristics (design goals or objectives or requirements) of a
distributed system?
5. Why there are challenges in achieving some requirements of a distributed system?
Explain the challenges associated with different requirements of distributed system.
6. Define transparency. Explain types of transparency. Explain the challenges in
achieving the transparency in distributed system.
7. Explain the different models of distributed system.
8. Explain the different types of distributed systems: grid, cluster, cloud.
9. Differentiate between network operating system and distributed operating system.
10. What are applications of distributed system?
11. What are different pitfalls of distributed system?

Chapter 2

1. Explain different architectural style of distributed system with diagram.


2. Compare peer-to-peer and client server architecture.
3. Write short notes on:
a. Data centered Architecture
b. Object-based architecture
c. Middleware organization
d. Hybrid architecture
e. Edge serve sysem

Chapter 3

1. What are differences between user-level threads and kernel-level thread?


2. What is virtualization? How virtualization work in distributed system? Explain.
3. Explain different types of virtualizations.
4. Explain role of middleware in distributed system.
5. Define client.
6. What is a three-tiered client-server application? With diagram.

Chapter 4
1. What is meant by unicast and multicast IPC?
2. What are the models of IPC?
3. Differentiate between synchronous and asynchronous communication?
4. Explain multicast communication in distributed system.
5. Explain Message-Oriented communication with suitable example.
6. What is RPC? Explain the RPC process in brief.
7. Describe the general architecture of Message-Queuing system with suitable example.
8. Explain Transient Asynchronous communication with suitable example.
9. Explain the RMI process in brief with diagram.

Chapter 5
1. Define the term name, identifier and addresses.
2. What are different types of naming system? Explain Structured naming system in brief.
3. Explain the name space with example.
4. What is name resolution? Explain the types of name resolution with diagram.
5. Explain how name is resolved in DNS.
6. Write short notes on:
a. Global name Vs Local Name
b. Structured naming
c. Attribute-based naming
d. LDAP directory tree.

Chapter 6
1. Why clock synchronization is needed in distributed system?
2. What is clock drift?
3. What is logical clock and physical clock.
4. Explain Network Time Protocol in brief.
5. Explain the concept of logical clock and their importance in distributed system.
6. What is leader election? Explain different leader election algorithm with diagram.
7. What is Universal Coordinate Time?
8. What is role of coordinator in distributed system?
9. Explain the Bully’s algorithm.
10. Explain the Ring-based algorithm.
11. How the clock synchronization is done in Cristian’s Algorithm? Explain
12. Explain the Berkley’s algorithm.
13. What is mutual exclusion? Explain different distributed mutual exclusion algorithm.
14. Explain the concept of vector clock.
15. Write short notes on:
a. Token ring mutual exclusion
b. Centralized mutual exclusion
c. Distributed mutual exclusion
d. Global Positioning system
e. Gossip-based coordination

Chapter 7
1. What is replication in distributed system? Explain with example.
2. Explain the reasons of replication in distributed system.
3. What are challenges in replication? Explain
4. Explain sequential consistency model with example.
5. Explain Casual consistency model with example.
6. What do you mean by client-centric consistency model?
7. Explain read your writes and write follow read consistency.
8. Explain replicated-write protocol.
9. Write short notes on:
a. Replication as scaling technique.
b. Strict Consistency.
c. Replica management.
d. Monotonic reads consistency
e. Monotonic write consistency

Chapter 8
1. What do you mean by fault and fault tolerance?
2. Explain the requirements of fault tolerance system.
3. Explain different type of fault.
4. Differentiate between fault and error.
5. What do you mean by process resilience? List type of process resilience.
6. Explain the reliable group communication.
7. Define distributed commit. Differentate between Two phase and three phase commit
protocol with diagram.
8. Write the algorithm for Two-phase commit.
9. Write the algorithm for Three-phase commit.
10. Explain the concept of Bizantine failure.
11. Write short notes on:
a. K-fault tolerance system.
b. Orphan process
c. 2PC

Chapter 9
1. Differentiate between security threat and attack
2. What is mean by Cryptography?
3. Describe the security concern in distributed system.
4. Explain four type of security threat.
5. Write short notes on:
a. Denial of Service
b. Hashing
c. Authenticity
d. Secure group management
e. Secure channel
f. Security management.

Common questions

Powered by AI

Virtualization is crucial as it abstracts the underlying hardware resources, providing virtual environments that promote flexibility, scalability, and isolation. It supports distributed systems by enabling efficient resource utilization, simplifying resource management, and allowing dynamic allocation of workloads. Additionally, virtualization aids in fault isolation and provides convenient snapshot and rollback capabilities, essential for maintaining reliability and consistency .

The two-phase commit protocol is a distributed algorithm designed to ensure all nodes in a transaction either commit or abort changes, maintaining system consistency. In the first phase (voting phase), each participating site agrees to commit or abort. In the second phase (commit phase), based on participants' responses, the coordinator dictates the global commit or abort. This protocol is significant as it provides a standard for achieving atomic transactions across distributed systems, ensuring data consistency in the presence of failures .

Middleware enhances distributed system capabilities by serving as the intermediary layer handling communication, data exchange, and inter-process interactions. It provides functionalities such as protocol translation, communication abstraction, transaction management, and scalability support. This allows developers to focus on application logic without delving into complex networking or system-level details . Specific functionalities include RPC support, message queuing, and service-oriented architecture (SOA), which streamline distributed application development and execution .

In a network operating system, computers are aware of each other's presence, allowing resource sharing and direct user access to remote resources, but each system maintains independent control. In contrast, a distributed operating system provides a unified interface, making networked resources appear as local and centralizing control for coordinated resource sharing and process management across multiple nodes .

Denial of Service (DoS) attacks overwhelm a system with excessive requests, leading to degraded performance or shutdowns, severely affecting the availability of services in a distributed system. Defenses include deploying firewalls to block malicious traffic, using intrusion detection systems (IDS) to identify attack patterns early, implementing rate limiting to throttle potential attack flows, and using distributed architecture to absorb and mitigate traffic spikes more effectively .

A distributed system acts as a single coherent system by providing transparency across its nodes, making locations, resource sharing, and failures appear seamless to end users. Features such as location transparency (hiding the physical location of resources and users), replication transparency (duplicated resources appear as a single entity), and failure transparency (graceful handling of node or process failures) contribute to this perception .

Challenges in achieving the design goals of a distributed system include maintaining transparency, consistency, and reliability. For example, ensuring consistency when data is replicated across multiple nodes requires sophisticated synchronization mechanisms. Transparency challenges arise because fully masking underlying complexities requires robust middleware solutions, which can be difficult to implement. Reliability is challenged by network partitions and node failures, necessitating fault-tolerant algorithms like quorum protocols and consensus mechanisms .

Synchronous communication requires the sender to wait for a response before continuing, ensuring data consistency and allowing straightforward error handling. However, it can lead to inefficiencies and increased latency due to potential blocking. Asynchronous communication allows the sender and receiver to operate independently, enhancing system responsiveness but complicating error handling and state synchronization due to potential message delays or loss .

Clock synchronization is critical to ensure temporal consistency, coordination of events, and the correct ordering of distributed transactions. Strategies to achieve synchronization include Network Time Protocol (NTP) for synchronizing physical clocks and logical clocks such as vector clocks or Lamport timestamps for event ordering without relying on synchronized physical clocks. These methods ensure all nodes in the distributed system have a consistent view of time or event sequence .

Causal consistency ensures that operations that are causally related are seen by all nodes in the same order. This model supports the preservation of causality without requiring strict synchronization, which balances performance with consistency needs. It differs from sequential consistency (which requires all nodes to observe operations in a global sequence) and eventual consistency (where only eventual synchronization is guaranteed). Causal consistency provides a meaningful consistency guarantee without as stringent performance trade-offs as sequential consistency .

You might also like