DEPARTMENT OF ARTIFICIAL INTELLIGENCE AND DATA

SCIENCE

CS3551 - DISTRIBUTED COMPUTING

(Common to CSE, IT, CYBER SECURITY)

QUESTION BANK
R - 2021

Prepared by
Mrs. G. Deepalakshmi / AP Page 1
 III YEAR / V SEMESTER
REGULATION - 2021
CS3551 - DISTRIBUTED COMPUTING

Faculty In Charge Head of the Department

Mrs. G. Deepalakshmi, M.E., Dr. S. Sureshkumar M.E., Ph.D.,
Assistant Professor, Assistant Professor,
Dept. of. Artificial Intelligence and Dept. of. Artificial Intelligence and
Data Science Data Science

Prepared by
Mrs. G. Deepalakshmi / AP Page 2
 INSTITUTE VISION AND MISSION

VISION:

To become a globally recognized “Centre of Academic Excellence”

providing Quality Education to all students.

MISSION:

To provide Quality Education in the fields of Engineering,

Management, Information, Technology and other Engineering areas.

DEPARTMENT VISION AND MISSION

VISION:

The Vision is to achieve International recognition through research and

innovation supremacy in Artificial Intelligence.

MISSION:

M1: To impart the skills necessary through quality teaching and learning
process.
M2: To acquire innovation through hands-on training.
M3: To provide best research opportunities through well designed
curriculum.
M4: Our Mission is achieved through highest quality of teaching, learning,
research opportunities through well designed curriculum.

Prepared by
Mrs. G. Deepalakshmi / AP Page 3
 PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

PEOs Content
Utilize their proficiencies in the fundamental knowledge of basic sciences,

PEO1 mathematics, Artificial Intelligence, data science and statistics to build systems
that require management and analysis of large volumes of data.
Advance their technical skills to pursue pioneering research in the field of AI and

PEO2 Data Science and create disruptive and sustainable solutions for the welfare
of ecosystems.
Think logically, pursue lifelong learning and collaborate with an ethical attitude in a
PEO3
multidisciplinary team.

PEO4 Design and model AI based solutions to critical problem domains in the real world.

Exhibit innovative thoughts and creative ideas for effective contribution towards
PEO5
economy building.

PROGRAM OUTCOMES (POs)

POs Title Content

Apply the knowledge of mathematics, science,
Engineering engineering fundamentals, and an engineering specialization to
PO1
knowledge
the solution of complex engineering problems.
Identify, formulate, review research literature, and analyze
complex engineering problems reaching substantiated conclusions
PO2 Problem analysis
using first principles of mathematics, natural sciences, and
engineering sciences.
Design solutions for complex engineering problems and design
system components or processes that meet the specified needs
Design/developme
PO3
nt of solutions with appropriate consideration for the public health and safety,
and the cultural, societal, and environmental considerations.

Conduct Use research-based knowledge and research methods including

investigations of design of experiments, analysis and interpretation of data, and
PO4
complex
problems synthesis of the information to provide valid conclusions.

Prepared by
Mrs. G. Deepalakshmi / AP Page 4
 Create, select, and apply appropriate techniques, resources, and
modern engineering and IT tools including prediction and
Modern tool
PO5
usage modeling to complex engineering activities with an understand of
the limitations.
Apply reasoning informed by the contextual knowledge to assess
societal, health, safety, legal and cultural issues and the
The engineer and
PO6
society consequent responsibilities relevant to the professional
engineering practice.
Understand the impact of the professional engineering solutions in
Environment and societal and environmental contexts, and demonstrate the
PO7
sustainability
knowledge of, and need for sustainable development.
Apply ethical principles and commit to professional ethics and
PO8 Ethics
responsibilities and norms of the engineering practice.
Function effectively as an individual, and as a member or leader
Individual and
PO9
team work in diverse teams, and in multidisciplinary settings.
Communicate effectively on complex engineering activities with
the engineering community and with society at large, such as,

PO10 Communication being able to comprehend and write effective reports and design
documentation, make effective presentations, and give and receive
clear instructions.
Demonstrate knowledge and understand of the engineering and
Project management principles and apply these to one‘s own work, as a
PO11 management and
member and leader in a team, to manage projects and in
finance
multidisciplinary environments.
Recognize the need for, and have the preparation and ability to

