Chapter-wise Question Bank

Year(s): 2066, 2067, 2068, 2069, 2070, 2071, 2072, 2074, 2075, 2076, 2078, 2079, 2080, 2081
Session(s): Back, Regular/Back, Regular
Total Questions: 215

Chapter 1 - Introduction

Questions: 24

Q1. [4+4 marks]

What are the major goals of distributed system? Explain the need of transparency in
distributed system along with the challenges in achieving that.
Appeared in: 2069-Regular

Q2. [2+6 marks]

Define Distributed System, What are advantages and disadvantages of distributed

system?
Appeared in: 2070-Regular

Q3. [[6+2] marks]

"Distributed system acts as a single coherent system to its end user." Justify the
statement with its features and challenges. What is fundamental model?
Appeared in: 2071-Regular

Q4. [2+6 marks]

Differentiate between centralized and distributed system? Explain the design issues
related to distributed system.
Appeared in: 2072-Regular

Q5. [2+8 marks]

Define Distributed System (DS). Explain the requirements to successfully implement

DS to suit to modern computing.
Appeared in: 2076-Regular

Q6. [2+6 marks]

What do you mean by Distributed System (DS)? Explain various models of Distributed
Computing Systems.
 Appeared in: 2078-Regular

Q7. [4+4 marks]

Transparency is one of the important design goals of distributed system. Justify it. List
out the advantages of distributed system over centralized system.
Appeared in: 2079-Regular

Q8. [2+6 marks]

Define the term "distributed system". In terms of qualities, advantages and

complexities, Compare it with the centralized systems.
Appeared in: 2080-Regular

Q9. [2+6 marks]

Define distributed system (DS). Briefly discuss about the models of DS.
Appeared in: 2081-Regular

Q10. [2×4 marks]

Write short notes on: (Any Two) b) Goals of DS

Appeared in: 2081-Regular
(a) b) Goals of DS

Q11. [3+5 marks]

What are the principle applications of Distributed System (DS)? Discuss the
advantages and disadvantages of DS.
Appeared in: 2066-Back

Q12. [2+4+4 marks]

What is an architectural style? Discuss with one example structured P2P architecture.
What is a super peer, discuss its usage in P2P systems?
Appeared in: 2067-Regular/Back

Q13. [4+4 marks]

Describe precisely what is meant by a scalable system. Explain distribution

transparency in Distributed Systems.
Appeared in: 2068-Back
(a) Describe precisely what is meant by a scalable system.

(b) Explain distribution transparency in Distributed Systems.

Q14. [10 marks]

a. Explain Distributed computing systems. b. Define architectural styles. Describe
common architectural styles.
Appeared in: 2068-Regular/Back
(a) a. Explain Distributed computing systems.

(b) b. Define architectural styles. Describe common architectural styles.

Q15. [10 marks]

a. Explain different centralized system architectures. b. Discuss super peer in

decentralized architecture.
Appeared in: 2068-Regular/Back
(a) a. Explain different centralized system architectures.

(b) b. Discuss super peer in decentralized architecture.

Q16. [2+6 marks]

How do you define Distributed System? Explain with the model, how hardware, data
and controls are distributed in the distributed system environment.
Appeared in: 2070-Back

Q17. [6+2 marks]

Discuss the properties of Distributed System (DS). How interaction model addresses
the relevant issues in DS?
Appeared in: 2071-Back

Q18. [2+6 marks]

What is Distributed System? Discuss the challenges of Distribution System with

example.
Appeared in: 2072-Back

Q19. [2+6 marks]

Why there are challenges in achieving some requirements of a distributed system?

Explain the challenges associated with different requirements of distributed system.
Appeared in: 2074-Back

Q20. [4+4 marks]

Why distributed system is preferred over centralized system? Explain the layers of
transparency.
Appeared in: 2075-Back

Q21. [2+6 marks]

Define distributed system? Explain Transparency Properties of Distributed System.

 Appeared in: 2075-Back

Q22. [8 marks]

What are the major goals of distributed system and what are the challenges during the
design of distributed system.
Appeared in: 2076-Back

Q23. [[6+2] marks]

Explain the design goals and challenges in distributed system. What is fundamental
model?
Appeared in: 2080-Back

Q24. [2+8 marks]

What is Distributed System (DS)? Write the importance and goals of DS.
Appeared in: 2081-Back
Chapter 2 - Distributed Objects and File System

Questions: 40

Q1. [3+5 marks]

How do you convince that middleware plays the important role in Distributed System?
Explain the operation of RPC in client server communication in Distributed System.
Appeared in: 2069-Regular

Q2. [2+6 marks]

Differentiate between RPC and RMI. How does modern RPC maintain the
transparency in distributed system?
Appeared in: 2070-Regular

Q3. [[2+6] marks]

Define DFS. How RMI perform communication between distributed objects? Explain.
Appeared in: 2071-Regular

