DC model

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 3

Model Examination

(Department of Computer Science and Engineering Cluster)


Course Title :Distributed computing Course Code :CS3551

Duration 3Hrs Date : 20/11/2024

Year/Sem. :III/V Marks : 100marks

Answer all Questions


Question
Question Mark BTL CO
No

Part A (10×2 = 20 Marks)

1 Distingue between synchronous and asynchronous Communication? 2 BTL-4 CO1

2 What are the motivations for Distributed Systems? 2 BTL-1 CO1

If two events of e1 and e2 in two different processor occurs in same time independently.
3 2 BTL-1 CO2
What kind of relationship exist between e1 and e2?

4 Define global state and consistent global state? 2 BTL-4 CO2

5 What is false deadlock and when it occurs? 2 BTL-4 CO3

6 Name two types of messages used in Richard Agarwal algorithm? 2 BTL-1 CO3

7 What are the requirements of mutual exclusion algorithm? 2 BTL-1 CO4

8 Define External synchronization. 2 BTL-4 CO4

9 What is hypervisor? 2 BTL-1 CO5

10 What is virtualization? Why it is required in larger organization 2 BTL-1 CO5

Part B (5×13 = 65 Marks)

Explain blocking, non-blocking Synchronous and asynchronous primitives of


11. a distributed communications. Also summarize major libraries and standards for building 13 BTL5 CO1
distributed systems.

Or

Explain Message passing systems and discuss on the message-oriented middleware and
b 13 BTL2 CO1
its type. Explain their functionality in distributed computing

12. a What is snapshot and what are the need of taking snapshot in distributed systems? 13 BTL1 CO2
Outline candy Lamport snapshot algorithm and illustrate the algorithm

Or

Describe physical clock synchronization and logical clock synchronization and explain 13
b BTL4 CO2
the framework of a system of logical clock

Outline Candy Mishra Hass algorithm to detect deadlock in OR model and illustrate the
13. a 13 BTL3 CO3
algorithm with an example

Or

b Outline Richard Agarwal algorithm and illustrate the algorithm with an example 13 BTL2 CO3

What is Checkpointing and why its need in distributed systems? Illustrate the algorithm
14. a 13 BTL4 CO4
proposed by Juang Venkatesan for asynchronous checkpoint and recovery.

Or

What are the different checkpoint based recovery system available? Explain the
b 13 BTL4 CO4
coordinated checkpointing algorithm with illustration.

Explain the types of cloud computing deployment models with their relative advantages
15. a 13 BTL3 CO5
and disadvantages.

Or

b Explain Cloud Service model with example 13 BTL2 CO5

Part C (15x1=15 Marks)

Outline the Koo- Toueg checkpoint and recovery technique and apply this algorithm to
16. a specific case study to demonstrate how this algorithm avoids the domino effects and 15 BTL1 CO4
live lock problems during the recovery.

or

An organization has planned to implement the client module that emulates a


conversional file system interface for application program and server modules, that
perform operations for clients on directories and on files. State the best distributed
b 15 BTL5 CO5
architecture to deploy and deliver the system. And also explain the suitable system
model to avoid failures and adopt the recovery system for same in case of unavoidable
failures
** BTL - Blooms Taxonomy Level
** CO - Course outcome

You might also like