PO12 Life-long learning engage in independent and life-long learning in the broadest
context of technological change.

Prepared by
Mrs. G. Deepalakshmi / AP Page 5
 PROGRAM SPECIFIC OUTCOMES (PSOs)

PSOs Content

Evolve AI based efficient domain specific processes for effective decision making in
PSO1
several domains such as business and governance domains.
Arrive at actionable Foresight, Insight, hindsight from data for solving business and
PSO2
engineering problems.
Create, select and apply the theoretical knowledge of AI and Data Analytics along
PSO3 with practical industrial tools and techniques to manage and solve wicked societal
problems.
Develop data analytics and data visualization skills, skills pertaining to
PSO4 knowledge acquisition, knowledge representation and knowledge engineering, and
hence be capable of coordinating complex projects.
Able to carry out fundamental research to cater the critical needs of the society
PSO5
through cutting edge technologies of AI.

Prepared by
Mrs. G. Deepalakshmi / AP Page 6
CS3551 DISTRIBUTED COMPUTING LTPC
3 0 0 3

UNIT I INTRODUCTION 8

Introduction: Definition-Relation to Computer System Components – Motivation –

Message -Passing Systems versus Shared Memory Systems – Primitives for Distributed
Communication – Synchronous versus Asynchronous Executions – Design Issues and
Challenges; A Model of Distributed Computations: A Distributed Program – A Model of
Distributed Executions – Models of Communication Networks – Global State of a Distributed
System.

UNIT II LOGICAL TIME AND GLOBAL STATE 10

Logical Time: Physical Clock Synchronization: NTP – A Framework for a System of

Logical Clocks – Scalar Time – Vector Time; Message Ordering and Group Communication:
Message Ordering Paradigms – Asynchronous Execution with Synchronous Communication
– Synchronous Program Order on Asynchronous System – Group Communication – Causal
Order – Total Order; Global State and Snapshot Recording Algorithms: Introduction –
System Model and Definitions – Snapshot Algorithms for FIFO Channels.

UNIT III DISTRIBUTED MUTEX AND DEADLOCK 10

Distributed Mutual exclusion Algorithms: Introduction – Preliminaries – Lamport’s

algorithm – Ricart- Agrawala’s Algorithm –– Token-Based Algorithms – Suzuki-Kasami’s
Broadcast Algorithm; Deadlock Detection in Distributed Systems: Introduction – System
Model – Preliminaries – Models of Deadlocks – Chandy-Misra-Haas Algorithm for the AND
model and OR Model.

UNIT IV CONSENSUS AND RECOVERY 10

Consensus and Agreement Algorithms: Problem Definition – Overview of Results –

Agreement in a Failure-Free System(Synchronous and Asynchronous) – Agreement in
Synchronous Systems with Failures; Checkpointing and Rollback Recovery: Introduction –
Background and Definitions – Issues in Failure Recovery – Checkpoint-based Recovery –
Coordinated Checkpointing Algorithm - - Algorithm for Asynchronous Checkpointing and
Recovery

UNIT V CLOUD COMPUTING 7

Definition of Cloud Computing – Characteristics of Cloud – Cloud Deployment

Models – Cloud Service Models – Driving Factors and Challenges of Cloud – Virtualization
– Load Balancing – Scalability and Elasticity – Replication – Monitoring – Cloud Services
and Platforms: Compute Services – Storage Services – Application Services

Total: 45 PERIODS

Prepared by
Mrs. G. Deepalakshmi / AP Page 7
 COURSE OUTCOMES

At the end of this course, the students will be able to:

CO1 Explain the foundations of distributed systems (K2)

CO2 Solve synchronization and state consistency problems (K3)

CO3 Use resource sharing techniques in distributed systems (K3)

Apply working model of consensus and reliability of distributed systems
CO4
(K3)
CO5 Explain the fundamentals of cloud computing (K2)

CO’s - PO’s & PSO’s MAPPING

PO’s PSO’s
CO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3

1 2 2 3 3 1 - - - 2 1 3 3 2 1 1

2 1 3 2 1 2 - - - 2 2 2 2 1 3 2

3 2 2 1 3 3 - - - 3 2 1 1 1 2 1

4 1 2 2 3 1 - - - 3 3 2 1 3 1 1

5 3 3 1 2 3 - - - 3 3 3 1 3 2 3