Q4. [[10] marks]

Verify with proper explanations that DNS is a distributed hierarchical database system.
Appeared in: 2071-Regular

Q5. [2+6 marks]

Discuss the importance of Distributed File System (DFS). Describe the operations of
SUNNFS with its properties.
Appeared in: 2072-Regular

Q6. [8+2 marks]

Explain RMI with suitable diagram. How RMI is superior to RPC?

Appeared in: 2072-Regular

Q7. [3+5 marks]

Discuss the functionalities provided by RMI software. How is the event and notification
system implemented in distributed object based communication?
Appeared in: 2076-Regular

Q8. [2+7 marks]

What is distributed file system? Explain the principle operations of any one modern
distributed file system?
Appeared in: 2076-Regular
Q9. [4+4 marks]

Elaborate the differences between RMI and RPC. Describe the File Service
Architecture of DFS.
Appeared in: 2078-Regular

Q10. [4+4 marks]

What are the design issues on NFS? Show the complete working of DNS.
Appeared in: 2078-Regular

Q11. [2+3+2 marks]

What is recursive and iterative query? Describe working mechanism of DNS with
suitable example. Mention the role of distributed file system.
Appeared in: 2079-Regular

Q12. [2+6 marks]

Define distributed object and IDL. How RPC operation is performed in client server
communication in distributed system.
Appeared in: 2080-Regular

Q13. [4+4 marks]

Explain file service architecture for DFS. Define queries and operation of distributed
hierarchical DB: DNS.
Appeared in: 2080-Regular

Q14. [2×4 marks]

Write short notes on: (Any Two) c) Advantages and consequences of statelessness in
DFS
Appeared in: 2080-Regular
(a) c) Advantages and consequences of statelessness in DFS

Q15. [3+5 marks]

Define local and remote method invocation in distributed system. Explain the
functional steps taken by modern RPC with its communication semantics.
Appeared in: 2081-Regular

Q16. [4+4 marks]

What are the requirements of Distributed File System? Describe file service
architecture for Distributed File System.
Appeared in: 2066-Back
Q17. [1+4 marks]

a) Why naming is necessary in distributed system? Explain Domain Naming Service

(DNS) with its features.
Appeared in: 2066-Back
(a) a) Why naming is necessary in distributed system? Explain Domain Naming
Service (DNS) with its features.

Q18. [6+4 marks]

Discuss assumptions made in GFS design and their consequences. Explain the
metadata of GFS?
Appeared in: 2067-Regular/Back

Q19. [10 marks]

Explain data and control flow and working of lease mechanish in normal write
operation of GFS.
Appeared in: 2067-Regular/Back

Q20. [10 marks]

a. Discuss the single master aspect of GFS architecture. b. Enlist GFS metadata. Why
chunk locations not persisted by master, discuss it.
Appeared in: 2068-Regular/Back
(a) a. Discuss the single master aspect of GFS architecture.

(b) b. Enlist GFS metadata. Why chunk locations not persisted by master, discuss it.

Q21. [10 marks]

a. Discuss consistency guarantees made by GFS. b. Explain the lease mechanism in

GFS with examples.
Appeared in: 2068-Regular/Back
(a) a. Discuss consistency guarantees made by GFS.

(b) b. Explain the lease mechanism in GFS with examples.

Q22. [10 marks]

a. Discuss GFS high availability. b. Discuss re-replication and rebalancing role of GFS
master.
Appeared in: 2068-Regular/Back
(a) a. Discuss GFS high availability.

(b) b. Discuss re-replication and rebalancing role of GFS master.

Q23. [4+4 marks]

Explain the ways how distributed objects communicate with each other. Differentiate
between RPC and RMI.
Appeared in: 2070-Back

Q24. [2+6 marks]

Define distributed file system. Draw and explain distributed file service architecture in
detail.
Appeared in: 2070-Back

Q25. [3+5 marks]

What is the importance of IDL in RMI? Write the operation of static RMI.
Appeared in: 2071-Back

Q26. [3+5 marks]

What are the characteristics of SUN-NFS? Discuss with its architecture.

Appeared in: 2071-Back

Q27. [4+6 marks]

Mention the role of IDL and middleware in Distributed System. Explain RMI approach
in the distributed object based system.
Appeared in: 2072-Back

Q28. [8 marks]

Define DFS. How does DFS encourage sharing a storage device? Explain with the
help of suitable architecture.
Appeared in: 2072-Back

Q29. [3+5 marks]

Define distributed object and IDL. Compare RPC and RMI architecture.
Appeared in: 2074-Back

Q30. [3+5 marks]

What is stateful and stateless service in file system? Explain the DNS working
mechanism with suitable practical example.
Appeared in: 2074-Back

Q31. [3+5 marks]

What do you mean by RMI software? Comparatively discuss RPC with RMI.
Appeared in: 2075-Back
Q32. [2+6 marks]

