0% found this document useful (0 votes)
3 views

distributed computing model

This document outlines the Continuous Internal Assessment (CIA) model for the subject 'Distributed Computing' at Sri Balaji Chockalingam Engineering College. It includes the exam structure, marking scheme, and a detailed list of questions divided into three parts, covering various topics related to distributed systems and cloud computing. The document also specifies the staff involved and the total number of students in the class.

Uploaded by

HoD CSE
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
0% found this document useful (0 votes)
3 views

distributed computing model

This document outlines the Continuous Internal Assessment (CIA) model for the subject 'Distributed Computing' at Sri Balaji Chockalingam Engineering College. It includes the exam structure, marking scheme, and a detailed list of questions divided into three parts, covering various topics related to distributed systems and cloud computing. The document also specifies the staff involved and the total number of students in the class.

Uploaded by

HoD CSE
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

FORM NO.

F/ EVAL / 005
Rev.00 Date 01.11.2022
Page 1 of 2

SRI BALAJI CHOCKALINGAM ENGINEERING COLLEGE


Arcot Road, A.C.S. Nagar,Irumbedu, Arni (TK) – 632 317. T.V. Malai Dist
CONTINUOUS INTERNAL ASSESSMENT- UG CIA MODEL

SUB. CODE: CS3551 SUB.NAME: DISTRIBUTED COMPUTING


DEGREE : B.E BRANCH: CSE
YEAR/SEMESTER: III / V SECTIONS/COMMON TO: - / -
MAX.MARKS: 100 DURATION: 180 Minutes
DATE: .11.24 PORTION: Full Portion

Q. Question Mar CO BL PI
No ks code

PART A - 10 x 2=20 Marks - Answer All Questions

1 What is the role of middleware in a distributed system ? 2 1 R

2 What is distribted system ? 2 1 R

3 Write the happens before relation ? 2 2 R

4 What is clock skew ? 2 2 R

5 What are the requirements of mutual exclusion algorithm ? 2 3 A

6 What do you mean by deadlock avoidance ? 2 3 R

7 Mention some motivations for replication ? 2 4 L

8 Define recovery ? 2 4 R

9 What is Azure ? 2 5 A

10 What is cloud service ? 2 5 R

PART B- 5 X 13 = 65 Marks - Answer All Questions

11 a) i) Explain difference between message passing and shared 13 1 L


memory ? (7)
ii) Discuss primitives for distributed communication (6)
OR
b) i) What is distributed system ? What is need of distributed
system? (7)
ii) Explain global state of distributed system ? (6)
12 a) i) Explain happen before relation with example (7) 13 2 L
ii) Discuss Berkeley algorithm (6)
OR
b) i) What is scalar time ? Explain properties of scalar time (7)
ii) Explain the types of group communications used in
distributed system (6)
13 a) Explain Ricart Agrawala algorithm with an example (13) 13 3 U
OR
b) i) Explain requirement and performance metric of mutual
exclusion (6)
ii) Discuss AND model and OR model of deadlock (7)
FORM NO. F/ EVAL / 005
Rev.00 Date 01.11.2022
Page 2 of 2

SRI BALAJI CHOCKALINGAM ENGINEERING COLLEGE


Arcot Road, A.C.S. Nagar,Irumbedu, Arni (TK) – 632 317. T.V. Malai Dist
14 a) i) Explain strongly consistent set of checkpoints (6) 13 4 U
ii) Discuss coordinated checkpointing algorithm (7)
OR
b) i) What is local check point? Explain (7)
ii) Discuss Byzantine agreement problem (6)
15 a) i) What is cloud computing explain ? Explain advantage 13 5 R
and disadvantage of cloud computing ? (7)
ii) Define virtualization Explain full virtualization and para
virtualization ? (6)
OR
b) i) What is queuing service ? Dosciss Amazon simple queue
service?
PART C- 1 X 15 = 15 Marks - Answer All Questions

16 a) Show that in the Ricart Agrawala algorithm the critical section 15 2 A


is accessed in increasing order of timestamp ?
OR
b) Discuss the design issues and challenges in distributed system
from a system perspective.
40
Bloom's Level wise Marks Distribution
30
L1 L2 20
L3 L4 10 Series1
L5 L6
0
CO1 CO2 CO3 CO4 CO5

L1 L L3 L L5 L6 CO1 CO2 CO3 CO4 CO5


2 4
17 32 17 17 17
A U R L

CO1: Introduction and understanding about distributed computing.


CO2: The logical time and global state and clock algorithms details.
CO3: Mangae deadlock situation and mutex in distributed computing.
CO4: Know about consensus and recovery of distributed computing communications.
CO5: Cloud computing definition characteristics and virtualization of computing and storage.

Name of the staff : T. KARTHIKEYAN


Department : CSE
Number of pages in the question paper : 42
Total number of students in the class : 45
Date of Submission : -11-23

Signature of the staff :

Signature of the HoD. of the Staff concern :

You might also like