AVG 1.8 2.4 1.8 2.4 2 - - - 2.6 2.2 2.2 1.6 2 1.8 1.6

1 - Low, 2 - Medium, 3 - High, ‘-' - No Correlation

Prepared by
Mrs. G. Deepalakshmi / AP Page 8
TEXT BOOKS

1. Kshemkalyani Ajay D, Mukesh Singhal, “Distributed Computing: Principles,

Algorithms and Systems”, Cambridge Press, 2011.
2. Mukesh Singhal, Niranjan G Shivaratri, “Advanced Concepts in Operating systems”,
Mc-Graw Hill Publishers, 1994.

REFERENCE BOOKS

1. George Coulouris, Jean Dollimore, Time Kindberg, “Distributed Systems Concepts

and Design”, Fifth Edition, Pearson Education, 2012.
2. Pradeep L Sinha, “Distributed Operating Systems: Concepts and Design”, Prentice
Hall of India, 2007.
3. Tanenbaum A S, Van Steen M, “Distributed Systems: Principles and Paradigms”,
Pearson Education, 2007.
4. Liu M L, “Distributed Computing: Principles and Applications”, Pearson Education,
2004.
5. Nancy A Lynch, “Distributed Algorithms”, Morgan Kaufman Publishers, 2003.
6. Arshdeep Bagga, Vijay Madisetti, “ Cloud Computing: A Hands-On Approach”,
Universities Press, 2014.

Prepared by
Mrs. G. Deepalakshmi / AP Page 9
 UNIT I

INTRODUCTION

PART - A

Q. CO
Questions BT Level Complexity
No Mapping

1. Define a distributed system. CO1 Remember Low

What are the main components of a computer

2. CO1 Understand Low
system in a distributed environment?
Differentiate between message-passing and
3. CO1 Understand Medium
shared memory systems.
What is meant by synchronous and
4. CO1 Understand Low
asynchronous execution?
What are primitives for distributed
5. CO1 Understand Low
communication?
List any two design issues in distributed
6. CO1 Remember Low
computing.
What is the significance of the global state in a
7. CO1 Understand Medium
distributed system?

8. Define a distributed program. CO1 Remember Low

What are models of communication networks

9. CO1 Understand Medium
in distributed systems?
Why is motivation important in distributed
10. CO1 Understand Medium
computing?

Prepared by
Mrs. G. Deepalakshmi / AP Page 10
 PART - B
Q. CO
Questions BT Level Complexity
No Mapping
Explain in detail the model of distributed
computations, including a distributed program,
1. execution models, communication network CO1 Understand High
models, and the global state of a distributed
system.
Discuss the major design issues and challenges
2. in distributed computing with suitable CO1 Understand Medium
examples.
Compare and contrast message-passing
3. systems and shared memory systems with real- CO1 Evaluate Medium
time examples.
Explain the significance of synchronous and
4. asynchronous executions in distributed systems CO1 Understand Medium
and their impact on performance.
Describe the various primitives used for
5. distributed communication and explain their CO1 Understand Medium
role in system coordination.
How does the global state affect distributed
6. CO1 Understand Medium
system performance? Explain with examples.
Explain the role of a distributed program in
7. distributed computing. How does it differ from CO1 Understand High
centralized computing?
Discuss the different models of communication
8. networks and analyze their impact on CO1 Analyze High
distributed systems.
Explain the concept of message-passing in
9. distributed computing and compare its CO1 Understand Medium
advantages and disadvantages.
With examples, explain how motivation
10. influences the design of distributed systems CO1 Understand High
and their real-world applications.

Prepared by
Mrs. G. Deepalakshmi / AP Page 11
 UNIT II
LOGICAL TIME AND GLOBAL STATE

PART - A

Q. CO
Questions BT Level Complexity
No Mapping

1. Define logical time in distributed systems. CO2 Remember Low

What is the role of NTP (Network Time

2. CO2 Understand Low
Protocol) in physical clock synchronization?
Differentiate between scalar time and vector
3. CO2 Understand Low
time.
What is meant by message ordering in
4. CO2 Understand Low
distributed systems?

5. List the different message ordering paradigms. CO2 Remember Low

6. What is causal order in message passing? CO2 Understand Low

7. Define total order in group communication. CO2 Remember Low

What is the purpose of snapshot recording in

8. CO2 Understand Low
distributed systems?
Mention any two system models used for
9. CO2 Remember Low
global state recording.