Compare Stateful and stateless service. Describe the architecture and operation of
SUNNFS with its services.
Appeared in: 2075-Back

Q33. [2+6 marks]

Why naming is necessary in distributed system? Explain Sun Network File System
architecture with its features.
Appeared in: 2075-Back

Q34. [2+6 marks]

What is DNS? Explain the DNS working mechanisms with suitable example.
Appeared in: 2075-Back

Q35. [8 marks]

Define distributed objects and explain communication between distributed system.

Appeared in: 2076-Back

Q36. [8 marks]

Define Distributed file system. Point out the differences between stateless and stateful
services.
Appeared in: 2076-Back

Q37. [[2+6] marks]

Explain the role of middleware in Distributed System. Explain the operation of dynamic
RMI.
Appeared in: 2080-Back

Q38. [[3+5] marks]

Compare stasteful and stateless services. Explain the operation and architecture of
any one modern distributed file system.
Appeared in: 2080-Back

Q39. [2+8 marks]

What do you mean by Request Replay Protocol? Discuss how dynamic RMI works.
Appeared in: 2081-Back

Q40. [10 marks]

Explain the principle operation with architecture of recently used distributed file
system.
Appeared in: 2081-Back
Chapter 3 - Operating System Support

Questions: 14

Q1. [4+4 marks]

Why network operating system (NOS) is widely preferred over distributed operating
system (DOS) in practical distributed systems? Explain DOS as a middleware.
Appeared in: 2069-Regular

Q2. [2+2 marks]

Compare process and threads. Why threads are important in distributed System.
Appeared in: 2070-Regular

Q3. [[4+2+2] marks]

List the goals of JINI. What are CORBA services? How does operating system support
for distributed system?
Appeared in: 2071-Regular

Q4. [4+4 marks]

Write short notes on: i) Distributed OS

Appeared in: 2072-Regular
(a) i) Distributed OS

Q5. [4 marks]

a) What are the key differences between Network OS and Distributed OS. b) Explain
the various roles of middleware in DS.
Appeared in: 2078-Regular
(a) a) What are the key differences between Network OS and Distributed OS.

(b) b) Explain the various roles of middleware in DS.

Q6. [3 marks]

Process and threads in a DS

Appeared in: 2079-Regular

Q7. [3 marks]

Monolithic and micro kernel

Appeared in: 2079-Regular

Q8. [2+3 marks]

b) What are the advantages of micro-kernel over monolithic-kernel? In your view,
which kernel is preferable for distributed Operating system and why?
Appeared in: 2066-Back
(a) b) What are the advantages of micro-kernel over monolithic-kernel? In your
view, which kernel is preferable for distributed Operating system and why?

Q9. [2×3 marks]

Write short notes on: i) Process Resilience ii) Mach

Appeared in: 2066-Back
(a) i) Process Resilience

(b) ii) Mach

Q10. [4+4+4 marks] (Repeated 2 times)

Write short notes on (Any Three) [a] Monolithic and Micro-Kernel

Appeared in: 2071-Back, 2072-Back
(a) Monolithic and Micro-Kernel

Q11. [4+2+2 marks]

How threads differ from process? How does checkpoint help in recovery? What does
distributed commit refer to?
Appeared in: 2072-Back

Q12. [4+4 marks]

What are the characteristics of distributed operating system? Explain ORB and its
interfaces.
Appeared in: 2074-Back

Q13. [2+4 marks]

What do you mean by DOS (Distributed Operating System)? Briefly explain the
Monolithic and microkernel architectures of operation system.
Appeared in: 2075-Back

Q14. [8 marks]

Write short notes on any two: a) RPC b) Monolithic and micro kernel c) Mach
Appeared in: 2076-Back
(a) RPC

(b) Monolithic and micro kernel

(c) Mach
Chapter 4 - Distributed Heterogeneous Applications and CORBA

Questions: 21

Q1. [2+4 marks]

What is IDL? Explain CORBA RMI with its services.

Appeared in: 2069-Regular

Q2. [3+3 marks]

Write short notes on: a) Comparison of CORBA and Mach

Appeared in: 2070-Regular
(a) Comparison of CORBA and Mach

Q3. [[3×4] marks]

Write short notes on: a) Heterogeneity in distributed system b) Rendezvous concept

and implementation
Appeared in: 2071-Regular
(a) a) Heterogeneity in distributed system

(b) b) Rendezvous concept and implementation

(c) c) Flat versus nested locks

(d) d) Process Resilience

Q4. [4+4 marks] (Repeated 2 times)

Write short notes on: ii) JINI

Appeared in: 2072-Regular, 2080-Regular
(a) ii) JINI

Q5. [2+8 marks]

What is the role of middleware in DS? Explain about CORBA and its services.
Appeared in: 2072-Regular

Q6. [3×3 marks]

