Question Bank

Describe about the usage and importance of Distributed Systems along with one example.
What are the three important and complementary ways in which the design of distributed
systems can usefully be described
Explain about the application of distributed systems in designing the internet?
Is there any internal problems occurance in desigining the distributed systems. If so explain
about it.
Name some of the external threats that may occur in distributed systems
Distributed systems are increasingly complex in terms of their underlying physical characteristics.
Justify this statement with an example.
Illustrate the client-server architecture of one or more major Internet
applications (for example, the Web, email or netnews)
Differentiate latency and data transmission rate. Using these two elements explain about the
message transmission time between two computers
Explain about the range and bandwidth limit for LAN,WAN and MAN.

Suppose that a basic disk read can sometimes read values that are different from those
written. State the type of failure exhibited by a basic disk read. Suggest how this failure
may be masked in order to produce a different benign form of failure. Now suggest how
to mask the benign failure.
Give some examples for the protocols that are used in different layers of OSI.
Design a network and illustrate how unicasting works with the help of a diagram
Differentiate Multicasting with Broadcasting.
Discuss how packet assembly works in a network.
How remote object invocation helps in network transmission?
Describe about the features of Group communication.
Which model helps to implement system in terms of the computational and
communication tasks performed by its computational elements.
While designing a distributed systems what kind of difficulties may arise and
also explain aboout the threats that may occur in the distributed systems.
Examine the pysical model , that is a representation of the underlying hardware elements of a
distributed system.

Define the integrity property of reliable communication and list all the possible threats
to integrity from users and from system components. What measures can be taken to
ensure the integrity property in the face of each of these sources of threats.

Demonstrate how messages transmission occurs in network with the help of Remote method invocation.
In a network when one object needs to locate a remote object for resourse and data sharing,
which technique can be suggeseted RMI or RPC. Explain along with examples.

Explain how message oriented communication drives the network traffic in distributed systems.
A distributed system relies on group communication for data transmission. Justify the statement with
suitable examples.
Compare and contrast the merits and demerits of Architecture and Fundamental Models.
Compare and contrast unicast, Broadcast and Multicast with suitable examples.
How time stamp is helpful in message transmission.
Analyze the criteria that must be met by a causal ordering protol.
What are the necessary conditions to satisfy the consistent global state?
State the property for causal delivery of messages.
What is consistent cut?
Sketch an interpretation in terms of a cut.
Examine how communication in two-phase commit protol happens.
What is the role of NTP in networks
Does causal ordering related to FIFO message order delivery?
What are the three basic approaches for implementing distributed mutual exclusion?
List the three types of messages for Deadlock handling.
What is deadlock?
Skew between computer clocks in a distributed system
Compare Clock skew and clock drift.
Discuss about how to design a deadlock detection algorithm.
Define Global state.
While designing the distributed operating systems what kind of issues may occur and how to
reslove it?
Illustrate how threads are used in distributed systems
What are the uses of clocks in distributed environment and how clock synchronization works?
Demonstrate the process of Causal Ordering in distributed system. Will it improve the performance of the
distributed systems?
Explain about the application of Election Algorithm in distributed systems. Does mutual exclusion
plays a vital role in implementation of Election algorithm?

A clock is reading 10:27:54.0 (hr:min:sec) when it is discovered to be 4 sends fast.

Explain why it is undesirable to set it back to the right time at that point and show
(numerically) how it should be adjusted so as to be correct after 8 sends have elapsed.
Illustrate with an example how Distributed Transactions happens in distributed systems. Transactions are
the key element for communication. Justify this statement.
What causes deadlock and how to avoid deadlock. Is deadlock inevitable? If so how to prevent it.
Explain about the role of Agreement Protocols in distributed systems.
Compare Clocks, Time and events with gobal state. Is it possible to implement global state in distributed
systems without clocks? Explain your answer.
What is meant by Fault Tolerance, explain about its features.
What is Byzantine Fault Tolerance?
Fault tolerance is dynamic. Justify the statement.
Compare fault with errors and failures.
How many types of faults are availble in distributed systems?
Expalin about the type of failures ocuurs during transmission.
Discuss about the reason for the occurrence of Fault.
Describe about the three main features provided by fault tolerance.
How Fault tolerance plays a key role in distributed systems. Will it helps to maintain the global state
consistently?
In Distrbuted systems the transactions are authenticated and executed with the help of
distributed commit protol. Justify this statement and explain about the protols in detail.
Compare and contrast Byzantine Fault Tolerance with other fault tolerance method.
While designing a distributed systems along with fault tolerance, what are all the limitations?
Explain about it.
How to analyze the performance of Two phase commit protocol in distributed environment. Does it
supports reliability and Integrity?

Department :
Semester :
Course Code-Course Name :
Level Course Outcomes Marks Part
2 1 2 1

2 1 2 1
2 1 2 1

3 1 2 1
2 1 2 1

4 1 2 1

1 2 1

4 1 2 1
2 1 2 2

4 1 2 2
3 1 2 2
4 1 2 2
4 1 2 2
2 1 2 2
2 1 2 2
2 1 2 2

3 1 16 1

3 1 16 1

4 1 16 1

3 1 16 1

3 1 16 1

4 1 16 2

3 1 16 2

3 1 16 2
4 1 16 2
4 1 16 2
3 2 2 1
4 2 2 1
2 2 2 1
2 2 2 1
2 2 2 1
3 2 2 1
4 2 2 1
2 2 2 1
3 2 2 2
2 2 2 2
2 2 2 2
2 2 2 2
4 2 2 2
4 2 2 2
2 2 2 2
2 2 2 2

3 2 16 1
3 2 16 1
3 2 16 1

4 2 16 1

3 2 16 1

3 2 16 2

3 2 16 2
3 2 16 2
3 2 16 2

4 2 16 2
2 3 2 1
2 3 2 1
4 3 2 1
3 3 2 1
2 3 2 1
2 3 2 1
2 3 2 1
2 3 2 1

3 3 16 1

4 3 16 1
3 3 16 1
 3 3 16 1

3 3 16 1

Computer Science and Engineering

V
20CS5903-Principles of Distributed Systems