Scribd
Upload
2 views2 pages

Panimalar Engineering College

This document is a question paper for the B.E. / B.Tech. degree end semester examinations in April/May 2022 for the Computer Science and Engineering program at Panimalar Engineering College. It includes questions on distributed systems, covering topics such as hamming distance, distributed deadlock detection, and algorithms for global snapshots. The paper consists of three parts with a total of 100 marks, requiring students to answer all questions.

Uploaded by

pec library
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
2 views2 pages

Panimalar Engineering College

This document is a question paper for the B.E. / B.Tech. degree end semester examinations in April/May 2022 for the Computer Science and Engineering program at Panimalar Engineering College. It includes questions on distributed systems, covering topics such as hamming distance, distributed deadlock detection, and algorithms for global snapshots. The paper consists of three parts with a total of 100 marks, requiring students to answer all questions.

Uploaded by

pec library
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

Question Paper Code: 21Y021

Register No:

PANIMALAR ENGINEERING COLLEGE


An Autonomous Institution, Affiliated to Anna University
CHENNAI -600 123

B.E. / B.TECH. DEGREE END SEMESTER EXAMINATIONS APRIL/ MAY 2022


Sixth Semester
B.E – Computer Science and Engineering
CS8603 – Distributed Systems
(Regulations R2017)

Time: Three hours Maximum: 100 Marks


Answer ALL Questions
PART A (10×2=20 Marks)
1 Define hamming distance with example.

2 Draw the Butterfly network for n = 8 inputs and outputs.

3 Evaluate the criteria that must be met by a casual ordering protocol.

4 Outline marker sending rule.

5 List four classes of knapp’s classification of distributed deadlock detection algorithms

6 Define the two design issues for suzuki–kasami’s broadcast algorithm.

7 State the conditions for byzantine agreement problem.

8 Recall rollback recovery.

9 Analyze the three basic operations which supports CAN.

10 Infer the properties of weak consistency.

PART – B (5x13 = 65 Marks)

11 a Categorize the issues and Challenges of the distributed systems. (13)

(OR)

b Summarize NTP for synchronizing system of physical clocks in distributed systems. (13)
Question Paper Code: 21Y021

12 a Explain Chandy and Lamport algorithm to record the global snapshot. (13)
(OR)
b Illustrate the asynchronous executions and of crowns.
i. Crown of size 2. (5)
ii. Another crown of size 2. (4)
iii. Crown of size 3. (4)

13 a Show that in the Ricart–agrawala algorithm the critical section is accessed in increasing
(13)
order of timestamp. Does the same hold in Maekawa’s algorithm?
(OR)
b Briefly describe about the Chandy–misra–haas algorithm for the AND model. (13)

14 a i. Summarize the Koo–toueg coordinated check pointing algorithm. (7)

ii. Elaborate global states with examples. (6)


(OR)
b Discuss in detail about Juang – venkatesan algorithm for asynchronous check pointing (13)
and recovery.

15 a Examine how to implement sequential consistency in a distributed system. (13)


(OR)
b Describe Lamport’s bakery algorithm with WRWR mechanism and fast mutual (13)
exclusion.

PART – C (1x15 = 15 Marks)

16 a Discuss in detail about deadlock detection in distributed systems. (15)

(OR)

b User ‘A’ in delhi wishes to send a file for printing to user ‘B’ in florida, whose system (15)
is connected to a printer; while user ‘C’ from tokyo wants to save a video file in the
hard disk of user ‘D’ in london. Analyze and discuss the required peer-to-peer
network architecture.
*******

You might also like