Write short notes on: (Any Three) a. Three Phase Commit. b. CORBA component for
RMI e. MACH
Appeared in: 2076-Regular
(a) Three Phase Commit

(b) CORBA component for RMI

 (c) MACH

Q7. [4+4 marks]

Write short notes on: (Any Two) a) JINI b) Distributed Debugging c) CORBA
Architecture d) Process Resilience
Appeared in: 2078-Regular
(a) a) JINI

(b) b) Distributed Debugging

(c) c) CORBA Architecture

(d) d) Process Resilience

Q8. [4+5 marks]

Define distributed object and remote interface. How RMI helps in distributed
programming model? Explain with architecture.
Appeared in: 2079-Regular

Q9. [3 marks]

ORB and its interfaces

Appeared in: 2079-Regular

Q10. [2+6 marks]

What is RMI? Explain CORBA architecture in Distributed System along with services.
Appeared in: 2080-Regular

Q11. [2×4 marks]

Write short notes on: (Any Two) d) CORBA dynamic invocation

Appeared in: 2081-Regular
(a) d) CORBA dynamic invocation

Q12. [4 marks]

a) What are the components of CORBA environment?

Appeared in: 2066-Back
(a) a) What are the components of CORBA environment?

Q13. [6+4 marks]

Discuss the problems associated with parameter passing in RPC. Explain with
diagram different alternatives of asynchronous RPC.
Appeared in: 2067-Regular/Back
Q14. [4+4 marks]

Explain term 'NoSQL'. Why does normalization fail in data analytics scenario?
Appeared in: 2068-Back
(a) Explain term 'NoSQL'.

(b) Why does normalization fail in data analytics scenario?

Q15. [4 marks]

Differentiate between homogeneous and heterogeneous distributed applications with

example.
Appeared in: 2070-Back

Q16. [2+4 marks]

Write different services provided by CORBA. What are dynamic and static invocation
approaches of CORBA.
Appeared in: 2070-Back

Q17. [4+4+4 marks]

Write short notes on (Any Three) [b] Services provided by CORBA with the functions
of Object Adapter
Appeared in: 2071-Back
(a) Services provided by CORBA with the functions of Object Adapter

Q18. [4×3 marks]

Write short notes on: c) CORBA services

Appeared in: 2072-Back
(a) c) CORBA services

Q19. [3+5 marks]

Compare heterogeneous and homogeneous distributed system. Explain the CORBA

architecture and its services.
Appeared in: 2075-Back

Q20. [2+4 marks]

Define Object Adapter. Explain the invocation methods in CORBA.

Appeared in: 2075-Back

Q21. [8 marks]

Explain components in CORBA architecture with a diagram.

Appeared in: 2076-Back
Chapter 5 - Time and State in Distributed Systems

Questions: 24

Q1. [2+6 marks]

Define logical and physical clocks. Explain Lamport timestamp algorithm along with an
example.
Appeared in: 2069-Regular

Q2. [2+4+2 marks]

What do you mean physical and logical clocks? Explain Network Time Protocol and
Berkeley Algorithm for physical clock synchronization.
Appeared in: 2070-Regular

Q3. [2+2+6 marks]

Differentiate between physical clock and logical clock. Why it is difficult to synchronize
physical clock? Describe a method for physical clock synchronization.
Appeared in: 2072-Regular

Q4. [2+8 marks]

What is the issue in Lamport's timestamp? How do you avoid the issue? Explain with
your alternate algorithm.
Appeared in: 2076-Regular

Q5. [3×3 marks]

Write short notes on: (Any Three) c. Physical Clock Synchronization: Cristain's
Algorithm
Appeared in: 2076-Regular
(a) Physical Clock Synchronization: Cristain's Algorithm

Q6. [6+2 marks]

Write implementation rules of Lamport clock. State the limitations of Lamport logical
clock.
Appeared in: 2078-Regular

Q7. [4+6 marks]

Define cuts of a distributed computation along with its types. How is casual ordering of
message realized using vector clocks?
Appeared in: 2079-Regular

Q8. [8 marks]
"Vector timestamp mechanism for synchronization is used for causality of events".
Justify with the implementation rules and examples.
Appeared in: 2080-Regular

Q9. [2×4 marks]

Write short notes on: (Any Two) d) NTP

Appeared in: 2080-Regular
(a) d) NTP

Q10. [2+2+4 marks]

How did the international atomic clock establish? List the basic principle of Lamport's
clock and proposed the approach to avoid issues with Lamport's clock.
Appeared in: 2081-Regular

Q11. [2×4 marks]

Write short notes on: (Any Two) a) Global state and state recording technique
Appeared in: 2081-Regular
(a) a) Global state and state recording technique

Q12. [2+6 marks]

b) What do you mean by logical clock? Explain Lamport's Logical clock.

Appeared in: 2066-Back
(a) b) What do you mean by logical clock? Explain Lamport's Logical clock.