10. What is FIFO in snapshot algorithms? CO2 Understand Medium

Prepared by
Mrs. G. Deepalakshmi / AP Page 12
 PART - B
Q. CO
Questions BT Level Complexity
No Mapping
Explain the concept of logical time and discuss
various logical clock synchronization
1. CO2 Understand Medium
mechanisms, including scalar time and vector
time.
Describe the Network Time Protocol (NTP)
2. and explain its role in physical clock CO2 Understand Medium
synchronization.
Compare and contrast different message
3. ordering paradigms in distributed systems with CO2 Evaluate High
real-time examples.
Explain how asynchronous execution with
4. synchronous communication works and discuss CO2 Understand Medium
its challenges.
Discuss synchronous program order in
5. asynchronous systems and its effect on CO2 Understand Medium
distributed system performance.
Explain the concept of group communication
6. and discuss causal order and total order in CO2 Understand Medium
distributed systems.
Describe snapshot recording algorithms in
7. distributed systems and analyze their CO2 Analyze High
significance in global state detection.
Explain the system model and definitions
8. related to snapshot recording in distributed CO1 Understand High
computing.
Describe FIFO-based snapshot recording
9. CO1 Understand High
algorithms with an example.
Discuss the importance of global state in
10. distributed computing and explain various CO1 Understand Medium
methods used to capture it.

Prepared by
Mrs. G. Deepalakshmi / AP Page 13
 UNIT III
DISTRIBUTED MUTEX AND DEADLOCK

PART - A

Q. CO
Questions BT Level Complexity
No Mapping

1. Define distributed mutual exclusion. CO3 Remember Low

What is the main idea behind Lamport’s mutual

2. CO3 Understand Low
exclusion algorithm?
Differentiate between token-based and non-
3. CO3 Understand Low
token-based mutual exclusion algorithms.
What is the significance of Ricart-Agrawala’s
4. CO3 Understand Low
algorithm in distributed mutual exclusion?
What role does a token play in Suzuki-
5. CO3 Understand Low
Kasami’s broadcast algorithm?
Define deadlock in the context of distributed
6. CO3 Remember Low
systems.
What are the two models of deadlocks in
7. CO3 Understand Low
distributed systems?
List the major steps in the Chandy-Misra-Haas
8. CO3 Remember Low
algorithm for deadlock detection.
What is the difference between the AND model
9. CO3 Understand Low
and the OR model of deadlocks?
Mention one advantage and one disadvantage
10. of using token-based mutual exclusion CO3 Remember Low
algorithms.

Prepared by
Mrs. G. Deepalakshmi / AP Page 14
 PART - B
Q. CO
Questions BT Level Complexity
No Mapping
Explain the concept of distributed mutual
1. exclusion and discuss its significance in CO3 Understand Low
distributed systems.
Describe Lamport’s mutual exclusion
2. algorithm with a detailed step-by-step CO3 Understand Low
explanation and example.
Compare and contrast Lamport’s algorithm and
3. Ricart-Agrawala’s algorithm in terms of CO3 Evaluate High
message complexity and efficiency.
Explain the working of token-based algorithms
4. in distributed mutual exclusion and discuss CO3 Understand Medium
their advantages.
Discuss Suzuki-Kasami’s broadcast algorithm
5. and analyze its efficiency in distributed mutual CO3 Understand High
exclusion.
Explain the different models of deadlocks in
6. distributed systems and discuss their CO3 Understand Low
characteristics.
Describe the Chandy-Misra-Haas algorithm for
detecting deadlocks in distributed systems.
7. CO3 Understand High
Compare its working for the AND model and
the OR model.
Discuss the system model for deadlock
8. detection and explain its importance in CO3 Understand Medium
distributed environments.
Compare deadlock detection and deadlock
9. prevention in distributed systems with real- CO3 Evaluate High
world examples.
How do different distributed mutual exclusion
10. algorithms handle message complexity? CO3 Understand High
Compare and analyze.

Prepared by
Mrs. G. Deepalakshmi / AP Page 15
 UNIT IV
CONSENSUS AND RECOVERY

PART - A

Q. CO
Questions BT Level Complexity
No Mapping
Define the consensus problem in distributed
1. CO4 Remember Low
computing.

2. What is agreement in distributed systems? CO4 Understand Low

