DMI ENGNIEERING COLLEGE

Kumarapuram Road, Aralvaimozhi – 629 301

Department of Computer Science

and Engineering

COURSE PLAN
(Regulation 2021)

Subject CS8603 Distributed Systems

Code&Name

Programme B.E.

Year &Semester III&VI

Nature of Course / Theory Credits : 3

Credit

Name of the Mrs.A.Anorelin

faculty
 1. COURSE DESCRIPTION:

Subject Name : Distributed Systems L T P C

3 0 0 3
Programme Category
B.E. Sem: IV Theory
: :
Prerequisit
e
 A fundamental shift in how you think about computing: from serial programs
to loosely coupled asynchronous distributed systems.
 Design and implement moderately complex distributed systems of your own
 Understand classic distributed algorithms for synchronization, consistency,
Aim: fault-tolerance, etc.
 Reason about correctness of distributed algorithms, and derive your your own
algorithms for special cases
 Understand how modern distributed systems are designed and engineered

Course Objectives:
1 To understand the foundations of distributed systems.
2 To learn issues related to clock Synchronization and the need for global state in distributed systems
3 To learn distributed mutual exclusion and deadlock detection algorithms
To understand the significance of agreement, fault tolerance and recovery protocols in Distributed
4
Systems
To learn the characteristics of peer-to-peer and distributed shared memory systems
5

2. SYLLABUS
UNIT I INTRODUCTION

Introduction: Definition –Relation to computer system components –Motivation –

Relation to parallel systems – 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 –
Cuts –Past and future cones of an event –Models of process communications. Logical
Time: A framework for a system of logical clocks –Scalar time –Vector time – Physical
clock synchronization: NTP.

UNIT II MESSAGE ORDERING & SNAPSHOTS

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.
Global state and snapshot recording algorithms: Introduction –System model and
definitions –Snapshot algorithms for FIFO channels
UNIT III 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 – Algorithms for the
single resource model, the AND model and the OR model.

UNIT IV RECOVERY & CONSENSUS

Check-pointing and rollback recovery: Introduction – Background and definitions –
Issues in failure recovery – Checkpoint-based recovery – Log-based rollback recovery –
Coordinated check-pointing algorithm

– Algorithm for asynchronous check-pointing and recovery. Consensus and agreement

algorithms: Problem definition – Overview of results – Agreement in a failure – free system –
Agreement in synchronous systems with failures.

UNIT V P2P & DISTRIBUTED SHARED MEMORY

Peer-to-peer computing and overlay graphs: Introduction – Data indexing and overlays
– Chord – Content addressable networks – Tapestry. Distributed shared memory:
Abstraction and advantages – Memory consistency models –Shared memory Mutual
Exclusion.

Total: 45Periods

TEXT BOOK:

T1.Kshemkalyani, Ajay D., and Mukesh Singhal. Distributed computing: principles, algorithms,
and systems. Cambridge University Press, 2011

T2. George Coulouris, Jean Dollimore and Tim Kindberg, ―Distributed Systems Concepts and
Design‖, Fifth Edition, Pearson Education, 2012

REFERENCES:

R1. Pradeep K Sinha, “Distributed Operating Systems: Concepts and Design”, Prentice Hall of
India, 2007.

R2. Mukesh Singhal and Niranjan G. Shivaratri. Advanced concepts in operating systems.
McGraw-Hill, Inc., 1994.

R3.Tanenbaum A.S., Van Steen M., ―Distributed Systems: Principles and Paradigms‖, Pearson
Education, 2007

R4. Liu M.L., ―Distributed Computing, Principles and Applications‖, Pearson Education, 2004.

R5. Nancy A Lynch, ―Distributed Algorithms‖, Morgan Kaufman Publishers, USA, 2003
 3. Course Outcome (COs): (should follow Bloom’s taxonomy)

Course Outcomes: After successful completion of the course, the students should be able to

COs CO Statements POs

