Reg.

No:

MAHENDRA COLLEGE OF ENGINEERING

Salem-Campus, Attur Main Road, Minnampalli, Salem -636 106.
Class: III – CSE
Time : 3Hr
Date: 20.11.2023
Subject Code: CS3551
Marks : 100
Subject Name: Distributed Computing
MODEL EXAM
S. No Question Blooms Course
Taxonomy Outcom
Level es
Answer All Questions
Part A— (10 X 2=20)

1 Define granularity Analyze CO1

2 Compare shared memory Vs distributed shared memory Remember CO1
3 Compose different forms of load balancing Understand CO2
4 Explain message broadcast Remember CO2
5 What is marker receiving rule Remember CO3
6 Differentiate multicasting Vs unicasting Understand CO3
7 Define time stamp Remember CO4
8 Explain idle token Analyze CO4
9 List the three types of messages for Deadlock handling Remember CO5
10 Define features of Mitchell and merritt’s algorithm Understand CO5

Part B — (05 X 13=65)

11.a) i) Explain the characteristics of distributed Computing (7)
13 Remember CO1
ii) List of features of distributed systems (6)
[OR]
11.b) Discuss about load balancing(7)
13 Remember CO1
Describe performance metrics in DS (6)
12.a) Identify And explain the basic properties of scalar time 13 Remember CO2
[OR]
12.b) Summarize NTP for synchronizing system of physical clocks in
13 Analyze CO2
distributed systems
13.a) Illustrate realizable with synchronous communication (RSC)
13 Understand CO3
execution
[OR]
13.b) i) Design FIFO and non FIFO executions (7) 13 Understand CO3
 ii) Discuss on causally ordered executions (6)
14. a) Explain the channels to simulate an executionusing asynchronous
13 Remember CO4
primitives on a synchronous system
[OR]
14. b) Explain about the lamport distributed mutual exclusion algorithm 13 Understand CO4
15. a) Examine Suzuki – kasami’s bradcast algorithm 13 Remember CO5
[OR]
15. b) Express with neat sketch and explain candy – misra – has algorithm
13 Remember CO5
for the OR model

PART C ( 1 X 15 = 15 )
16. A) Design the requirements and aspects needed for reliable and fault
15 Understand CO3
tolerant distributed systems
[OR]
16. b) Show that in the richat – agarwala algorithm the critical section is
accessed in increasing order of timestamp. Does the same hold in 15 Remember CO1
maekawa’s algorithm?

Subject Teacher HoD Principal