Scribd
Upload
12 views2 pages

Model Question

The document outlines an examination paper for the course CS3551 on Distributed Computing at Nadar Saraswathi College of Engineering and Technology. It includes various questions divided into three parts, covering topics such as security challenges, message ordering paradigms, algorithms, cloud computing benefits and challenges, and checkpoint-based recovery techniques. The exam is designed for B.E students in Computer Science and Engineering, with a total of 100 marks and a duration of 3 hours.

Uploaded by

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

Model Question

The document outlines an examination paper for the course CS3551 on Distributed Computing at Nadar Saraswathi College of Engineering and Technology. It includes various questions divided into three parts, covering topics such as security challenges, message ordering paradigms, algorithms, cloud computing benefits and challenges, and checkpoint-based recovery techniques. The exam is designed for B.E students in Computer Science and Engineering, with a total of 100 marks and a duration of 3 hours.

Uploaded by

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

Name of the College : 9210-Nadar Saraswathi College of Engineering and Technology

Date : 06.12.24 Year & Semester : III & IV


Maximum Marks : 100 Duration: 3 Hours
Subject Name & Code : CS3551 and Distributed Computing
Degree & Branch : B.E & Computer Science and Engineering

PART A
1 Classify the security challenges faced by the distributed systems. CO1 2
2 CO1 2
What is the significance of distributed system?
3 What are the forms of message ordering paradigms? CO2 2
4 Differentiate between synchronous and asynchronous CO2 2
communication.
5 Develop the facts of global state detection-based deadlock CO3 2
detection?
6 Define the features of Mitchell and Merritt’s algorithm. CO3 2
7 Discuss the two types of log storage? CO4 2
8 What are the two kinds of checkpoints for checkpoint algorithm? CO4 2
9 Define the Benefits of cloud model CO5 2
10 Explain the Challenges of cloud CO5 2
PART B
11 A i).Explain relation to parallel computers.(6) CO1 13
ii)Idendify the challenges in distributed system.(7)
OR
11 B i) Processor synchrony(6) CO1 13
ii) Models of communication network(7)
12 A Detail description about casual order.(13) CO2 13
OR
12 B Explain chandy and lamport algorithm (13) CO2 13
13 A Explain about the lamport distributed mutual exclusionalgorithm.(13) CO3 13
OR
13 B Illustrate with a case study explain Ricart–agrawala algorithm.(13) CO3 13
14A Elaborate the various checkpoint-based rollback-recovery CO4 13
techniques.(13)
OR
14 B Give byzantine agreement tree algorithm and illustrate with anexample. CO4 13
(13)
OR
15 A Discuss the various challenges of cloud platform with an CO5 13
example(13)
OR
15 B Describe the driving factors of cloud in details(13) CO5 13
PART C
16A Express with neat sketch and explain chandy–misra–haas CO3 15
algorithm for the AND model and OR model.
OR
16B Explain about the synchronous versus asynchronous executions in CO1 15
a message-passing system with examples.

You might also like