Q13. [4+6 marks]

What are the principle applications of state recording and distributed debugging?
Determine the types of distributed CUT in the following figure.
Appeared in: 2066-Back

Q14. [2+6 marks]

Compare physical clocks and logical clocks with its implementation semantics.
Describe Lamport's timestamp algorithm with its benefits and drawbacks.
Appeared in: 2070-Back

Q15. [3+5 marks]

What are the common problems of physical clock synchronization algorithms? Write
Chandy-Lamport's algorithm for recording global states in Distributed System.
Appeared in: 2071-Back

Q16. [2+6 marks]

Why it is difficult to synchronize physical clock? Explain how clock synchronization can
be solved using logical clock.
Appeared in: 2072-Back

Q17. [4×3 marks]

Write short notes on: a) Christian's Algorithm

Appeared in: 2072-Back
(a) a) Christian's Algorithm

Q18. [2+6 marks]

Why clock synchronization is necessary? Explain the clock synchronization algorithm

using vector clock along with an example.
Appeared in: 2074-Back

Q19. [4+4 marks]

List the problems of Lamports clock with example. How vector clock is beneficial than
Lamports clock? Explain with implementation rules of vector clock.
Appeared in: 2075-Back

Q20. [2+4 marks]

What is Network Time Protocol (NTP)? How Berkeley minimizes the problems of
single time server failures of Chistian's algorithm.
Appeared in: 2075-Back

Q21. [3+3 marks]

Write short notes on: (any two) i) Lamport's clock

Appeared in: 2075-Back
(a) i) Lamport's clock

(b) ii) TIB/Rendezvous

(c) iii) Feedback suppression mechanism in M-cast communication

Q22. [8 marks]

Explain Lamport's logical clock with its pros and cons.

Appeared in: 2076-Back

Q23. [[2+4+2] marks]

What is physical and logical clock? Explain the importance of VECTOR clock with its
implementation rules and example.
Appeared in: 2080-Back
Q24. [2+8 marks]

What is the difference between physical and logical clock? Discuss the principles of
Lamport's clock with algorithm.
Appeared in: 2081-Back
Chapter 6 - Coordination and Agreement

Questions: 23

Q1. [2+4 marks]

Present a practical scenario where you need an election algorithm. Explain an election
algorithm with example that is suitable to your scenario.
Appeared in: 2069-Regular

Q2. [2+6 marks]

How does mutual exclusion help in co-ordination in distributed system? Explain the
way how Lamport algorithm ensures mutual exclusion?
Appeared in: 2070-Regular

Q3. [[8] marks]

Write the importance of election algorithm. Explain BULLY algorithm with suitable
example. Compare it with Ring based algorithm.
Appeared in: 2071-Regular

Q4. [[10] marks]

Explain with algorithmic steps, how token ring algorithm works for mutual exclusion in
distributed system.
Appeared in: 2071-Regular

Q5. [2+8 marks]

What are the basic requirements for mutual exclusion in distributed system? Explain
the non-token based distributed mutual exclusion algorithm and compare it with token
based algorithm.
Appeared in: 2072-Regular

Q6. [5+5 marks]

How does a new coordinator elect in executing central coordinator algorithm? How to
come to consensus in DS? Explain.
Appeared in: 2076-Regular

Q7. [4+5 marks]

Compare and contrast token based mutual exclusion algorithm and non-token based
mutual exclusion algorithm. Explain the various state of Ricart Agrawala token based
mutual exclusion.
Appeared in: 2078-Regular

Q8. [3+4 marks]

Discuss how Consensus can be achieved in Distributed System. Explain the check
pointing approach for distributed recovery.
Appeared in: 2078-Regular

Q9. [4+6 marks]

Explain with example how can you achieve consensus in distributed system. Explain
ricart-agrawala token based algorithm.
Appeared in: 2079-Regular

Q10. [3 marks]

Coordinator election process in central coordinator algorithm

Appeared in: 2079-Regular

Q11. [2+6 marks]

Define mutual exclusion in distributed system. Explain the steps to elect coordinator in
process resilience system.
Appeared in: 2080-Regular

Q12. [2+2+4 marks]

What are the fundamental requirements of Mutual Exclusion in DS? Why is election
applicable in DS? Explain the functional steps of anyone election algorithm.
Appeared in: 2081-Regular

Q13. [2+6 marks]

Define distributed coordination in DS? Explain how token ring algorithm works for
mutual exclusion in DS.
Appeared in: 2066-Back

Q14. [3X3 marks]

Explain any 3 of the following a) Use of multicast communication in Distributed

systems b) External sort is related with MR programming model in Hadoop c)
Compression can improve the performance of MapReduce job d) P2P style of
architecture of Cassandra (just discuss to show the p2p style not the entire
architecture)
Appeared in: 2067-Regular/Back
(a) a) Use of multicast communication in Distributed systems

