DEPARTMENT OF INFORMATION TECHNOLOGY

CS3551-DITRIBUTEDCOMPUTING
QUESTION BANK
UNIT 1
PART A
1. What do mean by message passing?
2. Define distributed systems.
3. List the consequences and features of distributed computing.
4. Differentiate between Parallel Computing and Distributed.
5. List the requirements of Distributed systems.
6. What is the need of distributed system?
7. What are different types of resources?
8. List the hardware resources and software resources.
9. Define message passing and Shared memory systems.
10. Differentiate message passing and shared memory.
11. Write the command of message passing primitives.
12. List the combinations of sender and receiver communications.
13. Differentiate Synchronous execution and Asynchronous execution.
14. What are the challenges of design from system perspective.
15. List the design issues and challenges of distributed systems.
16. Define Openness.
17. Define concurrency.
18. What are the applications of Distributed computing?
19. Define Global state.
20. List the requirements of Global state.

PART B
1. Explain how a parallel system differs from distributed systems.
2. Explain in detail about relation to computer system components.
3. Illustrate the difference between message passing and Shared Memory process Communication.
4. Discuss in detail about Primitives of Distributed Communication.
5. Explain the Difference between Synchronous and Asynchronous executions.
6. Explain in detail about design issues and challenges from system perspective.
 7. Briefly explain Transparency.
8. Discuss in detail about Applications of Distributed Computing and Challenges.
9. Describe in detail about A Model of Distributed Computations.

UNIT 2
1. Draw the Working of Computer Clock.
2. What is clock skew and clock Drift?
3. List the conditions of happens before.
4. What are conditions of Logical clock?
5. Define Lamport Timestamp.
6. Define vector timestamp.
7. List the types of physical clock synchronization.
8. Define clock crush.
9. Define Christian Algorithm.
10. Define Berkeley algorithm.
11. What are the goals of network time protocol?
12. List the features of NTP.
13. What are the types of modes in NTP servers?
14. Define scalar time.
15. What are the basic property of Scalar time.
16. What is synchronous order?
17. Define rendezvous.
18. What is group communication?
19. List the types of group communication.
20. What is causal ordering?
21. What is total ordering?
22. Define Raynal-Schiper-Toueg Algorithm.
23. What are the three phases of Distributed Algorithm?
24. Define consistent global state.
25. What is Chandy-Lamport Algorithm.
PART B
1. Explain the Chandy-Lamport Algorithm.
2. Discuss global state and snapshot recording algorithm.
3. Describe in detail about causal ordering and Total ordering.
4. Explain the types of Group communication used in distributed system.
5. Discuss in detail about message ordering paradigms.
6. What are four types of ordering the messages?explain.
7.