Elucidate the foundations and issues of
CO1: PO1: Apply the knowledge of mathematics,
distributed systems
Understand the various science, engineering fundamentals, and an
CO2: synchronization issues and global engineering specialization to the solution of
state for distributed systems. complex engineering problems.
Understand the Mutual Exclusion PO2: Identify, formulate, review research
CO3: and Deadlock detection algorithms literature, and analyze complex engineering
in distributed systems problems reaching substantiated conclusions
Describe the agreement protocols using first principles of mathematics, natural
CO4: and fault tolerance mechanisms in
sciences, and engineering sciences.
distributed systems.
PO3: Design solutions for complex engineering
Describe the features of peer
problems and design system components or
processes that meet the specified needs with
appropriate consideration for the public health
and safety, and the cultural, societal, and
environmental considerations.
CO5:
PO4: Use research-based knowledge and
research methods including design of
experiments, analysis and interpretation of data
and synthesis of the information to provide valid
conclusion.

4. Text Books & Reference Books

S. Text / Title of the Book Author/Publisher/Year/ Web link

No. Reference Edition
book
Kshemkalyani, Ajay D., and
Distributed computing: https://eclass.uoa.gr/
Mukesh SinghalCambridge
1 Text principles, algorithms, and modules/document/file.php/
University Press, 2011
systems. D245/2015/DistrComp.pdf

George Coulouris, Jean http://bedford

Dollimore and Tim computing.co.uk/learning/wp-
Distributed Systems content/uploads/2016/03/geor
2 Text Kindberg,Fifth Edition,
Concepts and Design‖ ge-coulouris-distributed-
Pearson Education, 2012 systems-concepts-and-design-
5th-edition.pdf

Distributed Operating
Pradeep K Sinha, Prentice https://www.ebooks.com/en-
3 Reference Systems: Concepts and
Hall of India, 2007 in/book
Design

4 Reference Mukesh Singhal and https://www.worldcat.org/

Advanced concepts in
Niranjan G. Shivaratri.. title/1145771813
 operating systems McGraw-Hill, Inc., 1994

https://vowi.fsinf.at/
_Tannenbaum-
Distributed Systems: Tanenbaum A.S., Van Steen
5 Reference distributed_systems_principle
Principles and Paradigms M.,Pearson Education, 2007
s_and_paradigms_2nd_editio
n.pdf

https://www.worldcat.org/
Distributed Computing, Liu M.L‖, Pearson title/Distributed-computing-:-
6 Reference
Principles and Applications Education, 2004 principles-and-applications/
oclc/679461380

Nancy A Lynch, Morgan https://lib.fbtuit.uz/assets/

Kaufman Publishers, USA, files/
7 Reference Distributed Algorithms‖
2003. 5.NancyA.Lynch.Distributed
Algorithms.pdf

5. Web Resources: (other than NPTEL, SWAYAM and other e

learning resources)

S.No. Topic Web link

1 Basics of distributed https://www.geeksforgeeks.org/what-is-a-distributed-system

System

Geo distributed fog https://hellofuture.orange.com/en/fog-computing-and-geo-

3
computing distributed-cloud

6. E – learning videos/NPTEL/ SWAYAM and other resources

(IMPORTANT!)

1 Advanced distributed https://onlinecourses.nptel.ac.in/noc23_cs72/preview

Systems
2 Distributed Systems https://onlinecourses.nptel.ac.in/noc23_cs68/preview
7. Lesson Plan

Mode of Text/
Hours Page
S.no Unit Topic to be covered teaching Ref.
need no
(BB/PPT/Others) book
UNIT I INTRODUCTION

1. Definition –Relation 1 1-4