(b) b) External sort is related with MR programming model in Hadoop

(c) c) Compression can improve the performance of MapReduce job

(d) d) P2P style of architecture of Cassandra (just discuss to show the p2p style not
the entire architecture)
Q15. [5+3 marks]

Explain any one election technique in Distributed System. Discuss with steps how
consensus can be achieved in Distributed System.
Appeared in: 2070-Back

Q16. [2+6 marks]

Measure the performance issue of non-token based Ricart-Agrawal Algorithm. Write

alternate algorithm to address those performance issues.
Appeared in: 2071-Back

Q17. [3+5 marks]

How to come to consensus in DS? Discuss with an approach, how do you make the
distributed system service highly available?
Appeared in: 2071-Back

Q18. [8 marks]

Describe non-token based centralized and Ricart Agrawala algorithm with example
and compare them.
Appeared in: 2074-Back

Q19. [2+6 marks]

How token system works for mutual exclusion in Distributed System. Explain with
token based Algorithm.
Appeared in: 2075-Back

Q20. [2+6 marks]

What is the need of an election algorithm? Explain non token based Ricart-Agrawala
mutual exclusion algorithm along with an example.
Appeared in: 2075-Back

Q21. [8 marks]

Explain reliable multicast with its properties and an algorithm.

Appeared in: 2076-Back

Q22. [8 marks]

Specify Data Centric consistency models and explain any one of them in detail.
Appeared in: 2076-Back

Q23. [[2+2+6] marks]

Compare non token and token based mutual exclusion. Why election is important in
DS? Explain the Ring Based election algorithm with rules and example.
Appeared in: 2080-Back
Chapter 7 - Replication

Questions: 16

Q1. [2+4 marks] (Repeated 2 times)

Compare passive replication with active replication approach. Also discuss with a
technique that make the distributed system service highly available.
Appeared in: 2069-Regular, 2075-Back

Q2. [3+5 marks]

What are the major objectives for replication in distributed system? Explain primary
backup model for fault tolerance.
Appeared in: 2070-Regular

Q3. [3+5 marks]

What are the reasons for Replication? Explain active replication model with its
advantages and disadvantages.
Appeared in: 2072-Regular

Q4. [2+4+2 marks]

What is fault? How to implement primary-backup replica system? How is it differ from
active replication?
Appeared in: 2076-Regular

Q5. [2+4+2 marks]

Mention the requirements and challenges of replication. Explain active replication

model in fault tolerance. How it is differ than passive model?
Appeared in: 2078-Regular

Q6. [3+4+2 marks]

List the challenges of replication in DS. Explain how passive replication model
supports in fault tolerance. How it is differ than active replication model?
Appeared in: 2079-Regular

Q7. [2+3+3 marks]

What is the requirement for replications? Compare passive and active replication
architectures with necessary figures and steps.
Appeared in: 2080-Regular

Q8. [3+5 marks]

What are the benefits and drawbacks of Replication in DS? How do Gossip
Architecture avoid issues of active and passive replication? Explain.
Appeared in: 2081-Regular

Q9. [6+2 marks]

Define replication and fault tolerance in DS and explain why are they necessary?
Explain how replication enhanced scalability for DS.
Appeared in: 2066-Back

Q10. [2+4 marks]

How do you say that replication is one of the scaling techniques in Distributed
System? How to handle concurrent invocations with object replication in distributed
object based system?
Appeared in: 2070-Back

Q11. [4+4 marks]

What are the reasons for replicating the service provide? Discuss about fault tolerant
services.
Appeared in: 2072-Back

Q12. [3+5 marks]

Differentiate between active and passive replication. Explain working mechanism of

active replication.
Appeared in: 2074-Back

Q13. [2+6 marks]

How replication is used as a basic scaling technique in distributed system? Explain the
active replication model with its advantages and disadvantages.
Appeared in: 2075-Back

Q14. [[5+5] marks]

What are the different consistency models applicable in a distributed system? How
does a primary-backup model work?
Appeared in: 2080-Back

Q15. [10 marks]

How do you elect replica manager in primary backup replication? Explain.

Appeared in: 2081-Back

Q16. [2×5 marks]

Write short notes on: (Any Two) a) Distributed Deadlock and its avoidance
approaches b) Center coordinator algorithm and its issues c) Active replication
technique in DS
Appeared in: 2081-Back
(a) a) Distributed Deadlock and its avoidance approaches

(b) b) Center coordinator algorithm and its issues

(c) c) Active replication technique in DS

Chapter 8 - Transaction and Concurrency Control

Questions: 25

Q1. [2+5 marks]

What do you mean by Distributed Deadlock? Explain the two-phase commit protocol
of handling distributed transaction.
Appeared in: 2069-Regular

Q2. [3+4 marks]

What are the flat and nested transactions? Describe the methods for concurrency
control in distributed system.
Appeared in: 2069-Regular

