VELAMMAL COLLEGE OF ENGINEERING AND TECHNOLOGY, MADURAI-625 009

(Autonomous)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Academic Year : 2024-2025 (ODD) Batch : 2021-2025

Branch : CSE Year/ Semester/ Section : IV/ VII /B
Course Component : CORE Course In charge : Mrs.S.Kavitha
Course Code / Name : 21CS306 Distributed Systems

UNIT -1- INTRODUCTION

Introduction: Definition –Characteristics-Relation to computer system components –Motivation –
Message-passing systems versus shared memory systems –Primitives for distributed communication –
Synchronous versus asynchronous executions –Challenges of Distributed system: System Perspective. A
model of distributed computations: A distributed program –A model of distributed executions –Models of
communication networks –Global state – Cuts of a distributed computation.

PART A
Q.no Question K-Level
1 Define distributed Systems. Remember
2 What are the services and examples of Middleware? Understand
3 List the consequences faced by the designers in developing Understand
distributed systems.
4 What are the limitations of Distributed System? Understand
5 Show where Distributed System is applied. Remember
6 Estimate how distributed system benefits resource sharing. Understand
7 Describe the main idea of Distributed Systems. Remember
8 Summarize about resource sharing. Remember
9 Discuss the design issues in Intranet. Understand
10 Compare Centralized and Distributed System. Remember
11 Generalize on Heterogeneity. Remember
12 List five reasons why to build distributed System. Understand
13 Analyze briefly on Ubiquitous computing. Understand
14 Show how distributed System helps cloud computing. Remember
15 Illustrate the concept of concurrency. Understand
16 What do you mean by transparency? Remember
17 Develop the scenario how might the clocks in two computers that Understand
are linked by a local network be synchronized without reference to
an external time source
18 Rank the advantages and disadvantages of HTML, URLs and HTTP Remember
as core technologies for information browsing?
19 Classify the security challenges faced by the distributed systems. Remember
20 List the examples of HTTP URL. Understand
21 Give examples of distributed systems . Remember
22 Write the following Remember
(i)HTTP (ii) HTML (iii) URL
23 What are the uses of web services? Remember
24 What is the purpose of heterogeneity mobile code? Remember
25 Why we need openness? Remember
26 How we provide security? Remember
27 Define scalability. Remember
28 What are the types of transparencies? Remember
29 Define transparencies. Remember
30 What are the different types of model? Remember
31 What are the different types of network? Remember
32 Define latency. Remember
33 What is the difference between networking and internetworking? Remember
PART B
1 Design in detail any two application domain where distributed Understand
system is applied.
2 Analyze the challenges in developing a Distributed system and how Understand
distributed system overcomes it.
3 Evaluate the trends in distributed system. Understand
4 What are the domain areas in which Distributed System is used? Understand
5 Describe how will you compare and contrast cloud computing with Understand
more traditional client-server computing? What do you mean by
novel about cloud computing as a concept?
6 Utilize the World Wide Web as an example to illustrate the concept Understand
of resource sharing, client and server.
7 List the three main software components that may fail when a client Understand
process invokes a method in a server object, giving an example of a
failure in each case. Suggest how the components can be made to
tolerate one another’s failures
8 (i)Summarize in detail about resource sharing and the challenges Understand
involved in it.
(ii)Give the types of local resource that are vulnerable to an attack
by an untrusted program that is downloaded from a remote site and
run in a local computer.
9 Label an example of a HTTP URL. List the main components of an Understand
HTTP URL, stating how their boundaries are denoted and
illustrating each one from your example. To what extent is an HTTP
URL location-transparent ?
10 i.Examine distributed system and discover the characteristics of Understand
ii.Distributed system
Demonstrate how distributed computing is used as an utility.
11 i. List the various challenges in distributed systems and explain Understand
them.
ii. Describe the examples of Distributed Systems.
12 Point out in detail the recent trends in distributed Systems Understand
13 i. Summarize on WWW. Understand
ii. Describe the examples of Distributed Systems.
14 Discuss in detail the model of distributed computations Understand
15 Illustrate the framework for a system of logical clocks Understand
 16 Explain in detail about Logical time. Understand

Course In-charge Course Coordinator Module Coordinator HoD

 VELAMMAL COLLEGE OF ENGINEERING AND TECHNOLOGY, MADURAI-625 009
(Autonomous)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Academic Year : 2024-2025 (ODD) Batch : 2021-2025

Branch : CSE Year/ Semester/ Section : IV/ VII /B
Course Component : CORE Course In charge : Mrs.S.Kavitha
Course Code / Name : 21CS306 Distributed Systems

UNIT -2- MESSAGE ORDERING & GROUP COMMUNICATION