1 to computer system Blackboard T1
components
2. Motivation –Relation to 1 13-21
Blackboard T1
2 parallel
3. Message-passing 1
3 systems versus shared
memory systems 24-37
Blackboard T1
–Primitives for
distributed
communication
4. Synchronous versus 1
4 asynchronous 37-48
executions – Design Blackboard T1
issues and
I
challenges.
5. A distributed 1
5 program ,A model of 48-58
distributed
Blackboard T1
executions,Models of
communication
networks
6. Global state – Cuts –Past 1
6 and future cones of an
Blackboard T1 58-67
event – Models of
process communications
7. A framework for a 1 68-77
7 system of logical Blackboard T1
clocks
8. 1 78-84
Scalar time –Vector time Blackboard T1
8
9. Physical clock 1
Blackboard T1
synchronization: NTP. 97-105
UNIT II MESSAGE ORDERING & SNAPSHOTS
1. II T1
Message ordering 1 Blackboard 121-
paradigms 127
2. Asynchronous execution 1 Blackboard T1 128-
with synchronous 135
communication
3. Synchronous program T1 136-
order on an asynchronous 1 Blackboard 142
system
4. T1 143-
Group communication 1 Blackboard
152
5. T1
1 Blackboard 153-
Causal order (CO)
160
6. Global state and snapshot T1
recording algorithms: 1 Blackboard 171-
Introduction 180
7. System model and T1 182-
1 Blackboard
definitions 187
8. T1 188-
Total order 2 Blackboard
195
9. Snapshot algorithms for 196-
FIFO channels 199
UNIT III DISTRIBUTED MUTEX & DEADLOCK
1. Distributed mutual 205-
1 exclusion algorithms: 1 Blackboard T1 209
Introduction
2. Preliminaries – Lamport‘s 300-
2 algorithm 1 Blackboard T1 302
3. Ricart-Agrawala algorithm 303-
1 Blackboard T1
3 305
4. Maekawa‘s algorithm – 306-
4 Suzuki– Kasami‘s 1 Blackboard T1 308
III broadcast algorithm.
5. Deadlock detection in 309-
1 Blackboard T1
5 distributed 315
6. System model – 316-
1 Blackboard T1
6 Preliminaries 319
7. Models of deadlocks – 320-
1 Blackboard T1
7 Knapp‘s classification 328
8. Algorithms for the single 329-
8 1 Blackboard T1
resource model 335
9. the AND model and the OR 355-
9 1 Blackboard T1
model 365

UNIT IV RECOVERY & CONSENSUS

1. IV Checkpointing and rollback 366-
1 Blackboard T1
19 recovery: Introduction 371
2. Background and definitions 371-
1 Blackboard T1
20 – Issues in failure recovery 375
3. Checkpoint-based recovery 376-
21 – Log- based rollback 1 Blackboard T1 384
recovery
4. Coordinated checkpointing 385-
1 Blackboard T1
22 algorithm 387
5. Algorithm for 1 PPT T1 387-
asynchronous 388
 23 checkpointing and
recovery.
6. Consensus and agreement
24 algorithms: Problem 1 PPT T1 388-
definition 391
7. Overview of results 392-
1 PPT T1
25 396
8. Agreement in a failure 396-
1 PPT T1
26 398
9. free system – Agreement in 398-
synchronous systems 1 PPT T1 399
with failures.
UNIT V P2P & DISTRIBUTED SHARED MEMORY
1. Peer-to-peer computing and 402-
1 Blackboard T1
40 overlay graphs:Introduction 410
2. Data indexing and overlays 415-
1 Blackboard T1
41 418
3. V Content addressable 419-
1 Blackboard T1
42 networks 425
4. Tapestry. 426-
1 Blackboard T1
43 430
5. 432-
Distributed shared memory 1 Blackboard T1
44 435
6. 452-
Abstraction and advantages 1 Blackboard T1
45 460
7. Memory consistency 461-
1 Blackboard T1
models 465
8. Shared memory Mutual 465-
1 Blackboard T1
Exclusion 472
9. 473-
Chord 1 Blackboard T1
477
*Beyond the syllabus topics to be included
 8. Class Time Table
BREA
PERIOD I II BREAK III IV V VI K
VII VIII

12.30-1.00
9.00 – 9.50 – 10.40- 10.50- 2.30-
DAY/TIME 11.40-12.30 1.00- 1.45 1.45-2.30 2.40-3.25 3.25-4.10
9.50 10.40 10.50 11.40 2.40

CS8651 CS8691 CS8601 CS8603 CS8691 CS 8661 IP Lab

MONDAY IP AI MC DS AI

CS8601 CS8651 CS8602 CS8603 CS8662-MAD LAB

MiniProject
TUESDAY MC IP CD L DS
U
CS8602 CS8691 CS8651 Placement N CS8601 CS8602 Compiler Lab
WEDNESDA C BREA
CD AI IP Training MC CD
Y H K
BREAK
B
HS8581
R
CS8603 CS8601 mini Professional E CS8602 CS8651 BREA CS8601 Apptitude
THURSDAY DS MC project Communicatio A CD IP K MC training
n K

