Register No.
: ____________________
QP Code :
CONTINUOUS ASSESSMENT TEST - I
V SEMESTER
COMPUTER SCIENCE AND ENGINEERING
CS3551 – DISTRIBUTED COMPUTING
(Common To AI&DS)
Regulations - 2021
Duration : 3 Hrs Maximum : 100 Marks
CO1 Explain the foundations of distributed systems. (K2 – Understand)
CO2 Solve synchronization and state consistency problems. (K3 – Apply)
CO3 Use resource sharing techniques in distributed systems. (K3 – Apply)
CO4 Apply the working model of consensus and reliability in distributed systems. (K3 – Apply)
CO5 Explain the fundamentals of cloud computing. (K2 – Understand)
PART – A (ANSWER ALL QUESTIONS) (Marks 10*2=20)
[Link]. Questions RBT CO Marks
1. Differentiate between message-passing and shared memory systems. UN CO1 2
2. Differentiate between synchronous and asynchronous execution UN CO1 2
3. List any two design issues in distributed computing RE CO1 2
4. Define a distributed program. RE CO1 2
5. Define role of NTP (Network Time Protocol) in physical clock synchronization UN CO2 2
6. Define causal order in message passing UN CO2 2
7. Define total order in group communication. RE CO2 2
8. Define FIFO in snapshot algorithms UN CO2 2
9. Define distributed mutual exclusion. RE CO3 2
10. Differentiate between token-based and non-token-based mutual exclusion algorithms UN CO3 2
PART – B (ANSWER ALL QUESTIONS) (Marks 5*13 = 65)
RB
[Link]. Questions CO Marks
T
Compare and contrast message-passing systems and shared memory systems
11. a EV CO1 13
with real-time examples.
Or
Discuss the major design issues and challenges in distributed computing with
b UN CO1 13
suitable examples.
Discuss the different models of communication networks and analyze their
12. a AN CO1 13
impact on distributed systems.
Or
With examples, explain how motivation influences the design of distributed
b UN CO1 13
systems and their real-world applications.
Describe the Network Time Protocol (NTP) and explain its role in physical clock
13. a UN CO2 13
synchronization.
Or
Compare and contrast different message ordering paradigms in distributed
b EV CO2 13
systems with real-time examples.
Describe snapshot recording algorithms in distributed systems and analyze their
14. a AN CO2 13
significance in global state detection.
Register No: _________________________
Or
b Describe FIFO-based snapshot recording algorithms with an example. UN CO2 13
Compare and contrast Lamport’s algorithm and Ricart-Agrawala’s algorithm in
15. a EV CO3 13
terms of message complexity and efficiency.
Or
Discuss Suzuki-Kasami’s broadcast algorithm and analyze its efficiency in
b UN CO3 13
distributed mutual exclusion.
PART – C (Marks 1*15 = 15)
RB
[Link]. Questions CO Marks
T
Explain in detail the model of distributed computations, including a distributed
16. a program, execution models, communication network models, and the global state UN CO1 15
of a distributed system.
Or
Explain the system model and definitions related to snapshot recording in
b UN CO2 15
distributed computing.
Revised Blooms Taxonomy Divisions PERCENT
TOTAL
level Part-A Part-B Part-C AGE
Remember (RE) 8 0 0 8 5
Understand (UN) 12 65 30 107 59
Apply (AP) 0 0 0 0 0
Analyze(AN) 0 26 0 26 14
Evaluate (EV)* 0 39 0 39 22
Create(CR)* 0 0 0 0 0
Total 20 130 30 180 100
Revised Blooms CO Distribution
Total
Taxonomy level CO1 CO2 CO3
Remember (RE) 4 2 2 8
Understand (UN) 45 47 15 107
Apply (AP) 0 0 0 0
Analyze (AN) 13 13 0 26
Evaluate (EV)* 13 13 13 39
Create (CR)* 0 0 0 0
Total 75 75 30 180
------------------------
STAFF INCHARGE HOD SCRUTINY COMMITTEE PRINCIPAL