Você está na página 1de 3

SHIRDI SAI ENGINEERING COLLEGE

ANEKAL, BANGALORE – 562 106

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

QUESTION BANK

BY
T. Rajesh,
Lecturer,
Computer Science & Engineering Department

For B.E. VII Semester


Computer Science & Engineering

CHAPTER – 1
1. Define a distributed operating system? Explain 3 important features of DOS?

2. Describe distributed computing system based on workstation server model and


write
merits.

3.Explain distributed computing environment components.

4.What is distributed computing system?Explain.

5. Explain workstation model of distributed computing with neat figure.

6. What are the issues concerned with design of distributed operating system?
Explain.

7. Briefly explain the major technological, economical and social factors that
motivated
the development of distributed computing system. Further enlist the main
advantage
and disadvantages of DCS over centralized ones.

8. Why is heterogeneity unavoidable in many distributed systems?


What are some common types of incompatibilities encountered in heterogenous
distributed systems? Discuss the common issues with which the designer of a

heterogenous distributed system must deal.


9. Explain the following major issues in designing DOS
a. transparency b.reliability c.scalability

10. What is DCE? What are DCE components? Explain them.

CHAPTER -2 [Message passing]

1. Describe blocking and non blocking types of IPC. Which is easier to implement
and why? Discuss their relative advantages and disadvantages.

2. Describe failure handling in message passing system.

3. Write brief note on group communication.

4. Explain the typical message structure with components.

5. How failure can be handled in distributed system?


Explain with 4,3 and 2 message reliable IPC.

6. List and explain the primitives of 4.3 BSD UNIX IPC.

7. With respect to distributed computing environment explain the following issues


in IPC by message passing
a.synchronization
b.buffering.

8. What do you mean by absolute ordering. Consistent ordering and casual ordering
of
messages?
Explain further indicate a mechanism to implement each one of them.

9.What is a datagram? Why are multidatagram is used in IPC?


What are the main issues in IPC of multidatagram messages?
Describe a mechanism for handling each of these issues.

CHAPTER – 3 [RPC]

1. What is a stub? How are stubs generated? Explain how the use of stubs helps
in making a RPC mechanism transparent.
2. What is an orphan call? How are orphan calls handled in the implementation
of the following types of call semantics? a. last – one call semantics b. last-
of-many call semantics c.atleast- once call semantics.

3. Give an example of an application where each of the following facilities


may be
useful a. broadcast RPC facility b. multicast RPC facility explain methods to
implement broadcast RPC facility.

4.What is transparent RPC mechanism? Explain the


implementation of RPC.
5.What are the main issues in designing a transparent RPC mechanism? Is it
possible to achieve complete transparency of an RPC mechanism? If no explain
why. If yes, explain how.
6. With an aid of neat functional schematic,describe various steps employed in
creating an RPC application in sun RPC environment.

7.What is callback RPC facility? Give an example of an application where this may
be useful. What are the main issues involved in supporting this facility in a RPC
system? State the mechanism to handle each of these issues.

CHAPTER-4 [ Distributed shared memory]

1.Explain DSM.What are the design and implementation issues of DSM? Indicate the
figure.

2.Discuss the relative advantages and disadvantages of using the


NRNMB,NRMB,RMB and RNMB strategies in the design of DSM systems.

3. What are the main causes of thrashing in a DSM system? What are the methods
to solve the thrashing problem in DSM?

4. With the neat architecture of DSM,explain the issues concerned in design of


distributed shared memory.

5. What are the advantages of DSM? Explain.

6. Why is a global sequence needed in a sequentially consistent distributed


shared memory system that used the write-update protocol? Explain

7. Discuss the main causes of thrashing in a DSM system. Further describe the
commonly employed methods to solve the thrashing problem indicating their
suitability in different fields.

CHAPTER -5 [synchronization]

1. Explain clock synchronization algorithms. A. centralized algorithm b.


distributed algorithms and compare merits and demerits of both a and b.
2. Explain distributed algorithms for deadlock detection. A. WFG based
distributed algorithm b. probe based distributed algorithm.
3. Briefly explain the clock synchronization algorithm.

4.What is “happened before relation” of event ordering?


Explain with space time diagram.

5.Why do we use election algorithm? Explain bully algorithm with an example.

6. In distributed system there may be unpredictable variation in the message


propagation time between 2 nodes. Explain why? How does this problem make the task
of synchronizing clocks in a distributed system difficult? Give 2 methods that can
be used in a clock synchronization algorithm to handle this problem.

Você também pode gostar