CS8691 CS8651 CS8602 CS8691 CS8603 CS8611 Mini Project

FRIDAY AI IP CD AI DS

9. Course Time Table

PERIOD I II BREAK III IV V VI BREAK VII VIII

12.30-1.00

9.00 – 9.50 – 10.40- 10.50-

DAY/TIME 11.40-12.30 1.00- 1.45 1.45-2.30 2.30-2.40 2.40-3.25 3.25-4.10
9.50 10.40 10.50 11.40

CS8603
MONDAY DS

L CS8603
TUESDAY U DS
N
C
WEDNESDA H
BREAK BREAK
Y B
R
CS8603
E
THURSDAY DS A
K
CS8603
FRIDAY DS
 10.Content Delivery Methodologies (Chalk and Board, Powerpoint
presentations, Videos, E-content etc.)

 Chalk and Board,

 Power point presentations
11.Assignments

Assignmen Description Submission due

t No.

1 Resource Sharing Model(2-marks) 15-03-23

2 Message Ordering (2-marks) 31-03-233

3 Deadlock in Distributed System. 15-04-23

4 29-04-23

5 14-05-23

12. Assignment Rubrics:

Quality Marks
Submission on Date 3
Understanding 2
Solving skill/ Presentation 2
End results with correct units conversions / 3
Conclusion

13.Mapping of CO to Assignment:

CO’s CO - STATEMENTS A1 A2 A3 A4 A5

Elucidate the foundations and issues of distributed systems √ √

CO1:

Understand the various synchronization issues and global state √

CO2:
for distributed systems.
Understand the Mutual Exclusion and Deadlock detection
CO3: algorithms in distributed systems √

Describe the agreement protocols and fault tolerance √

CO4:
mechanisms in distributed systems.
Describe the features of peer √ √
CO5:
 Elucidate the foundations and issues of distributed systems √
CO6:

14.Assessment Methodologies:

Assessment Tool Description

Internal Test
(30%)
40
Direct
Assignments %
Assessme
(10%)
nt
(80%)
End semester 60
Examination %
Indirect Course End Survey
Assessme (80%)
nt
Exit Survey (20 %)
(20%)

15.Distribution of portions for assessment tests

Assessments Portion Covering Unit % of weightage

IAT – I Unit I & unit II (50%) 15
IAT – II Unit II (50%) & Unit III 15
Model Exam Unit I to V 25
Assignments Unit – I to Unit-V 15
Class Test Unit – I to Unit-V 15
Attendance 15
End Semester Unit - I to V 100

16.Content beyond syllabus

1.AWS
2.Data Centre

Prepared by:
Signature

Ms.M.Princy
Name : Mrs.A.Anorelin Dr.A.Albert Raj
Usha
 Designation: Prof. / CSE HoD / CSE Principal

Internal 1-Marks

SL.NO REG.NO NAME Marks

1 960620104001 S.Abinash 92
2 960620104002 L. Adhi Sugan 90
3 960620104003 J.Akshai Kumar AB
4 960620104004 S.Anand 90
5 960620104005 Anishma Arthi 90
6 960620104006 I.Anish Prakash 45
7 960620104007 J.Anto Jeffrin 90
8 960620104008 C.Antony Rishanth 85
9 960620104009 F.Ashish Valan 88
10 960620104010 L.Banupriya 92
11 960620104011 V.Karthick Rajan 90
12 960620104012 M. Krishnaveni 91
13 960620104013 85
J.Magiesh
14 960620104014 M.Maria Sneka 90

15 960620104016 85
A. Reena Devi
16 960620104017 G.Renisha 90
17 960620104018 S.Sahayaaswini 92
18 960620104019 R.Sahaya Raveena 88
19 960620104022 A.Soosai Antony Ruban 85
20 960620104023 Sweta Xavier 90
21 960620104024 85
T. M. Thanya
22 960620104301 90
Arjun
23 960620104302 Augustin 87
24 960620104303 Shelfia 90

Internal 2-Marks

SL.NO REG.NO NAME Marks

