RAJALAKSHMI ENGINEERING COLLEGE LESSON PLAN

Faculty Name
RAJALAKSHMI ENGINEERING COLLEGE
C.JOE ANT SAPHIA
LESSON PLAN
R.ANTO AROCKIA ROSALINE
Faculty Code
Subject Name OPERATING SYSTEMS Subject code
AIM:
Class
II Year IT
Date of Compilation
IT 104
IT38
CS2254
24/11/10
To have a thorough knowledge of processes, scheduling concepts, memory management,
I/O and file systems in an operating system.
OBJECTIVE:
• To have an overview of different types of operating systems
• To know the components of an operating system.
• To have a thorough knowledge of process management
• To have a thorough knowledge of storage management
• To know the concepts of I/O and file systems.

S.No Date Hour Topic Page No.
1
2
3
4
UNIT - I
Introduction to Operating Systems
Introduction to Operating Systems
Review of Computer Organization
Review of Computer Organization
5 Operating System Structures -System Calls –
System Programs
6
7
8
Virtual Machines
Process Concept – Process Scheduling
Operations on Processes
9 Cooperating Processes – Inter-process
Communication
10
Communication in Client Server Systems
T/3-19
T/3-19
T27-48
T27-48
T/63-72
T/72-74
T/80-84
T/95-103
T/103-107
T/107-109
T/109-117
T117-125
11 Case Study: IPC in LINUX T/732-734
12
13
14
Threads – Overview, Multi threading models
Issues, Case Study: Pthreads Library
UNIT – II
CPU Scheduling – Basic Concepts
15 Multiple-Processor Scheduling – Real Time
16
Scheduling
Algorithm Evaluation
T/129-135
T/135-140
T/151-155
T/169-170
T/170-171
T/172-176

17
Case Study: Process Scheduling in LINUX
18 The Critical-Section Problem – Synchronization
19
20
21
22
23
Hardware
Semaphores
Classic problems of Synchronization
Critical regions
Monitors
System Model - – Deadlock Characterization
24 Methods for handling Deadlocks -Deadlock
25
26
27
28
29
30
31
32
33
Prevention
Deadlock avoidance
Deadlock detection – Recovery from Deadlock
UNIT – III
Storage Management
Swapping – Contiguous Memory allocation
Paging
Segmentation
Segmentation with Paging
Virtual Memory – Background, Demand Paging
Process creation
T/711-715
T/191-197
T/197-200
T/201-206
T/206-211
T/211-216
T/216-222
T/243-245
T/245-248
T/248-250
T/250-253
T/253-260
T/260-264
T/273-280
T/280-283
T/283-287
T/287-303
T/303-309
T/309-312
T/317-319
T/320-328
T/328-330

34
35
Page Replacement
Allocation of frames
36 Thrashing , Case study: Memory Management in
37
38
39
40
LINUX
UNIT – IV
File Concept, Access Methods
Directory Structure
File System Mounting – Protection
File System Implementation, Directory
implementation ,Allocation methods
41 Free-space Management, Efficiency &
42
43
44
45
46
47
48
Performance
Recovery, Log-Structured File Systems
Case Study: File System in Linux & Windows Xp
UNIT – V
I/O Systems- I/O Hardware
Application I/O Interface
Kernel I/O Subsystems
Streams, Performance
Disk Structure – Disk Scheduling
T/330-344
T/344-348
T/348-353
T/716-723
T/371-379
T/379-383
T/383-393
T/402-406
T/413-429
T/430-436
T/437-440
T/724-728
T/823-830
T/455-465
T/466-471
T/472-478
T/481-482
T/483-485
T/491-492
T/492-498

49 Disk Management – Swap-Space Management
TEXT BOOK
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”,
Sixth Edition, John Wiley & Sons (ASIA) Pvt. Ltd, 2003.
REFERENCES
1. Andrew S. Tanenbaum, “Modern Operating Systems”, Prentice Hall of India Pvt. Ltd, 2003.
2. Gary Nutt, “Operating Systems”, Third Edition,Pearson Education,2004
T/498-502
T/502-504
50 RAID T/505-511
51
Disk Attachment, Stable Storage
T/512-515
52 Tertiary Storage T/516-524
53 Case Study: I/O in Linux System T/729-731
3. Harvey M. Deitel, “Operating Systems”, Second Edition, Pearson Education Pvt. Ltd, 2002.