DEPARTMENT OF COMPUTER ENGINEERING
Academic Year 2024-2025
Teaching Scheme C-scheme (R19)
Class - Semester BE – VIII
Course Distributed Computing Lab
Course code CSL801
Faculty Name Prof. Jagruti Gujare
LAB COURSE OUTCOME
BT
Sr. No. CO Code Course Outcome Statements
L
1 CO.1 Develop test and debug using Message-Oriented Communication
L6
or RPC/RMI based client-server programs.
2 CO.2 Implement techniques for clock synchronization. L3
3 CO.3 Implement techniques for Election Algorithms. L3
4 CO.4
Demonstrate mutual exclusion algorithms and deadlock handling. L3
5 CO.5
Implement techniques of resource and process management. L3
Describe the concepts of distributed File Systems with some case
6 CO.6 studies. Describe the concepts of distributed File Systems with L2
some case studies.
COURSE I/C SIGN
DEPARTMENT OF COMPUTER ENGINEERING
Academic Year 2024-2025
Teaching Scheme C-scheme (R19)
Class - Semester BE – VIII
Course Distributed Computing Lab
Course code CSL801
Faculty Name Prof. Jagruti Gujare
PRACTICAL INDEX
SR.
TITLE CO
NO
1 Inter-process communication CO1
2 Client/Server using RPC/RMI CO1
3 Group Communication CO1
4 Clock Synchronization algorithms CO2
5 Election Algorithm. CO3
6 Mutual Exclusion Algorithm CO4
7 Deadlock Management in Distributed System CO4
8 Load Balancing CO5
9 Distributed shared Memory CO5
10 Distributed File System (AFS/CODA) CO6
11 Case Study: CORBA CO6
12 Case Study: Android Stack CO6
COURSE I/C SIGN
DEPARTMENT OF COMPUTER ENGINEERING
Academic Year 2024-2025
Teaching Scheme C-scheme (R19)
Class - Semester BE – VIII
Course Distributed Computing Lab
Course code CSL801
Faculty Name Prof. Jagruti Gujare
CO-PO MAPPING
CO/PO PO.1 PO.2 PO.3 PO.4 PO.5 PO.6 PO.7 PO.8 PO.9 PO.10 PO.11 PO.12
3 2 2 2 3 1 1 1 2 2 2 3
CO.1
3 3 2 2 3 1 1 1 2 2 2 3
CO.2
3 3 2 2 3 1 1 1 2 2 2 3
CO.3
3 3 3 3 3 1 1 1 2 2 2 3
CO.4
3 3 3 3 3 2 2 1 2 2 3 3
CO.5
3 3 2 3 3 2 2 1 2 3 3 3
CO.6
CO 18 17 14 15 18 8 8 6 12 13 14 18
TOTAL
Avg.
Correlat 3 2.83 2.33 2.5 3 1.33 1.33 1 2 2.16 2.33 3
ion
Level
1 = Slightly, 2 = Moderately, 3 = Substantially
COURSE I/C SIGN
DEPARTMENT OF COMPUTER ENGINEERING
Academic Year 2024-2025
Teaching Scheme C-scheme (R19)
Class - Semester BE – VIII
Course Distributed Computing Lab
Course code CSL801
Faculty Name Prof. Jagruti Gujare
CO- PSO MAPPING MATRIX
CO/PSO PSO1 PSO2 PSO3
CO.1 3 2 2
CO.2 3 3 2
CO.3 2 3 2
CO.4 3 2 2
CO.5 3 2 2
CO.6 3 2 2
CO TOTAL 17 14 12
Avg. Correlation Level 2.83 2.33 2
1 = Slightly, 2 = Moderately, 3 = Substantially
COURSE I/C SIGN
DEPARTMENT OF COMPUTER ENGINEERING
Academic Year 2024-2025
Teaching Scheme C-scheme (R19)
Class - Semester BE – VIII
Course Distributed Computing Lab
Course code CSL801
Faculty Name Prof. Jagruti Gujare
CO- PEO MAPPING MATRIX
CO/PEO PEO1 PEO2 PEO3 PEO4 PEO5
CO.1 3 3 2 2 1
CO.2 3 3 2 3 1
CO.3 3 3 2 3 1
CO.4 3 3 2 3 2
CO.5 3 3 2 3 1
CO.6 3 3 3 3 2
CO TOTAL 18 18 13 17 8
Avg. Correlation
3 3 2.16 2.83 1.33
Level
1 = Slightly, 2 = Moderately, 3 = Substantially
COURSE I/C SIGN
Course Information Sheet (CIS)
AY 2024-25
Course Name: Distributed Computing Lab
Class: B.E
Semester: VIII
Faculty Name: Prof. Jagruti Gujare
Lectures per week: 03
Abstract:
Distributed Computing Lab explores fundamental concepts and practical implementations of
distributed systems, focusing on efficient communication, synchronization, and resource management
across multiple computing nodes. The lab covers inter-process communication, client-server interactions
using RPC/RMI, and group communication mechanisms. Key algorithms, such as clock synchronization,
election, and mutual exclusion, are studied to ensure system coordination. Deadlock management and load
balancing techniques are implemented to enhance performance. Advanced topics like distributed shared
memory, distributed file systems (AFS/CODA), and middleware frameworks such as CORBA are analyzed.
Additionally, a case study on the Android Stack provides insights into real-world distributed computing
applications.
Course Outcomes (CO):
Course
Module After successful completion of the course students should be able to
Outcome
Develop test and debug using Message - Oriented
CO1 MODULE 1 Communication or RPC/RMI based client-server programs.
CO2 MODULE 2 Implement techniques for clock synchronization.
CO3 MODULE 3
Implement techniques for Election Algorithms.
CO4 MODULE 4 Demonstrate mutual exclusion algorithms and deadlock handling.
CO5 MODULE 5 Implement techniques of resource and process management.
Describe the concepts of distributed File Systems with some case
CO6 MODULE 6 studies.
Mapping of CO’s to PO’s
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 2 3 1 1 1 2 2 2 3
CO2 3 3 2 2 3 1 1 1 2 2 2 3
CO3 3 3 2 2 3 1 1 1 2 2 2 3
CO4 3 3 3 3 3 1 1 1 2 2 2 3
CO5 3 3 3 3 3 2 2 1 2 2 3 3
CO6 3 3 2 3 3 2 2 1 2 3 3 3
Average 3 2.83 2.33 2.5 3 1.33 1.33 1 2 2.16 2.33 3
Correlation levels factor for relevance of POs to CO's:
High – 3 Medium- 2 Low- 1
Justification
Course Program Levels Justification
Outcomes Outcomes
Requires knowledge of programming, distributed systems,
PO1 3
and communication principles.
Involves problem analysis for designing and debugging
PO2 2
client-server models.
Helps in designing distributed applications considering
PO3 2
reliability and efficiency.
Requires investigation of issues in message passing and
PO4 2
RPC/RMI communication.
Uses modern tools and frameworks for distributed
PO5 3
programming.
Understanding client-server communication in real-world
CO1 PO6 1
applications and societal needs.
Awareness of the impact of distributed systems on
PO7 1
sustainability and energy efficiency.
Encourages ethical implementation of client-server
PO8 1
models in distributed environments.
Involves working in teams to develop and debug
PO9 2
distributed applications.
Requires effective communication of system design,
PO10 2
debugging reports, and documentation.
Involves project management for developing and testing
PO11 2
distributed applications.
Encourages continuous learning of evolving
PO12 3
communication technologies in distributed systems.
Requires applying mathematical and engineering knowledge
PO1 3
to synchronization problems.
Involves analyzing time synchronization issues in distributed
PO2 3
systems.
PO3 2 Helps design solutions for accurate clock synchronization.
Requires investigation of different synchronization
CO2 PO4 2
algorithms and techniques.
Uses modern tools for clock synchronization in distributed
PO5 3
networks.
Understanding synchronization's impact on safety-critical and
PO6 1
distributed applications.
Awareness of energy-efficient synchronization techniques in
PO7 1
distributed computing.
Ethical considerations for maintaining system integrity
PO8 1
through synchronization.
Requires collaborative effort to test and validate
PO9 2
synchronization mechanisms.
Involves documentation and reporting of synchronization
PO10 2
challenges and solutions.
Includes project planning to implement and test
PO11 2
synchronization protocols.
Requires continuous learning to keep up with evolving
PO12 3
synchronization techniques.
Requires understanding of algorithms and mathematical
PO1 3
models for election processes.
Involves analyzing different election algorithms and their
PO2 3
efficiency.
Helps design and implement election mechanisms in
PO3 2
CO3 distributed systems.
Requires research and evaluation of existing election
PO4 2
algorithms.
Uses modern tools and frameworks for simulating election
PO5 3
algorithms.
Understanding the role of leader election in distributed
PO6 1
applications for societal impact.
Awareness of energy-efficient leader election protocols in
PO7 1
distributed computing.
Ethical considerations in fair and reliable leader election
PO8 1
mechanisms.
Requires teamwork to analyze, implement, and evaluate
PO9 2
election algorithms.
Involves effective documentation and presentation of election
PO10 2
algorithm results.
Requires project management to implement, test, and
PO11 2
optimize election algorithms.
Encourages lifelong learning to keep up with advancements
PO12 3
in distributed computing.
Requires deep knowledge of mutual exclusion and deadlock
PO1 3
prevention techniques.
Involves analyzing deadlock conditions and their resolution
PO2 3
strategies.
CO4
Helps design algorithms for mutual exclusion and deadlock
PO3 3
management.
Requires research and experimentation to analyze and
PO4 3
validate deadlock handling methods.
Uses modern tools to simulate and test deadlock prevention
PO5 3
and mutual exclusion techniques.
Understanding the importance of deadlock prevention in
PO6 1
critical applications.
Awareness of deadlock-free system design for resource
PO7 1
optimization.
PO8 1 Ethical considerations in fair resource allocation policies.
Requires teamwork to analyze and test mutual exclusion
PO9 2
algorithms.
Involves effective documentation and reporting of deadlock
PO10 2
prevention strategies.
Requires planning and resource allocation to implement
PO11 2
deadlock handling techniques.
Encourages continuous learning to improve deadlock and
PO12 3
resource management.
Requires knowledge of process and resource management
PO1 3
techniques in distributed systems.
Involves analyzing process scheduling, resource allocation,
PO2 3
and management challenges.
Helps design resource management strategies for distributed
PO3 3
environments.
Requires research on effective load balancing and process
CO5 PO4 3
migration techniques.
Uses modern tools for simulating and optimizing resource
PO5 3
allocation.
Understanding process management's impact on real-world
PO6 2
distributed applications.
Awareness of sustainable computing practices in resource
PO7 2
management.
Ethical considerations in fair and efficient resource
PO8 1
management policies.
Requires teamwork to implement and optimize process
PO9 2
management techniques.
Involves documentation and reporting of resource
PO10 2
management methodologies.
Requires project planning for effective resource management
PO11 3
implementation.
Encourages lifelong learning to adapt to evolving distributed
PO12 3
computing trends.
Requires knowledge of distributed file systems and their
PO1 3
architectures.
Involves analyzing different distributed file system models
PO2 3
and their performance.
Helps in designing solutions for efficient data sharing in
PO3 2
distributed environments.
CO6
Requires research on existing distributed file systems and
PO4 3
their applications.
Uses modern tools to analyze and simulate distributed file
PO5 3
system performance.
Understanding the role of distributed storage in various
PO6 2
industries.
Awareness of energy-efficient and sustainable data storage
PO7 2
solutions.
Ethical considerations in secure and fair data storage
PO8 1
practices.
Requires teamwork to analyze, implement, and optimize
PO9 2
distributed file systems.
Involves effective communication of research findings on
PO10 3
distributed file systems.
Requires project planning and management for distributed
PO11 3
file system analysis.
Encourages lifelong learning to stay updated with
PO12 3
advancements in file system technologies.
COs – PSOs Matrices
CO PSO1 PSO2 PSO 3
CO1 3 2 2
CO2 3 3 2
CO3 2 3 2
CO4 3 2 2
CO5 3 2 2
CO6 3 2 2
Average 2.83 2.33 2.00
Course Program Levels Justification
Outcomes Specific
Outcomes
Substantially related, as mathematical models and problem-
PSO1 3
solving are core components.
CO1 Substantially related, requires strong software development
PSO2 2
skills for client-server communication.
Moderately related, focuses on understanding concepts but
PSO3 2
with less hands-on implementation.
Substantially related, requires mathematical concepts for
PSO1 3
clock synchronization.
Moderately related, involves software development but less
CO2 PSO2 3
intensive compared to others.
Moderately related, practical applications are involved but
PSO3 2
focus is on theoretical understanding.
Substantially related, election algorithms are based on strong
PSO1 2
mathematical principles.
CO3 Substantially related, requires software development skills
PSO2 3
for implementing election algorithms.
Moderately related, real-world applications are important, but
PSO3 2
emphasis is on theoretical concepts.
Substantially related, mutual exclusion and deadlock
PSO1 3
handling involve algorithmic and mathematical approaches.
CO4
Substantially related, involves software development and
PSO2 2
system implementation.
Moderately related, more focused on theory and conceptual
PSO3 2
understanding.
Moderately related, involves basic mathematical concepts for
PSO1 3
resource management techniques.
Substantially related, requires software design and
CO5 PSO2 2
implementation skills for managing resources and processes.
Substantially related, involves practical implementation and
PSO3 2
real-world applications.
Moderately related, requires understanding mathematical
PSO1 3
foundations for distributed file systems.
Substantially related, development skills are necessary for
CO6 PSO2 2
distributed file system implementation.
Substantially related, case studies and project
PSO3 2
implementations provide practical experience.
Sub In charges