Scribd
Upload
7 views3 pages

Operating System Notes

An Operating System (OS) serves as an interface between users and computer hardware, managing processes, memory, files, and devices. Various types of OS include Batch, Multiprogramming, Time Sharing, Real-Time, and Distributed systems, each with distinct functionalities. Key concepts covered include CPU scheduling algorithms, synchronization, deadlock management, memory management techniques like paging, and file system operations.

Uploaded by

sagarpandey5542
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
7 views3 pages

Operating System Notes

An Operating System (OS) serves as an interface between users and computer hardware, managing processes, memory, files, and devices. Various types of OS include Batch, Multiprogramming, Time Sharing, Real-Time, and Distributed systems, each with distinct functionalities. Key concepts covered include CPU scheduling algorithms, synchronization, deadlock management, memory management techniques like paging, and file system operations.

Uploaded by

sagarpandey5542
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

Operating Systems: Comprehensive

Study Notes

1. Introduction to Operating System

An Operating System (OS) is system software that acts as an interface between the user
and computer hardware.

• Functions: Manages hardware, provides services to programs, controls execution.


• Examples: Windows, Linux, macOS, Android.

2. Core Functions of OS

• Process Management, Memory Management, File Management, Device


Management.
• Security, Scheduling, Resource Allocation.

3. Types of Operating Systems

• Batch OS: Jobs in batches, no user interaction, high throughput.


• Multiprogramming: Multiple programs in memory, increases CPU utilization.
• Time Sharing: CPU time divided among users, fast response (e.g., UNIX).
• Real Time (RTOS): Hard: Strict deadlines (Air Traffic Control). Soft: Flexible
(Multimedia).
• Distributed/Network: Systems working together or providing network features.

4. Process Management & Threads

• Process: A program in execution. Contains PCB (Process ID, State, Registers).


• Process States: New → Ready → Running → Waiting → Terminated.
• Threads: Smallest unit of CPU execution. User-level vs. Kernel-level.
5. CPU Scheduling

• Criteria: Utilization, Throughput, Turnaround Time, Waiting Time, Response Time.


• Algorithms:
◦ FCFS: Non-preemptive, simple, potential "Convoy Effect".
◦ SJF: Shortest burst first, optimal for waiting time.
◦ Priority: Potential "Starvation", solved by "Aging".
◦ Round Robin: Uses time quantum, great for time-sharing.

6. Synchronization & Deadlock

• Synchronization: Mutex (lock), Semaphore (counting/binary).


• Deadlock: Coffman Conditions: Mutual Exclusion, Hold & Wait, No Preemption,
Circular Wait.
• Handling: Prevention, Avoidance (Banker's Algorithm), Detection & Recovery.

7. Memory Management & Paging

• Paging: Logical (Pages) to Physical (Frames). No external fragmentation.


• Segmentation: Logical division (Code, Stack, Data).
• Virtual Memory: Demand paging, Page faults, Thrashing (excessive swapping).
• Algorithms: FIFO, LRU, Optimal.

8. File System, Disk Scheduling, & Kernel

• Disk Scheduling: FCFS, SSTF, SCAN, C-SCAN.


• Kernel: Monolithic vs. Microkernel.
• Booting: Cold (OFF to ON) vs. Warm (Restart).

UGC NET Key Takeaways

• SJF provides minimum average waiting time.


• Round Robin is best for time-sharing.
• Banker's Algorithm is for deadlock avoidance.
• Paging eliminates external fragmentation.
• Thrashing occurs due to high degree of multiprogramming.

You might also like