Q3. [3+3 marks]

Write short notes on: b) Timestamp ordering in concurrency control

Appeared in: 2070-Regular
(a) Timestamp ordering in concurrency control

Q4. [[1+4+3] marks]

Define lock in concurrency control. How can concurrency be controlled in distributed

transactions? What situation does lead to distributed deadlock?
Appeared in: 2071-Regular

Q5. [[3×4] marks]

Write short notes on: c) Flat versus nested locks

Appeared in: 2071-Regular
(a) a) Heterogeneity in distributed system

(b) b) Rendezvous concept and implementation

(c) c) Flat versus nested locks

(d) d) Process Resilience

Q6. [2+4+2 marks]

What do you mean by nested transactions? Explain optimistic concurrency control

method with its advantages over other concurrency control methods.
Appeared in: 2072-Regular

Q7. [4+4 marks]

What are the alternative approaches to avoid possibility of deadlock in distributed
system? Explain.
Appeared in: 2076-Regular

Q8. [3×3 marks]

Write short notes on: (Any Three) a. Three Phase Commit. d. Two Phase commit
protocol
Appeared in: 2076-Regular
(a) Three Phase Commit

(b) Two Phase commit protocol

Q9. [2+6 marks]

What are the Flat and Nested Transactions? Explain how the problems of 2PC
protocols are solved by 3PC.
Appeared in: 2078-Regular

Q10. [6+4 marks]

Explain snapshot algorithm used for backward recovery in distributed system. Explain
three phase commit protocol with state diagram.
Appeared in: 2079-Regular

Q11. [4+4 marks]

What are the solutions to avoid deadlock in distributed system? Explain three phase
commit protocol on handling distributed transactions.
Appeared in: 2080-Regular

Q12. [2×4 marks]

Write short notes on: (Any Two) b) Backward recovery Technique in DS

Appeared in: 2080-Regular
(a) b) Backward recovery Technique in DS

Q13. [3+5 marks]

What are the benefits and drawbacks of using locks in distributed transaction
processing? Explain the timestamp-based ordering technique for concurrency control
in DS.
Appeared in: 2081-Regular

Q14. [4+6 marks]

What is LOCK and DEADLOCK in DS? Discuss the methods of distributed deadlock
avoidance.
 Appeared in: 2066-Back

Q15. [2+6 marks]

What are the roles of atomic commitment protocol (ACP) in distributed transactions?
Explain the different methods of concurrency control in distributed transactions.
Appeared in: 2070-Back

Q16. [4+8 marks]

What are the relationships between parent and child transactions in DS? Write the
problems of locking with the solutions to avoid it.
Appeared in: 2071-Back

Q17. [4+4+4 marks]

Write short notes on (Any Three) [c] Two Phase Distributed Commit
Appeared in: 2071-Back
(a) Two Phase Distributed Commit

Q18. [4+6 marks] (Repeated 2 times)

Define flat and nested transaction. Discuss the approach of optimistic concurrency
control in distributed transactions.
Appeared in: 2072-Back, 2079-Regular

Q19. [8 marks]

How cascading aborts occurs and can be solved? Explain the needs and roles of
atomic commit protocol in distributed system.
Appeared in: 2072-Back

Q20. [8 marks]

How cascading aborts occurs and solved? Explain three phase commit protocol with
state diagram.
Appeared in: 2074-Back

Q21. [2+6 marks] (Repeated 2 times)

Compare nested transactions and distributed transactions. Explain the two-phase

commit protocol of handling distributed transactions.
Appeared in: 2075-Back, 2081-Regular

Q22. [2+6 marks]

Write down the rule of two-version locking. Explain how Optimistic concurrency control
mechanism works?
 Appeared in: 2075-Back

Q23. [8 marks]

Why is it necessary to maintain transaction? What is a deadlock and what are

phantom deadlocks.
Appeared in: 2076-Back

Q24. [[2+6] marks]

Briefly explain different methods for concurrency control. What are the drawbacks of
2PL and how does strict 2PL overcomes those?
Appeared in: 2080-Back

Q25. [2+8 marks]

What do you mean by Distributed Commit? What is the difference between two phase
and three phase commit protocol? Explain.
Appeared in: 2081-Back
Chapter 9 - Fault Tolerance

Questions: 20

Q1. [2+2+4 marks]

What do you mean by faults, failures and errors? How do you handle faults in
Distributed System? Explain process resilience approach in brief.
Appeared in: 2069-Regular

Q2. [1+2+5 marks]

What do you mean by fault tolerant system? What do you mean by Byzantine Failure?
Explain Byzantine Generals problem to illustrate how agreement can be reached in
faulty system.
Appeared in: 2070-Regular

Q3. [[8] marks]

Explain Byzantine general problem to handle faulty process with example. Describe
any one failure recovery technique.
Appeared in: 2071-Regular

Q4. [[3×4] marks]

