Scribd
Upload
117 views2 pages

Distributed Systems KCS077

The document is a exam paper for a distributed systems course. It contains 7 sections with multiple choice and long answer questions testing knowledge of concepts like consistent global states, deadlocks, distributed file systems, transaction processing, and fault tolerance. Students are required to answer questions from each section, with options to choose between longer questions, for a total of 100 marks. Key topics covered include consistency models, concurrency control, replication, and recovery techniques in distributed systems.

Uploaded by

xefedoy533
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
117 views2 pages

Distributed Systems KCS077

The document is a exam paper for a distributed systems course. It contains 7 sections with multiple choice and long answer questions testing knowledge of concepts like consistent global states, deadlocks, distributed file systems, transaction processing, and fault tolerance. Students are required to answer questions from each section, with options to choose between longer questions, for a total of 100 marks. Key topics covered include consistency models, concurrency control, replication, and recovery techniques in distributed systems.

Uploaded by

xefedoy533
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Printed Pages: 02 Sub Code:KCS077

Paper Id: 2 3 1 3 5 6 Roll No.

B.TECH.
(SEM VII) THEORY EXAMINATION 2022-23
DISTRIBUTED SYSTEMS
Time: 3 Hours Total Marks: 100
Note: Attempt all Sections. If you require any missing data, then choose suitably.

SECTION A

1. Attempt all questions in brief. 2x10 = 20


(a) Explain the concept of consistent global state and transitless global state.
(b) Show the vector clocks are more suitable than Lamport’s logical clock for a
distributed system.
(c) Differentiate between resource and communication deadlock.
(d) List various performance metrics for distributed mutual exclusion algorithm.
(e) Give some applications of agreement protocols.
(f) Discuss the benefits of grouping files into volumes in Coda.
(g) Differentiate between consistent and strongly consistent checkpoints.
(h) Discuss forward and backward recovery in distributed systems.
(i) List basic, multi version and conservative timestamp ordering algorithm in

2
90
increasing order of transaction abort.

13
(j) Differentiate between flat and nested transactions.
_2

2.
P1

24
SECTION B

5.
3D

2. Attempt any three of the following: 10x3 = 30

.5
P2

(a) Discuss the major issue in designing a distributed system.


17
Q

(b) Classify the Deadlock detection algorithms. Describe the Path-Pushing deadlock
|1
detection algorithm.
2

(c) Discuss the architecture of distributed file system.


:2

(d) Explain dynamic voting protocol. Also compare it with static voting protocol.
27

(e) Discuss lock based concurrency control algorithms.


:
13

SECTION C
3

3. Attempt any one part of the following: 10x1 = 10


02

(a) Discuss the limitations of distributed system. List some problem arises because
-2

of these limitations.
01

(b) Explain fundamental and architectural model of distributed system.


1-
|1

4. Attempt any one part of the following: 10 x1 = 10


(a) Give the deadlock handling strategies in distributed system. Also differentiate
among centralized, distributed and hierarchical deadlock detection strategies in
distributed system.
(b) Discuss the concept of Mutual Exclusion? Describe the requirements of mutual
exclusion in distributed system. Is mutual exclusion problem more complex in
distributed system than single computer system? Justify your answer.

QP23DP1_290 | 11-01-2023 13:27:22 | 117.55.242.132


5. Attempt any one part of the following: 10x1 = 10
(a) Describe Byzantine agreement problem, and explain its solution. Show that
Byzantine agreement cannot always be reached among four processors if two
processors are faulty.
(b) Give the design issues in distributed shared memory. State the algorithm for
implementation of distributed shared memory.

6. Attempt any one part of the following: 10x1 = 10


(a) List various issues in a fault tolerant system. Also differentiate between fault
and failure.
(b) Discuss the requirement of inserting checkpoints in message passing in
distributed system. Show that when checkpoints are taken after every K
messages sent, where K is greater than 1, the recovery system suffers from
domino effect. Assume that a process take a checkpoint after sending the Kth
message but doing nothing else.

7. Attempt any one part of the following: 10x1 = 10


(a) Discuss Atomic commit in distributed transaction with suitable example.
(b) Explain the followings
(i) Transaction with replicated data
(ii) Highly available services

2
90

13
_2

2.
P1

24
5.
3D

.5
P2

17
Q

|1
2
:2
: 27
13
3
02
-2
01
1-
|1

QP23DP1_290 | 11-01-2023 13:27:22 | 117.55.242.132

You might also like