Message ordering and group communication: Message ordering paradigms –Asynchronous execution
with synchronous communication –Synchronous program order on an asynchronous system –Group
communication – Causal order (CO) - Total order.

PART A
Q.no Question K-Level
1 What is Message ordering? Remember
2 Explain the generations of distribute system. Understand
3 Explain Group communication. Understand
4 Discuss on shared memory Approach. Understand
5 What is Asynchronous execution in synchronous communication? Remember
6 Discuss the design issues of RMI. Understand
7 Lists the roles and responsibilities of distributed systems. Remember
8 What are the characteristics of multicast communication? Remember
9 Differentiate marshalling and unmarshalling. Understand
10 Define Total ordering. Remember
11 lists remote object reference is applied? Remember
12 Discuss on overlay networks. Understand
13 Discuss why there is no explicit data typing in CORBA. Understand
14 lists the main arguments for adopting a super node approach in Remember
Skype.
15 Describe Remote procedure call. Understand
16 What is the role of proxy servers and mobile code? Remember
17 Distinguish RMI and RPC. Understand
18 What are the request reply protocols? Remember
19 List the types of Communication paradigms. Remember
20 Discuss how will you make use of message queues. Understand
21 Define Datagram. Remember
22 What are the characteristic of network hidden by streamabstraction? Remember
23 What is the use of remote object references? Remember
24 What is snapshot algorithm? Remember
25 What is meant by group communication? Remember
26 What is meant by distributed garbage collection? Remember
 PART - B
1 Explain in detail about Message ordering paradigms Understand
2 Explain the concept of Asynchronous execution with synchronous Understand
communication
3 What is Synchronous program? Explain in detail about Synchronous Understand
program order on an asynchronous system
4 Define Causal order and Explain in detail about Total order Understand
5 Illustrate the concept of Snapshot algorithms for FIFO channels Understand

Course In-charge Course Coordinator Module Coordinator HoD

 VELAMMAL COLLEGE OF ENGINEERING AND TECHNOLOGY, MADURAI-625 009
(Autonomous)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Academic Year : 2024-2025 (ODD) Batch : 2021-2025

Branch : CSE Year/ Semester/ Section : IV/ VII /B
Course Component : CORE Course In charge : Mrs.S.Kavitha
Course Code / Name : 21CS306 Distributed Systems

UNIT -3- DISTRIBUTED MUTEX & DEADLOCK

Distributed mutual exclusion algorithms: Introduction – Preliminaries – Lamport‘s algorithm – Ricart-
Agrawala algorithm – Maekawa‘s algorithm – Suzuki–Kasami‘s broadcast algorithm. Deadlock detection
in distributed systems: Introduction – System model – Preliminaries – Models of deadlocks – Knapp‘s
classification

PART A
Q.no Question K-Level
1 Define mutual exclusion Remember
2 List the characteristics of mutual exclusion. Remember
3 List the types of mutual exclusion algorithms. Understand
4 List the functional and nonfunctional requirements of peer to peer Remember
middleware systems.
5 What is the use of routing overlay? Remember
6 Define pastry. Remember
7 Differentiate Structured and unstructured peer-to-peer systems. Understand
8 List the file accessing models. Remember
9 Express in diagram the file attributes record structure. Understand
10 What are the advantages in using name caches in file systems. Remember
11 Explain the working of Andrew File system. Understand
12 What do you mean by cache consistency? Remember
13 Give the design issues of Distributed file system. Understand
14 What data must the NFS client module hold on behalf of each user-level Remember
process?
15 Explain how does AFS deal with the risk that callback messages may be Understand
lost?
16 Define URI, URL and URN. Remember
17 Discuss how will you make use of name space and DNS? Understand
18 Explain how caching helps a name service’s availability? Understand
19 Explain on LDAP. Understand
20 Discuss the use of name cache. Understand
21 What is meant by cluster? Remember
22 What is meant by address space? Remember
23 What are core OS Components? Remember
24 Difference between monolithic and micro kernels Remember
25 What is meant by distributed file system? Remember
26 What are the different types of distributed file system available? Remember
 PART B
1 Illustrate and explain the types of Distributed mutual exclusion algorithms Understand
2 Explain in detail about Lamport‘s algorithm with example. Understand
3 Explain in detail about Ricart-Agrawala algorithm with example. Understand
4 Explain in detail about Maekawa‘s algorithm with example. Understand
5 Explain in detail about Suzuki–Kasami‘s broadcast algorithm with Understand
example.
6 Discuss in detail about Models of deadlocks Understand
7 Explain in detail about Knapp‘s classification with example. Understand
8 Elucidate the concept of Algorithms for the single resource model, the Understand
AND model and the OR model.