Write short notes on: d) Process Resilience

Appeared in: 2071-Regular
(a) a) Heterogeneity in distributed system

(b) b) Rendezvous concept and implementation

(c) c) Flat versus nested locks

(d) d) Process Resilience

Q5. [2+6 marks]

What do you mean by forward and backward recovery? How to implement

coordinated check pointing for recovery in DS?
Appeared in: 2076-Regular

Q6. [4+4 marks]

Define faults, failures and errors. How to achieve agreement in faulty system over
reliable channel? Explain.
Appeared in: 2080-Regular

Q7. [3+5 marks]

Define fault, error and failure. How do you detect arbitrary faults and recover it?
Explain.
Appeared in: 2081-Regular

Q8. [2×4 marks]

Write short notes on: (Any Two) c) Backward recovery technique in DS

Appeared in: 2081-Regular
(a) c) Backward recovery technique in DS

Q9. [2+2+4 marks]

What are the dependability requirements of fault tolerant system? What do you mean
by K-fault tolerant? How to come agreement in faulty system? Explain with the
approach of byzantine generals problem.
Appeared in: 2070-Back

Q10. [4+4 marks]

Write short notes on: a) Process and threads in OS b) Distributed commit

Appeared in: 2070-Back
(a) Process and threads in OS

(b) Distributed commit

Q11. [4+4 marks]

How do you avoid faults in DS? Compare independent chekpointing with coordinated
checkpointing approach.
Appeared in: 2071-Back

Q12. [4×3 marks]

Write short notes on: b) Recovery approach in Distributed System

Appeared in: 2072-Back
(a) b) Recovery approach in Distributed System

Q13. [2+6 marks]

What is K-fault tolerant system? Explain fault recovery techniques.

Appeared in: 2074-Back

Q14. [2x4 marks]

Write short notes on: (Any two) a) Distributed deadlock and recovery b) MACH c)
Process Resilience
Appeared in: 2074-Back
 (a) a) Distributed deadlock and recovery

(b) b) MACH

(c) c) Process Resilience

Q15. [3+5 marks]

What do you learn from Byzantine generals problem? Explain the basic principle of
K-fault tolerant.
Appeared in: 2075-Back

Q16. [4+4 marks]

Write short notes on: (Any two) a) Reliable Group Communication b) Distributed
deadlock c) Forward and Backward recovery in distributed system
Appeared in: 2075-Back
(a) a) Reliable Group Communication

(b) b) Distributed deadlock

(c) c) Forward and Backward recovery in distributed system

Q17. [4+4 marks]

How does triple modular redundancy works? Explain how reliable client server
communication can be achieved in distributed system.
Appeared in: 2075-Back

Q18. [8 marks]

What is fault tolerance? Explain different type of faults that may occur in a distributed
system.
Appeared in: 2076-Back

Q19. [[3+5] marks]

Define faults, error and failures. How reliable client server communication can be
achieved in DS?
Appeared in: 2080-Back

Q20. [2+8 marks]

What is byzantine problem? Explain the backward recovery approaches in DS.

Appeared in: 2081-Back
Chapter 10 - Case Studies

Questions: 8

Q1. [3 marks]

MACH
Appeared in: 2079-Regular

Q2. [8 marks]

Define the components that make up a basic MapReduce job and illustrate with
diagram how does the data flow through Hadoop MapReduce.
Appeared in: 2068-Back

Q3. [10 marks]

Define referential transparency with example. Explain mapreduce program execution

flow.
Appeared in: 2068-Regular/Back

Q4. [10 marks]

a. Write pseudo code for inverted index (term vector per host) generation through
mapreduce. b. Discuss fault tolerance of mapreduce jobs.
Appeared in: 2068-Regular/Back
(a) a. Write pseudo code for inverted index (term vector per host) generation
through mapreduce.

(b) b. Discuss fault tolerance of mapreduce jobs.

Q5. [4+4+4 marks]

Write short notes on (Any Three) [d] Distributed Debugging.

Appeared in: 2071-Back
(a) Distributed Debugging

Q6. [4+4+4 marks]

Write short notes on (Any Three) [e] RPC communication semantics

Appeared in: 2071-Back
(a) RPC communication semantics

Q7. [3+3 marks]

Write short notes on: (any two) ii) TIB/Rendezvous

Appeared in: 2075-Back
 (a) i) Lamport's clock

(b) ii) TIB/Rendezvous

(c) iii) Feedback suppression mechanism in M-cast communication

Q8. [[3×4] marks]

Write short notes on: (Any Three) a) MACH b) Strongly Consistent CUT in DS c)
Multithreading in DS c) CORBA services
Appeared in: 2080-Back
(a) a) MACH

(b) b) Strongly Consistent CUT in DS

(c) c) Multithreading in DS

(d) c) CORBA services

Processing Summary

Sets Processed: 22/22

Total Pages Analyzed: 22