1 960620104001 S.Abinash 89
2 960620104002 L. Adhi Sugan 99
3 960620104003 J.Akshai Kumar AB
4 960620104004 S.Anand 93
5 960620104005 Anishma Arthi 93
6 960620104006 I.Anish Prakash 93
7 960620104007 J.Anto Jeffrin 93
8 960620104008 C.Antony Rishanth 93
9 960620104009 F.Ashish Valan 88
10 960620104010 L.Banupriya 86
11 960620104011 V.Karthick Rajan 87
12 960620104012 M. Krishnaveni 92
13 960620104013 86
J.Magiesh
14 960620104014 M.Maria Sneka 87

15 960620104016 89
A. Reena Devi
16 960620104017 G.Renisha 95
17 960620104018 S.Sahayaaswini 89
18 960620104019 R.Sahaya Raveena 90
19 960620104022 A.Soosai Antony Ruban 87
20 960620104023 Sweta Xavier 94
21 960620104024 97
T. M. Thanya
22 960620104301 93
Arjun
23 960620104302 Augustin 94
24 960620104303 Shelfia 38
Model Exam -Marks

SL.NO REG.NO NAME Marks

1 960620104001 S.Abinash 89
2 960620104002 L. Adhi Sugan 79
3 960620104003 J.Akshai Kumar 94
4 960620104004 S.Anand 93
5 960620104005 Anishma Arthi 93
6 960620104006 I.Anish Prakash 83
7 960620104007 J.Anto Jeffrin 93
8 960620104008 C.Antony Rishanth 93
9 960620104009 F.Ashish Valan 88
10 960620104010 L.Banupriya 86
11 960620104011 V.Karthick Rajan 87
12 960620104012 M. Krishnaveni 92
13 960620104013 86
J.Magiesh
14 960620104014 M.Maria Sneka 87

15 960620104016 89
A. Reena Devi
16 960620104017 G.Renisha 95
17 960620104018 S.Sahayaaswini 89
18 960620104019 R.Sahaya Raveena 90
19 960620104022 A.Soosai Antony Ruban 87
20 960620104023 Sweta Xavier 94
21 960620104024 97
T. M. Thanya
22 960620104301 93
Arjun
23 960620104302 Augustin 94
24 960620104303 Shelfia 92

University Result:

SL.NO REG.NO NAME Marks

1 960620104001 S.Abinash A
2 960620104002 L. Adhi Sugan B+
3 960620104003 J.Akshai Kumar U
4 960620104004 S.Anand B
5 960620104005 Anishma Arthi A
6 960620104006 I.Anish Prakash U
7 960620104007 J.Anto Jeffrin B+
8 960620104008 C.Antony Rishanth B
9 960620104009 F.Ashish Valan B
10 960620104010 L.Banupriya B
11 960620104011 V.Karthick Rajan B
12 960620104012 M. Krishnaveni A+
13 960620104013 B+
J.Magiesh
14 960620104014 M.Maria Sneka A+

15 960620104016 B
A. Reena Devi
16 960620104017 G.Renisha B+
17 960620104018 S.Sahayaaswini B+
18 960620104019 R.Sahaya Raveena B
19 960620104022 A.Soosai Antony Ruban B
20 960620104023 Sweta Xavier B+
21 960620104024 A
T. M. Thanya
22 960620104301 A
Arjun
23 960620104302 Augustin B+
24 960620104303 Shelfia B

17.Instructional Learning outcomes

(unitwise/assignments/tutorials / slip test)

Unit Assessment Procedure

I Internal Test, Quiz, Assignment
II Internal Test, Quiz, Assignment
III Internal Test, Quiz, Assignment
 IV Internal Test, Quiz, Assignment
V Internal Test, Quiz, Assignment

18.Program Outcomes (Pos) (12 attributes)

PO’s No KNOWLEDGE STATEMENTS

Apply the knowledge of mathematics, science,

Engineering engineering fundamentals, and an engineering
1
Knowledge: specialization to the solution of complex
engineering problems.

Identify, formulate, review research literature, and

analyze complex engineering problems reaching
Problem
2 substantiated conclusions using first principles of
Analysis:
mathematics, natural sciences, and engineering
sciences.

Design solutions for complex engineering

problems and design system components or
Design /
processes that meet the specified needs with
3 Development of
appropriate consideration for the public health
Solutions:
and safety, and the cultural, societal, and
environmental considerations.

