DOC/LP/01/28.02.02
/ LESSON PLAN / LP-CP9260LP Rev. No: 00
Date:07.09.12
Page 1 of 6
Sub Code & Sub Name : CP9260 OPERATING SYSTEM DESIGN
Unit: I Branch: M.E(Computer Communication) Semester : I
Unit syllabus:
OPERATING SYSTEMS OVERVIEW
Operating system – Types of Computer Systems - Computer-system operation – I/O structure - Hardware
Protection - System components – System calls – System programs – System structure - Process concept – Process scheduling – Operations on processes – Cooperating processes – Inter process communication – Communication in client-server systems - Multithreading models – Threading issues – Pthreads.
Objective:
Students are given an overview of different types of operating systems, operation of the computer system, system calls, processes and threads.
SessionNo / Topics to be covered / Time / Ref / Teaching Method
1 / Operating system- Types of Computer Systems-Mainframe systems, Desktop Systems, Multiprocessor Systems / 50 m / 1(1-14) / BB
2 / Distributed Systems, Clustered Systems, Real-Time Systems, Handheld Systems / 50m / 1(14-20) / BB
3 / Computer-system operation, I/O structure / 50 m / 1(27-34) / BB
4 / Hardware Protection / 50 m / 1(42-48) / BB
5 / System components / 50 m / 1(55-61) / BB
6 / System calls / 50 m / 1(63-72) / BB
7 / System programs, System structure / 50 m / 1(72-79) / BB
8 / Process concept, Process scheduling / 50 m / 1(95-103) / BB
9 / Operations on processes, Cooperating processes / 50 m / 1(103-109) / BB
10 / Inter process communication / 50 m / 1(109-117) / BB
11 / Communication in client-server systems / 50 m / 1(117-126) / BB
12 / Multithreading models ,Threading issues, Pthreads / 50 m / 1(129-140) / BB
/ LESSON PLAN / LP-CP9260
LP Rev. No: 00
Date:07.09.12
Page 2 of 6
Sub Code & Sub Name : CP9260 OPERATING SYSTEM DESIGN
Unit: II Branch: M.E(Computer & Communication) Semester : I
Unit syllabus:
PROCESS MANAGEMENT
Scheduling criteria – Scheduling algorithms – Multiple-processor scheduling – Real time scheduling– Algorithm Evaluation – Process Scheduling Models - The critical-section problem–Synchronization hardware –Semaphores –Classic problems of synchronization–critical regions– Monitors - System model – Deadlock characterization -Methods for handling deadlocks–Recovery from deadlock.
Objective:
Students acquire knowledge about the scheduling algorithms, critical section problem, synchronization & Dead Locks.
SessionNo / Topics to be covered / Time / Ref / Teaching Method
14,15 / Scheduling criteria, Scheduling algorithms-FCFS, SJF, Priority, RR, Multilevel Queue Scheduling, Multilevel Feedback Queue Scheduling / 100m / 1(151-169) / BB
16,17 / Multiple-processor scheduling, Real time scheduling, Algorithm Evaluation- Deterministic Modeling, Queuing Models, Simulations, Implementation, Process Scheduling Models-Solaris 2,Windows 2000,Linux / 100m / 1(169-184) / BB
18 / The critical-section problem / 50 m / 1(189-197) / BB
19 / Synchronization hardware, Semaphores-Usage, Implementation, Deadlocks & Starvation, Binary Semaphores / 50 m / 1(197-206) / BB
20 / Classic problems of synchronization- Bounded-Buffer Problem, Readers-Writers Problem, Dining-Philosophers Problem / 50 m / 1(206-211) / BB
21 / Critical Regions, Monitors / 50 m / 1(211-222) / BB
22 / System model, Deadlock characterization –Necessary Conditions, Resource Allocation Graph, Methods for handling deadlocks / 50 m / 1(243-250) / BB
23,24 / Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, Recovery from deadlock. / 100m / 1(250-265) / BB
25 / CAT-I
/ LESSON PLAN / LP - CP9260
LP Rev. No: 00
Date: 07.09.12
Page 3 of 6
Sub Code & Sub Name : CP9260 OPERATING SYSTEM DESIGN
Unit: III Branch: M.E(Computer & Communication) Semester : I
Unit syllabus
STORAGE MANAGEMENT
Memory Management – Swapping – Contiguous memory allocation – Paging – Segmentation – Segmentation with paging. Virtual Memory: Background – Demand paging – Process creation – Page replacement – Allocation of frames – Thrashing.
Objective:
The main objective of this unit is to impart knowledge of memory management, Paging, Segmentation, Virtual memory and Page replacement algorithms.
SessionNo / Topics to be covered / Time / Ref / Teaching Method
26 / Memory Management, Swapping ,Contiguous memory allocation / 50 m / 1(273-287) / BB
27 / Paging-Basic Method, Hardware support, Protection, Structure of Page Table / 50 m / 1(287-303) / BB
28 / Segmentation- Basic Method, Hardware support, Protection, Segmentation with paging / 50 m / 1(303-312) / BB
29 / Virtual Memory: Background, Demand paging / 50 m / 1(317-328) / BB
30,31 / Process creation , Page replacement – FIFO, Optimal, LRU, LRU Approximation, Counting-Based, Page-Buffering Algorithm / 100 m / 1(328-344) / BB
32 / Allocation of frames , Thrashing-Cause, Working-set Model, Page-fault frequency / 50 m / 1(344-353) / BB
/ LESSON PLAN / LP -CP9260
LP Rev. No: 00
Date: 07.09.12
Page 4 of 6
Sub Code & Sub Name : CP9260 OPERATING SYSTEM DESIGN
Unit: IV Branch: M.E(Computer & Communication) Semester : I
Unit syllabus:
I/O SYSTEMS
File concept – Access methods – Directory structure – File-system mounting – Protection - Directory implementation – Allocation methods – Free-space management - Disk scheduling – Disk management – Swap-space management.
Objective:
Students will gain knowledge on File concepts, Directory Implementation and Disk scheduling.
SessionNo / Topics to be covered / Time / Ref / Teaching Method
33 / File concept - Attributes, Operations, Types, Structure, Internal File Structure / 50 m / 1(371-379) / BB
34 / Access methods - Sequential ,direct, other access methods / 50 m / 1(379-383) / BB
35 / Directory structure –Single-level, Two-level, Tree-Structured, Acyclic Graph, General Graph / 50 m / 1(383-393) / BB
36 / File-system mounting , Protection- Types of Access, Access Control, other Protection approaches / 50 m / 1(393-395, 402-406) / BB
37 / Directory implementation- Linear List, Hash Table, Allocation methods- Contiguous Allocation, Linked Allocation, Indexed Allocation / 50 m / 1(420-421, 421-430) / BB
38 / Free-space management- Bit vector, Linked list, grouping, Counting, Disk scheduling-FCFS, SSTf, SCAN,C-SCAN,LOOK / 50 m / 1(430-433, 492-497) / BB
39 / Disk management- formatting, boot block, bad block, Swap-space management-swap-space use, swap-space location / 50 m / 1(498-504) / BB
40 / CAT-II
/ LESSON PLAN / LP - CP9260
LP Rev. No: 00
Date: 07.09.12
Page 5 of 6
Sub Code & Sub Name : CP9260 OPERATING SYSTEM DESIGN
Unit: V Branch: M.E(Computer & Communication) Semester : I
Unit syllabus:
CASE STUDY
The Linux System -History – Design Principles – Kernel Modules – Process Management – Scheduling – Memory management – File systems – Input and Output – Inter-process Communication – Network Structure – Security – Windows 2000 - History– Design Principles – System Components – Environmental subsystems – File system –Networking.
Objective:
Students will gain knowledge on Linux OS and Windows 2000.
SessionNo / Topics to be covered / Time / Ref / Teaching Method41 / The Linux System –History, Design Principles, Kernel Modules / 50 m / 1(695-707) / BB
42 / Process Management, Scheduling / 50 m / 1(707-716) / BB
43 / Memory management / 50 m / 1(716-723) / BB
44 / File systems, Input and Output / 50 m / 1(724-734) / BB
45 / Network Structure ,Security / 50 m / 1(734-739) / BB
46,47 / Windows 2000- History, Design Principles, System Components / 100 m / 1(743-763) / BB
48 / Environmental subsystems, File system / 50 m / 1(763-774) / BB
49 / Networking / 50 m / 1(774-779) / BB
50 / CAT-III
/ LESSON PLAN / LP -CP9260
LP Rev. No: 00
Date: 07.09.12
Page 6 of 6
Sub Code & Sub Name : CP9260 OPERATING SYSTEM DESIGN
Unit: I -V Branch: M.E(Computer & Communication) Semester : I
Course Delivery Plan:
Week / 1 / 2 / 3 / 4 / 5 / 6 / 7 / 8 / 9 / 10 / 11 / 12 / 13I II / I II / I II / I II / I II / I II / I II / I II / I II / I II / I II / I II / I II
Units / / 1 / / 2 / / 3 / / 4 / / 5 /
CAT I CATII CAT III
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.Harvey M. Deitel, "Operating Systems", Second Edition, Pearson Education Pvt. Ltd, 2002.
2. Andrew S. Tanenbaum, "Modern Operating Systems", Prentice Hall of India Pvt. Ltd, 2003.
3. William Stallings, "Operating System", Prentice Hall of India, 4th Edition, 2003.
4. Gary Nutt, “Operating Systems”, Second Edition, Addison Wesley, 2001.
Prepared by / Approved bySignature
Name / U.Pooranima / Prof.E.G.Govindan
Designation / Assistant Professor/ IT / HOD/IT
Date / 07.09.12 / 07.09.12