Scribd
Upload
30 views

DC IAT - 1 Question

Uploaded by

sheebadaniel1990
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
30 views

DC IAT - 1 Question

Uploaded by

sheebadaniel1990
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

FORM NO.

: F01

JAYARAJANNAPACKIAMCSICOLLEGE OF ENGINEERING
(Approved by AICTE, New Delhi, Affiliated to Anna University, Chennai and
Accredited by NBA (CSE))
MARGOSCHIS NAGAR, NAZARETH.– 628 617

(Common to CSE & IT)


INTERNAL ASSESSMENT TEST – I

Dept./Year/Sem:CSE& IT /III/ V Date:25.09.2024


Course Code & Name:CS3551 Distributed Computing Session: AN
Course in-charge:Mrs.A.Bamila Rachel&Mrs.D.Sheeba Duration:1.30HRS
Designation & Department:AP/CSE& AP/IT Max. Marks:50

Course Outcomes:
CO1: Explain the foundations of distributed systems
CO2: Solve synchronization and state consistency problems
CO3 Use resource sharing techniques in distributed systems
CO4: Apply working model of consensus and reliability of distributed systems
CO5: Explain the fundamentals of cloud computing

PART-A (Answer all questions) 5 x 2 = 10 Marks


Q. Questions Course Blooms Level Marks
No. Outcome
1 Define distributed program CO1 REMEMBER
2 Define transparency .What are its types? CO1 REMEMBER
3 Demonstrate happens- before relation CO1 APPLY
4 What problem with Lamport’s clocks to vector clocks CO2 UNDERSTAND
solve?
5 What are the conditions for deadlock? CO3 UNDERSTAND

PART-B (Answer all questions) 4 x 7 = 28 Marks

Q. Questions Course Blooms Level Marks


No. Outcome
6 a) Explain the design issues and challenges in distributed
system?
(OR)
CO1 UNDERSTAND
b) Explain detail about Primitives for Distributed
Communication?
7 a) Explain the models of Communication Networks&
Synchronous Versus Asynchronous Executions? CO1 UNDERSTAND
(OR)
b) Illustrate the difference between Messaging passing
and shared memory process communication model
8
a) Describe the physical clock synchronization and
logical clock synchronization and explain the
framework of a system of logical clock. CO2 UNDERSTAND
(OR)
b) Discuss in detail about message ordering paradigms
a) Outline the Lamport’s algorithm and illustrate the
algorithm with an Example.
9
(OR)
CO3 CREATE
b) Outline Ricart and Agrawala’s algorithm for
implementing mutual exclusion in distributed systems
and illustrate the algorithm.

PART-C (Answer all questions) 1 x 12 = 12 Marks

Q. Questions Course Blooms Level Marks


No. Outcome
a) Explain various ways of ordering messages in group
communications. Also illustrate distributed algorithm
10
to implement total order and causal order of
messages. CO2
APPLY
(OR)
b) Give a real time scenario where FIFO message queue
is used. Write and describe the snapshot algorithms
for FIFO channels.

TOTAL

You might also like