CS2411 Operating Systems Scanned Lecture Notes (All Units) - Lavanya Edition

[Srini]

   

Anna University , Chennai

Department of B.E-Electrical and Electronics Engg

Seventh Semester

CS2411 Operating Systems

Scanned Lecture Notes (All Units) - Lavanaya Edition

(Regulation 2008)

Syllabus :
OPERATING SYSTEM

UNIT-1 (pages: 23) : PROCESSES AND THREADS
UNIT-2 (pages: 20) : PROCESS SCHEDULING AND SYNCHRONIZATION
UNIT-3 (pages: 12) : STORAGE MANAGEMENT
UNIT-4 (pages: 5) : FILE SYSTEM
UNIT-5 (pages: 12) : INPUT OUTPUT SYSTEM


 Attachment : Click Here



Content :
UNIT-1

PROCESSES AND THREADS
Operating system goal
Computer system components
1. Hardware
2. Operating system
3. Application programs
4. Users
Abstract view of system components
Operating system zoo
1. Main frame operating system
2. Server operating system
3. Multiprocessor operating system
4. Personal computing operating system
5. Real time operating system
6. Embedded operating
7. Smart card operating system
Operating system structure
System components
Causes managements
System calls
Types of system call
1. Process control
2. File managements
3. Device managements
4. Information maintenance
5. Communication
System program
1. File management
2. Status information
3. File manipulation
4. Programming language support
5. Program loading and execution
6. Communication
System structure
Responsibility of OS
Process state
Inter process communication
1. Send
2. Receive
Design characteristics of message system by IPC
Three combination of synchronization
Buffering
Message format
Threads
Types of threads
1. User thread
2. Kernel thread
Models of multi threadings
1. Many to one model
2. One to one model
3. Many to many model
Signal handling

UNIT-2

PROCESS SCHEDULING AND SYNCHRONIZATION
CPU scheduling
Sequence of CPU and I\O burst
Scheduling methods
Scheduling criteria 
Scheduling algorithm
Algorithm evaluation
Multi process scheduling
OS concerns
Process interaction
Semphores
Dead locks
Types of resources
Methods of handling dead locks
1. Protocol
2. Detect and recover
3. Ignore the dead lock
Banker’s algorithm
1. Safety algorithm
2. Resources
Classic problems of synchronization


UNIT-3

STORAGE MANAGEMENT
Memory management
Types of address
1. Physical address
2. Locateable address
3. Absolute address
Introduction
Background
Function of main memory managements
Requiements of memory managements
Relocation
Logical organization
Address bindings
Compile time
Load time
Execution
Dynamic loading
Swapping
Bucking store
Swap time
Contiguous memory allocation
Fragmentation
1. Internal fragmentation
2. External fragmentation
Page fault
Process creation
Copy on write
Thrashing

UNIT-4

FILE SYSTEM
File
File attribute
Operation
File structure
File type
Access method
Directory structure
Operation performed on a directory
Types of directory
Single level directory
Tree structure directory
Protection
Types of access
Access control
Allocation methods
Free space managements

UNIT-5

INPUT OUTPUT SYSTEM
Categories
Difference between i\o devices
I/o hardware
Interface
Disk performance parameters
Rotational delay
Transfer time
Total capacity of disk
Disk scheduling
FCFS scheduling
Look scheduling
Swap space management
Swap space location

 Attachment : Click Here