Scribd
Upload
25 views3 pages

Distributed System 47(Elective)

The document is a question bank for a course on Distributed Systems, covering fundamental concepts such as definitions, characteristics, and models of distributed systems. It includes questions on various topics like scalability, security, deadlocks, algorithms, and file systems, aiming to assess understanding of both theoretical and practical aspects. Additionally, it addresses specific algorithms and protocols relevant to distributed computing.

Uploaded by

Believer
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
25 views3 pages

Distributed System 47(Elective)

The document is a question bank for a course on Distributed Systems, covering fundamental concepts such as definitions, characteristics, and models of distributed systems. It includes questions on various topics like scalability, security, deadlocks, algorithms, and file systems, aiming to assess understanding of both theoretical and practical aspects. Additionally, it addresses specific algorithms and protocols relevant to distributed computing.

Uploaded by

Believer
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/ 3

U.I.E.T.

DEPARTME​N​T O​F COMPUTER SCIENCE AND ENGG


Distributed systems Question Bank
CSE-505

1) Define distributed systems?


2) Give examples of distributed systems.
3) Define heterogeneity.
4) What are the characteristics of heterogeneity?
5) What is the purpose of heterogeneity mobile code?
6) Why we need openness?
7) How we provide security?
8) Define scalability.
9) Define transparencies.
10) Define System model.
11) What is the architectural model?
12) Define Middleware.
13) What are the different types of model?
14) Which type of network can be used by distributed system?
15) What are the different types of network?
16) Define the advantages and disadvantages of distributed system.
17) What is the difference between networking and internetworking?
18) What are core OS Components?
19) Define Thread.
20) What is meant by address space?
21) Difference between monolithic and micro kernels
22) What is meant by cryptography?
23) What is the use of cryptography?
24) What is meant by distributed file system?
25) What are the different types of distributed file system available?
26) Write the short notes Distributed mutual exclusion and elections.
27) Explain about the Logical time and logical clocks.
28) Describe in detail about distributed deadlocks
29) Explain Time stamp ordering in detail.

30) What are Distributed Systems? What are significant advantages and limitations of
distributed system? Explain with example, what could be impact of absence of global clock
and shared memory?

31) Explain various states of a process through a state transaction diagram. What is bully
algorithm for the election of coordinator process? explain its process with the help of
example

32) What are the differences in communication and resource deadlocks? Discuss about various
types of deadlock models described so for.

33) What is the concept of probe? Discuss with efficient example how it is used in chandy et al’s
algorithm. Explain how probe method is more efficient compare to others.

34) What are agreement protocols? What are Byzantine agreement problem, the Consensus
problem and Interactive Consistency Problem?

35) Describe the design issue of RPC. Explain how can you register an object into a registry and
also explain flow of RMI in distributed system.

36) Write short note on:-


a) Election Algorithm
b) Mobile & Ubiquitous computing
c) Challenges of Heterogeneity & Transparency in distributed system
d) Failure Model in distributed system

37) Define the term transparency. Explain all types of transparencies in distributed system.

38) What do you understand by the term compatibility? Discuss all levels of compatibility which
are provided by distributed system.

39) Differentiate between edge chasing and path pushing algorithm? Explain the concept of
probe and how it is used in chandy et al algorithm (explain with suitable example).

40) Illustrate with suitable example, how Suzuki Kasami algorithm works?

41) What are the goals of distributed file system? What are the different mechanisms for
building distributed file system?

42) Discuss the working and design issues of Remote Procedure Call in distributed system with
proper neat and clean diagram?
43) What are the requirements of good mutual exclusion algorithm? Discuss the inefficiencies in
lamport algorithm & how it is improved?

44) What are the shortcomings of HO Ramamoorthys two phase algorithm for deadlock
detection? How does one phase algorithm remove the possibility of false deadlock
detection?

45) What is vector clock and how this maintains casual ordering? Explain.

46) Discuss with example how Raymond tree based algorithm works to resolve conflict in
simultaneous request for critical section executions?

You might also like