UNIVERSITY COLLEGE OF ENGINEERING PATTUKOTTAI UNIVERSITY COLLEGE OF ENGINEERING PATTUKOTTAI

RAJAMADAM 614 701 RAJAMADAM 614 701

CLASS: CSE SEM: 06 CLASS: CSE SEM: 06
ASSESMENT-II ASSESMENT-II
CS6601-DS CS6601-DS
Total Marks: 50 Total Marks: 50
PART-A (9 X 2 = 18) PART-A (9 X 2 = 18)

ANSWER ALL QUESTIONS ANSWER ALL QUESTIONS

1. What are the rules to abort the nested transaction?
2. Define consistent cut.
3. Define the terms: clock skew and clock drift.
4. Mention some motivations for replication.
5. What is the election algorithm?
6. What is name space & domain name system?
7. Differentiate marshalling and un-marshalling.
8. Formulate why there is no explicit data typing in CORBA CDR?
9. Explain on shared memory approach.
1. What are the rules to abort the nested transaction?
2. Define consistent cut.
3. Define the terms: clock skew and clock drift.
4. Mention some motivations for replication.
5. What is the election algorithm?
6. What is name space & domain name system?
7. Differentiate marshalling and un-marshalling.
8. Formulate why there is no explicit data typing in CORBA CDR?
9. Explain on shared memory approach.

PART-B (2X16=32) PART-B (2X16=32)

10 a. (i) Explain the Chandy & Lamports snapshot algorithm for determining
the global states of distributed systems. (8)
(ii) Describe the distributed mutual exclusion algorithm that uses &
Multicast logical clocks. (8)
(OR)
b. (i) Summarize in the detail about CODA. (8)
10 a. (i) Explain the Chandy & Lamports snapshot algorithm for determining
the global states of distributed systems. (8)
(ii) Describe the distributed mutual exclusion algorithm that uses &
Multicast and logical clocks. (8)
(OR)
b. (i) Summarize in the detail about CODA. (8)

(ii) Explain detail about two phase commit protocol. (8) (ii) Explain detail about two phase commit protocol. (8)

11a. (i) Outline the importance of nested transactions with an example. (8) 11a. (i) Outline the importance of nested transactions with an example.(8)

(ii)Why do we go for optimistic concurrency control? Explain (8) (ii) Why do we go for optimistic concurrency control? Explain (8)

(OR) (OR)
b. With a simple case study, explain the concept of distributed
b. With a simple case study, explain the concept of distributed
Deadlocks. (16)
Deadlocks. (16)