0% found this document useful (0 votes)
66 views1 page

Lesson Plan Branch-Mca 3 Semester Operating System

The document outlines a 40-class lesson plan covering the topic of operating systems. It includes modules on process management and scheduling, memory management, file systems, I/O systems, and Unix commands. Specific topics covered are the evolution of operating systems, process concepts, scheduling algorithms, mutual exclusion, memory allocation techniques like paging and segmentation, file system models, disk scheduling, and scripting tools like sed, awk, and grep.

Uploaded by

santhi saranya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
66 views1 page

Lesson Plan Branch-Mca 3 Semester Operating System

The document outlines a 40-class lesson plan covering the topic of operating systems. It includes modules on process management and scheduling, memory management, file systems, I/O systems, and Unix commands. Specific topics covered are the evolution of operating systems, process concepts, scheduling algorithms, mutual exclusion, memory allocation techniques like paging and segmentation, file system models, disk scheduling, and scripting tools like sed, awk, and grep.

Uploaded by

santhi saranya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

LESSON PLAN

BRANCH-MCA 3rd SEMESTER OPERATING SYSTEM

MODULE TOPIC TO BE COVERED NO OF


NO CLASSES
Evolution of Operating Systems: Types of operating 1
systems
Different views of the operating systems – Principles 2
of Design and Implementation.
The process concept – system programmer’s view of 3
processes – operating system’s views of processes
operating system services for process management. 4
Process scheduling – Schedulers 5
Scheduling Algorithms. 6
Scheduling Algorithms. 7
Structural overview, Concept of process and Process 8
synchronization,
Process Management and Scheduling, 9
Hardware requirements: protection, context switching, 10
privileged mode;
Threads and their Management; Tools and Constructs 11
for Concurrency,
Detection and Prevention of deadlocks, 12
Mutual Exclusion: Algorithms, 13
Mutual Exclusion 14
Mutual Exclusion 15
semaphores 16
concurrent programming using semaphores. 17
Solving concurrent problem using semaphores. 18
Memory Management paging, 19
memory management, 20
Contiguous allocation – static partitioned memory 21
allocation
dynamic partitioned memory allocation 22
segmentation. Non-contiguous allocation 23
paging – Hardware support – Virtual Memory, 24
Dynamic Resource Allocation.
File Systems: A Simple file system 25
General model of a file system 26
Symbolic file system – Access control verification 27
Logical file system – Physical file system 28
allocation strategy module – Device strategy module 29
I/O initiators, Device handlers 30
Disk scheduling 31
Disk scheduling algorithms 32
Disk scheduling algorithms 33
Design of IO systems, File Management. 34
Introduction to Unix and Unix commands. 35
Introduction of sed, awk and grep family. 36
Q and A 37
Q and A 38
Q and A 39
Q and A 40

You might also like