What is the difference between synchronous

3. CO4 Understand Low
and asynchronous agreement?
What is the role of failure-free agreement in
4. CO4 Understand Low
distributed systems?
What are the major challenges in achieving
5. CO4 Understand Low
agreement in distributed systems?

6. Define check pointing in distributed systems. CO4 Remember Low

What is the difference between coordinated

7. check pointing and asynchronous check CO4 Understand Low
pointing?
What are the key issues in failure recovery in
8. CO4 Understand Low
distributed systems?
List the benefits of checkpoint-based
9. CO4 Remember Low
recovery in fault-tolerant systems.
What is the role of rollback recovery in
10. CO4 Understand Low
distributed fault tolerance?

Prepared by
Mrs. G. Deepalakshmi / AP Page 16
 PART - B
Q. CO
Questions BT Level Complexity
No Mapping
Explain the consensus problem in distributed
1. systems. Why is it challenging to achieve CO4 Understand Medium
consensus in asynchronous systems?
Discuss the synchronous and asynchronous
2. agreement algorithms in a failure-free CO4 Understand Medium
distributed system.
Explain the agreement problem in synchronous
3. systems with failures. How does failure impact CO4 Understand Medium
consensus?
Compare different consensus and agreement
4. CO4 Evaluate High
algorithms in distributed computing.
What is checkpointing? Explain its role in
5. CO4 Understand High
failure recovery with an example.
Discuss the issues in failure recovery and
6. explain how rollback recovery is performed in CO4 Understand High
distributed systems.
Explain the coordinated checkpointing
7. algorithm and its advantages in distributed CO4 Understand High
systems.
Describe an algorithm for asynchronous
8. checkpointing and recovery in distributed CO4 Understand Medium
computing.
Compare coordinated and uncoordinated
9. checkpointing. Which one is more efficient in a CO4 Evaluate High
distributed system?
Explain how checkpointing and rollback
recovery techniques ensure fault tolerance in
10. CO4 Understand Medium
distributed systems. Provide a real-world
application.

Prepared by
Mrs. G. Deepalakshmi / AP Page 17
 UNIT V
CLOUD COMPUTING

PART - A

Q. CO
Questions BT Level Complexity
No Mapping

1. Define cloud computing. CO5 Remember Low

List any two characteristics of cloud

2. CO5 Remember Low
computing.
What are the different cloud deployment
3. CO5 Understand Low
models?
Define IaaS, PaaS, and SaaS in cloud
4. CO5 Remember Low
computing.
Mention two driving factors for cloud
5. CO5 Remember Low
adoption.

6. What is virtualization in cloud computing? CO5 Understand Low

What is the role of load balancing in cloud

7. CO5 Understand Medium
environments?
Differentiate between scalability and
8. CO5 Understand Medium
elasticity in cloud computing.

9. What is replication in cloud storage? CO5 Understand Low

10. List any two cloud compute services. CO5 Remember Low

Prepared by
Mrs. G. Deepalakshmi / AP Page 18
 PART - B
Q. CO
Questions BT Level Complexity
No Mapping
Explain in detail cloud computing, its
1. CO5 Understand Medium
definition, and major characteristics.
Compare and contrast different cloud
2. deployment models (Public, Private, CO5 Evaluate High
Hybrid, and Community).
Discuss the cloud service models (IaaS,
3. CO5 Understand High
PaaS, SaaS) with real-world examples.
Explain the major driving factors and
4. CO5 Understand Medium
challenges of cloud computing.
Describe virtualization in cloud
5. computing. Discuss its types and CO5 Understand Medium
advantages.
Explain load balancing in cloud
6. computing. Discuss its role in improving CO5 Understand Medium
performance and fault tolerance.
Compare scalability and elasticity in cloud
7. CO5 Evaluate Medium
computing with suitable examples.
Discuss replication in cloud storage and its
8. significance in fault tolerance and high CO5 Understand High
availability.
Explain the need for monitoring in cloud
9. computing. Discuss various cloud CO5 Understand Medium
monitoring tools and techniques.
Discuss different cloud services and
platforms, including compute services,
10. CO5 Understand High
storage services, and application services
with examples.

Prepared by
Mrs. G. Deepalakshmi / AP Page 19
 THANK YOU
ALL THE BEST

Prepared by
Mrs. G. Deepalakshmi / AP Page 20