Scribd
Upload
10 views2 pages

Distributed Computing Exam Questions

This document outlines the model exam for the subject of Distributed Computing at Pandian Saraswathi Yadav Engineering College, detailing the exam structure, including parts A, B, and C with specific questions and marks allocation. It includes topics such as synchronous and asynchronous execution, transparency, group communication, deadlock avoidance, and cloud computing. The exam is designed for III & V semester students under the supervision of faculty member R. Abirami.

Uploaded by

20CSE4003 ABIRAMI. R
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
10 views2 pages

Distributed Computing Exam Questions

This document outlines the model exam for the subject of Distributed Computing at Pandian Saraswathi Yadav Engineering College, detailing the exam structure, including parts A, B, and C with specific questions and marks allocation. It includes topics such as synchronous and asynchronous execution, transparency, group communication, deadlock avoidance, and cloud computing. The exam is designed for III & V semester students under the supervision of faculty member R. Abirami.

Uploaded by

20CSE4003 ABIRAMI. R
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

Pandian Saraswathi Yadav Engineering College, Arasanoor-630561

Department Of CSE,AIDS,AIML,CS,IT
Exam :MODEL EXAM Max. Marks : 100
Date : Time :1.00 TO 4 .00 PM
Sub Code : CS3551 Subject Name: Distributed Computing
Year &Sem : III & Vth sem Name of The Faculty :[Link] CSE
PART A (Answer all the questions) (10*2=20)
Q.N CO’ B
QUESTIONS M
O s T

1. What do you mean by synchronous and asynchronous execution? 2 1 1


2. Define Transparency. What are its types? 2 1 1
3. What is meant by group communication in distributed system? 2 2 1
4. What is global state of the distributed system? 2 2 1
5. What do you mean by deadlock avoidance? 2 3 1
6. Name the two types of messages used in Ricart-Agrawala's
2 3 1
algorithm
7. What do you meant by Distributed debugging? 2 4 1
8. What are the rules of committing nested transactions? 2 4 1
9. Characteristics of Cloud Computing 2 5 1
10. What is IAAS? 2 5 1

PART B (5*13=65) (Answer all the questions)

Q.N CO’
QUESTIONS M BT
O s
a. Explain how a parallel system differs from a distributed
13 1 2
system
11. (or)
[Link] the difference between message passing and shared
13 1 2
memory process communication model
[Link] about Chandy Lamport Snapshot algorithms for FIFO
13 2 2
channels
12. (Or)
[Link] on the total and casual order in distributed system
13 2 1
with a neat diagram
Name and explain the different types of deadlock models in
a.
distributed system with the commonly used strategies to 13 3 2
handle deadlocks with a neat diagram.
13.
(Or)
[Link] Chandy–Misra–Haas algorithm for the AND & OR
13 3 2
model.
a. Illustrate briefly the two kinds of checkpoints for checkpoint
13 4 2
14. algorithm?
(Or)
b.
Illustrate the different types of failure in distributed systems? 13 4 1
5 a [Link] about cloud models 13 5 1
(Or)
b [Link] between cloud computing and Virtualization 13 5 2

PART C (1*15=15) (Answer all the questions)

Q.N BT
QUESTIONS M CO’s
O
1 a. Discuss the issues of failure recovery with an example?
15 5 2

(or)
b. Explain about Message ordering paradigms 15
4 1

M – Mark; COs – Course Outcome; BT – Bloom Taxonomy 1- Remember 2- Understand 3- Apply 4-Analyze 5- Evaluate and 6-Create

STAFF IN-CHARGE HOD IQAC PRINCIPAL

You might also like