1. Define distributed systems.
2. What is distributed system?
3. What is middleware?
4. Illustrate five reasons why to build distributed systems.
5. List the characteristics of distributed system.
6. Explain the characteristics of distributed system.
7. List the features of distributed systems.
8. Mention the examples of distributed system.
9. Mention the challenges in distributed system.
10. What are the advantages of distributed system?
11. What are the disadvantages of distributed system?
12. List the limitations of distributed system.
13. Summarize the distributed computer system components.
14. Explain the requirements of distributed systems.
15. Describe the trends in the distributed systems in detail.
16. What are the applications of distributed system?
17. What are the design issues of distributed system?
18. What is the need of openness of distributed system?
19. Define Transparency. What are its types?
20. Discuss the major issues in distributed systems.
21. List the challenges in the design of distributed systems.
22. List the various challenges in distributed systems and explain them.
23. Write a brief note on each of the challenges of distributed systems.
24. Classify the security challenges faced by the distributed systems.
25. How resource sharing is done in distributed system?
26. Elucidate the trends in distributed systems.
27. Elaborate on the recent trends on distributed systems.
28. List any two resources of hardware and software, which can be shared in distributed systems with example.
29. Identify the five types of hardware resources and five types of data or software resource that can be shared efficiently. Give examples.
30. Utilize World Wide Web as an example to illustrate the concept of resource sharing, client and server.
31. Define distributed systems. What are the significant issues and challenges of the distributed systems?
32.What is the need for distributed system? List the distributed system challenges.
33. What are the design issues to be considered in designing distributed systems? Explain in detail about each of them.
34. Discuss in detail about the examples (any two) of distributed systems.
35. Categorize the application areas of distributed systems.
36. Write down the principles of distributed system.
37. Name some services and examples of middleware.
38. Compare the various types of system models in distributed environment.
39. State any four factors to be considered for variations in client server model.
40. What is the role of proxy server and mobile code?
41. What are the three important aspects of distributed systems that are modeled using fundamental models?
42.Explain in detail about the fundamental model of distributed system.
43. Identify the two significant factors affecting interacting process in a distributed system.
44. Measure some examples of problems requiring synchronization.
45. What is clock skew and clock drift?
46. Define the terms: clock skew and clock drift.
47. What is clock’s drift rate?
48. State the issues in clocks.
49. What are the techniques used to synchronize clocks?
50. Why computer clock synchronization is is necessary?
51. Distinguish between physical clock and logical clock?
52. What are the two modes of synchronization? Write their format.
53. What are the different ways of synchronizing physical clocks? Explain.
54. Why computer clock synchronization is necessary? Describe the design requirements for a system to synchronize the clocks in a distributed system.
55. Explain Cristian’s method for synchronizing clocks.
56. How the clock synchronization is done in Cristian’s method?
57. State the problems in Cristian’s algorithm. Explain how Berkeley algorithm overcomes the problems of Cristian’s algorithm with neat sketch.
58. Explain logical time and logical clocks.
59. Write the Happened-before relation.
60. Describe the capabilities and rules for implementation of logical clocks.
61. What is vector clock? Explain.
62. Explain the Snapshot algorithm of Lampport.
63. Examine briefly about global states.
64. Define consistent cut.
65. Explain global states and consistent cuts with example.
66. Explain the Chandy and Lamports Snapshot algorithm for determining the global states of distributed systems.
67. What is the purpose of Chandy and Lamport algorithm.
68. State the issues of Clocks.
69. Define Distributed Mutual Exclusion.
70. Explain distributed mutual exclusion with suitable algorithms.
71. Examine how mutual exclusion is handled in distributed system.
72. What are the three states of Mutual Exclusion?
73. What are the three basic approaches for implementing distributed mutual exclusion?
74. Discuss in detail about the following distributed mutual exclusion algorithms:
a. The Central Server Algorithm
b. Ring Based Algorithm
75. How Ricart-Agarawala algorithm achieves mutual exclusion?
76. How Maekawa’s algorithm achieves mutual exclusion?
77. Discuss the conditions for Maekawa’s algorithm.
78. Describe Maekawa’s algorithm for mutual exclusion.
79. What are the approaches to implement distributed mutual exclusion?
80. What are the three states of mutual exclusion?
81. Write short notes of the following:
a. Ricart Agarwala algorithm
b. Maekow’s Voting algorithm
82. Elaborate on two election algorithms. Use diagrams wherever necessary.
83. Explain the Bully algorithm.
84. Write down the types of messages of in Bully algorithm.
85. Explain concurrency control in detail.
86. Define nested transactions.
87. Discuss on nested transactions.
88. What are the rules to abort the nested transactions?
89. Outline the importance of nested transactions with an example.
90. Describe atomic commit protocols in detail.
91. Explain in detail about two phase commit protocol.
92. Discuss in detail about one phase and two phase atomic commit protocol (flat and hierarchical).
93. Briefly explain the operation of two-phase commit protocol.
94. Explain concurrency control in detail.
95. Why do we go for optimistic concurrency control? Explain.
96. What is a deadlock? How deadlock can be recovered? Explain distributed deadlocks.
97. What is distributed deadlock? Explain with example.
98. Explain Edge chasing deadlock detection technique in distributed systems.
99. Formulate the advantage of edge-chasing algorithms.
100. Give the distributed algorithm for deadlock detection and illustrate with an example.