Course In-charge Course Coordinator Module Coordinator HoD

 VELAMMAL COLLEGE OF ENGINEERING AND TECHNOLOGY, MADURAI-625 009
(Autonomous)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Academic Year : 2024-2025 (ODD) Batch : 2021-2025

Branch : CSE Year/ Semester/ Section : IV/ VII /B
Course Component : CORE Course In charge : Mrs.S.Kavitha
Course Code / Name : 21CS306 Distributed Systems

UNIT -4- CHECKPOINTING AND ROLLBACK RECOVERY

Introduction – Background and definitions – Issues in failure recovery – Checkpoint-based recovery –
Log-based rollback recovery – Koo-Toueg coordinated checkpointing algorithm – Juang- Venkatesan
algorithm for asynchronous checkpointing and recovery.

PART A
Q.no Question K-Level
1 Define clock screw and clock drift rate. Remember
2 Describe How will you synchronize physical clock? Understand
3 What is meant by “Happened Before relationship”? Remember
4 List the reason why computer clock synchronization is necessary. Remember
5 Define distributed mutual exclusion Remember
6 Differentiate physical clock and Logical clock. Understand
7 Explain How will you assess a consensus problem ? Understand
8 List the use nested transaction. Remember
9 List the ACID properties. Remember
10 What is concurrency control? Give its use. Remember
11 Explain how will you make use of nested transaction? What are its Understand
rules?
12 Define deadlock. Remember
13 Discuss what are the advantages and drawbacks of multi version Understand
timestamp ordering in comparison with ordinary timestamp
ordering?
14 What data must the NFS client module hold on behalf of each user- Remember
level process?
15 Explain How does AFS deal with the risk that callback messages Understand
may be lost?
16 Define URI, URL and URN. Remember
17 Explain how will you make use of name space and DNS? Understand
18 Explain how caching helps a name service’s availability? Understand
19 Define how will you assess LDAP? Understand
20 List the use of name cache. Remember

PART B
1 Explain in detail about the following with suitable examples. Understand
i. Issues in failure recovery
 ii. Checkpoint-based recovery
iii. Log-based rollback recovery
2 Explain the logic behind the Coordinated checkpointing algorithm Understand
3 Illustrate the concept of algorithm for asynchronous checkpointing and Understand
recovery with example.
4 Discuss in detail about Agreement in synchronous systems with failures Understand
5 Outline the concept of Consensus and agreement algorithms with suitable Understand
examples.

Course In-charge Course Coordinator Module Coordinator HoD

 VELAMMAL COLLEGE OF ENGINEERING AND TECHNOLOGY, MADURAI-625 009
(Autonomous)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Academic Year : 2024-2025 (ODD) Batch : 2021-2025

Branch : CSE Year/ Semester/ Section : IV/ VII /B
Course Component : CORE Course In charge : Mrs.S.Kavitha
Course Code / Name : 21CS306 Distributed Systems

UNIT -5- P2P & DISTRIBUTED SHARED MEMORY

Peer-to-peer computing and overlay graphs: Introduction – Data indexing and overlays – Content
addressable networks – Tapestry. Distributed shared memory: Abstraction and advantages – Types of
memory consistency models.

PART A
Q.no Question K-Level
1 Define Process Migration Remember
2 Classify the desirable features of good process migration Apply
3 What are the advantages of process migration? Remember
4 Define thread. Remember
5 List the advantages of thread. Remember
6 What are the sub activities involved in process migration? Remember
7 Explain how process migration be done in heterogeneous system? Understand
8 List the features of scheduling algorithm. Remember
9 Discuss the goals to achieve on optimal assignment. Understand
10 Explain how thread scheduling is classified? Understand
11 Distinguish static versus dynamic load balancing algorithm. Understand
12 List the issues in designing the load balancing algorithm. Remember
13 Discuss on the issues in designing the load sharing approaches Understand
14 Give the techniques and methodologies for scheduling process of a Understand
distributed system.
15 Show the use of task assignment approach. Understand
16 Discuss the goals achieved by task assignment approach. Understand
17 List the priority assignment rules. Remember
18 Show how load estimation policies are utilized? Apply
19 Discuss the migration limiting policies. Understand
20 Explain the star information exchange policies. Understand
21 Define time stamp ordering. Remember
22 Define two-phase commit protocol. Remember
23 Define Edge chasing. Remember
24 Define strict two phase locking. Remember
25 Difference between validation phase and update phase Understand
 PART B
1 Outline in detail the concept of Overlays. Understand
2 Explain in detail about Content addressable networks with example Understand
3 Explain in detail about Tapestry with example Understand
4 Illustrate in detail about Memory consistency models with example Understand
5 Discuss in detail about Shared memory Mutual Exclusion. Understand

Course In-charge Course Coordinator Module Coordinator HoD