Conduct Use research-based knowledge and research

Investigations of methods including design of experiments, analysis
4
Complex and interpretation of data, and synthesis of the
Problems: information to provide valid conclusions.

Create, select, and apply appropriate techniques,

resources, and modern engineering and IT tools
Modern Tool
5 including prediction and doling to complex
usage:
engineering activities with an understanding of
the limitations.

Apply reasoning informed by the contextual

knowledge to assess societal, health, safety, legal
The Engineer
6 and cultural issues and the consequent
and Society:
responsibilities relevant to the professional
engineering practice.

7 Understand the impact of the professional

Environment
 engineering solutions in societal and
and environmental contexts, and demonstrate the
Sustainability: knowledge of, and need for sustainable
development.

Apply ethical principles and commit to

8 Ethics: professional ethics and responsibilities and norms
of the engineering practice.

Function effectively as an individual, and as a

Individual and
9 member or leader in diverse teams, and in
Team Work:
multidisciplinary settings.

Communicate effectively on complex engineering

activities with the engineering community and
with society at large, such as, being able to
10 Communication: comprehend and write effective reports and
design documentation, make effective
presentations, and give and receive clear
instructions.

Demonstrate knowledge and understanding of the

Project engineering and management principles and
11 Management apply these to one’s own work, as a member and
and Finance: leader in a team, to manage projects and in
multidisciplinary environments.

Recognize the need for, and have the preparation

Life-long and ability to engage in independent and life-long
12
Learning: learning in the broadest context of technological
change.

19.Program Specific Outcomes (PSOs) (max.3)

Graduating student shall be able to:

PSO1 To analyze, design and develop computing solutions by

applying foundational concepts of Computer Science and
Engineering.

PSO2 To apply software engineering principles and practices for

developing quality software for scientific and business
applications.
 PSO3 To adapt to emerging Information and Communication
Technologies (ICT) to innovate ideas and solutions to
existing/novel problems.

20.CO and PO mapping (3 point scale)

COURSE OUTCOMES VS PROGRAM OUTCOMES MAPPING

Course Program Outcomes Program

Outcome Specific
s Outcomes
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO 1 2 1 - - - - - - - - - - 2 - -
CO 2 2 1 - - - - - - - - - - 3 - -
CO 3 3 2 1 1 - - - - - - - - 3 2 2
CO 4 3 2 1 1 - - - - - - - - 3 2 2
CO 5 3 2 - - - - - - - - - - 3 2 2
Weighted
3 2 1 1 - - - - - - - - 3 2 2
average
Enter correlation levels 1, 2 & 3 define as: 1-low, 2- medium, & 3-high

COURSE OUTCOME & PROGRAM OUTCOME JUSTIFICATION

Correlation
MAPPIN – Strong
JUSTIFICATION
G /Medium
/Low
Foundations and issues of distributed systems
CO1-PO1 3 .
CO1-PO2 1

CO1-PO3 2

CO1-PO4 2
Various synchronization issues and global state for distributed systems
CO2-PO1 2

CO2-PO2 2
CO2-PO3 3

CO2-PO4 1

CO2-PO5 1
Mutual Exclusion and Deadlock detection algorithms in distributed systems
CO3-PO1 1

CO3-PO2 3

CO3-PO3 2

CO3-PO4 2

CO3-PO5 1

CO4-PO1 1

CO4-PO2 3 Agreement protocols and fault tolerance mechanisms in distributed systems.

CO4-PO3 3

CO4-PO4 3

CO5-PO1 3

CO5-PO2 1

CO5-PO3 2 Describe the features of peer

CO5-PO4 1

CO5-PO5 1

21.Magazines & Journals (one or two)

(Web link to be provided)

International Journal of Communication Networks and Distributed
Systems-https://www.inderscience.com/jhome.php?jcode=ijcnds#:~:text=International
%20Journal%20of%20Communication%20Networks%20and%20Distributed
%20Systems,-This%20journal%20also&text=IJCNDS%20aims%20to%20improve
%20the,%2C%20techniques%2C%20algorithms%20and%20results.

22.Assignment Rubrics:

Quality Marks
Submission on Date 2
Understanding 3
Solving skill/ Presentation 3
End results with correct units conversions / 2
Conclusion