CS8603 Question Bank Distributed Systems
CS8603 Question Bank Distributed Systems Regulation 2017 Anna University free download. Distributed Systems Question Bank CS8603 pdf free download.
Sample CS8603 Question Bank Distributed Systems
1.
i)Design FIFO and non-FIFO executions.(7)
ii)Discuss on causally ordered executions (6)
BTL 6
Create
2.
Show with an equivalent timing diagram of a synchronous execution on an asynchronous system. CS8603 Question Bank Distributed Systems
Show with an equivalent timing diagram of a asynchronous execution on a synchronous system.(13)
CS8603 Question Bank Distributed Systems
Illustrate realizable with synchronous communication (RSC) execution.(13)
BTL 3
Apply
5.
i) Explain the hierarchy of execution classes. (7)
ii) Examine the crown test to determine the existence of cyclic dependencies among messages.(6)
BTL 1
Remember
6.
Explain the channels to simulate an execution using asynchronous primitives on a synchronous system.(13)
7.
Analyse the channels to simulate an execution using synchronous primitives on an asynchronous system.(13)
BTL 5
Evaluate
8.
Explain a simple algorithm defined by Bagrodia.13)
CS8603 Question Bank Distributed Systems
Explain chandy and lamport algorithm (13)
BTL 1
Remember
10.
Examine the two possible executions of the snapshot algorithm for money transfer.(13)
BTL 3
Apply
11.
Examine the necessary and sufficient conditions for causal ordering. (13)
CS8603 Question Bank Distributed Systems
Analyze in detail about the centralized algorithm to implement total order and causal order of messages. (13)
BTL 4
Analyze
13.
Discuss in detail about the distributed algorithm to implement total order and causal order of messages. (13)
BTL 2
Understand
14.
i) Describe any two issues need to be addressed in recording of a consistent global snapshot of a distributed system.(7)
ii) How to record a consistent global state of a distributed system with a banking example.(6)
CS8603 QB Distributed Systems
Create a simplified implementation of synchronous order. Develop the for the process Pi ,1 ≤ i≤ n.(15)
BTL 6
Create
2
Illustrate the asynchronous executions and of crowns.
(a) Crown of size 2.
(b) Another crown of size 2.
(c) Crown of size 3. (15)
BTL 4
Analyze
| Subject name | Distributed Systems |
| Short Name | DS |
| Semester | 6 |
| Subject Code | CS8603 |
| Regulation | 2017 regulation |
CS8603 Question Bank Distributed Systems Click Here To Download
CS8603 Distributed Systems Syllabus
CS8603 Distributed Systems Notes
CS8603 Distributed Systems Important Questions
CS8603 Distributed Systems Question Paper