0% found this document useful (0 votes)
329 views2 pages

Lesson Plan

This lesson plan outlines a course on distributed systems for a computer science program. It includes 5 units that will be taught over 8 weeks. Unit 1 covers introduction and concepts of distributed systems. Unit 2 focuses on distributed shared memory and file systems. Unit 3 discusses inter-process communication, synchronization, and client-server models. Unit 4 is about distributed scheduling and dealing with deadlocks. Finally, Unit 5 examines distributed multimedia, databases, and case studies of distributed systems like Amoeba and Mach. The course aims to teach students the core principles and issues in designing distributed systems through lectures, assignments, exams and practical lab sessions.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
329 views2 pages

Lesson Plan

This lesson plan outlines a course on distributed systems for a computer science program. It includes 5 units that will be taught over 8 weeks. Unit 1 covers introduction and concepts of distributed systems. Unit 2 focuses on distributed shared memory and file systems. Unit 3 discusses inter-process communication, synchronization, and client-server models. Unit 4 is about distributed scheduling and dealing with deadlocks. Finally, Unit 5 examines distributed multimedia, databases, and case studies of distributed systems like Amoeba and Mach. The course aims to teach students the core principles and issues in designing distributed systems through lectures, assignments, exams and practical lab sessions.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
You are on page 1/ 2

LESSON PLAN

COLLEGE NAME : MAHAKAL INSTITUTE OF TECHNOLOGY ,UJJAIN


DEPARTMENT : COMPUTER SCIENCE AND ENGINEERING
FACULTY NAME : PROF. JAGRATI NAGDIYA
CLASS : B.Tech IV YEAR VII SEMESTER BRANCH: CS-A

L T P CREDITS
SUBJECT DISTRIBUTED SYSTEM (CS-7001)
3 _ 2 4

THEORY PRACTICAL
END MID QUIZ/ ASSIGNMENT END SEM TERM WORK
SCHEME OF SEM SEM
CBGS
EXAM: LAB WORK /SESSIONAL
70 20 10 30
20

PROPOSED ACTUAL
LECT. RBT CO INSTRUCTIONAL
UNIT NO. TOPIC DATE OF DATE OF REMARKS
NO. LEVEL MAPPING METHOD
CONDUCTION CONDUCTION

1/1 Introduction to distributed systems L1 CO1

2/2 Architecture for Distributed System L5 CO1

3/3 Goals of Distributed system L1 CO1

4/4 Hardware concepts L1 CO1

5/5 Software concepts L1 CO1


I

6/6 Distributed Computing Model L3 CO1

7/7 Advantages & Disadvantage distributed system L5 CO1

8/8 Issues in designing Distributed System L5 CO1

No. of Lectures required to complete UNIT-I: No. of Lectures taken:

1/9 Distributed Share Memory And Distributed File System L1 CO1

2/10 Basic Concept of Distributed Share Memory (DSM) L1 CO1

DSM Architecture & its Types,Design & Implementations issues In DSM


3/11 L5 CO2
System

Structure of Share Memory Space, Consistency


4/12 L5 CO2
II Model, and Thrashing

5/13 Desirable features of good Distributed File System, File Model L2 CO2

FileService Architecture, File Accessing Model, File Sharing Semantics, File


6/14 L5 CO2
Catching Scheme

File Application & Fault tolerance. Naming: - Features, System Oriented


7/15 L3 CO2
Names

8/16 Object Locating Mechanism, Human Oriented Name. L3 CO2

No. of Lectures required to complete UNIT-II: No. of Lectures taken:

1/17 Inter Process Communication And Synchronization L4 CO3

2/18 API for Internet Protocol L4 CO3

3/19 Data Representation & Marshaling L4 CO3

4/20 Group Communication L5 CO3

5/21 Client Server Communication L5 CO3


III
RPC- Implementing RPC Mechanism,Stub Generation,
6/22 L5 CO3
RPC Messages

7/23 Election Algorithms:- Bully & Ring Algorithms. L3 CO3

No. of Lectures required to complete UNIT-III: No. of Lectures taken:

1/24 Distributed Scheduling And Deadlock L3 CO4

2/25 Distributed Scheduling-Issues in Load Distributing, L3 CO4

3/26 Components for Load Distributing Algorithms L3 CO4


4/27 Different Types of Load Distributing Algorithms L3 CO4

5/28 Task Migration and its issues L2 CO4


IV

6/29 Deadlock-Issues in deadlock detection & Resolutions L4 CO4

7/30 Deadlock Handling Strategy L4 CO4

Distributed
8/31 L3 CO4
Deadlock Algorithms,

No. of Lectures required to complete UNIT-IV: No. of Lectures taken:

1/32 Distributed Multimedia & Database system L2 CO5

2/33 Distributed Data Base Management System(DDBMS) L2 CO5

3/34 Types of Distributed Database L2 CO5

4/35 Distributed Multimedia L3 CO5

5/36 Characteristics of multimedia Data, L3 CO5

6/37 Quality of Service Managements L2 CO5


V

7/38 Case Study of Distributed System:- Amoeba L5 CO5

8/39 Mach L5 CO5

9/40 Chorus L5 CO5

No. of Lectures required to complete UNIT-V: No. of Lectures taken:

Faculty HOD Dean Director


CSE Department CSE Department MIT,Ujjain MIT,Ujjain

You might also like