Scribd
Upload
2 views2 pages

Operating Systems Fundamentals

Operating systems (OS) are essential system software that manage hardware and software resources, acting as an interface between users and hardware. Key functions include process and memory management, file management, device management, and security. Modern OS support multitasking and resource optimization, utilizing various scheduling algorithms and techniques to handle deadlocks and ensure efficient I/O operations.

Uploaded by

pratikkokate88
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views2 pages

Operating Systems Fundamentals

Operating systems (OS) are essential system software that manage hardware and software resources, acting as an interface between users and hardware. Key functions include process and memory management, file management, device management, and security. Modern OS support multitasking and resource optimization, utilizing various scheduling algorithms and techniques to handle deadlocks and ensure efficient I/O operations.

Uploaded by

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

Computer Science Notes: Operating Systems Fundamentals

1. Introduction to Operating Systems (OS)


 An OS is system software that manages hardware and software resources.
 Acts as an interface between the user and the hardware.
2. Functions of Operating Systems
 Process Management: Handles creation, scheduling, and termination of processes.
 Memory Management: Allocates and deallocates memory space.
 File Management: Manages data storage, access, and retrieval.
 Device Management: Controls peripheral devices.
 Security and Protection: Ensures authorized access and protects data.
3. Process and Thread
 Process: A program in execution, with its own address space.
 Thread: A lightweight process that shares the same memory space.
 Context switching is used to move CPU between processes.
4. Scheduling Algorithms
 FCFS (First Come First Serve)
 SJF (Shortest Job First)
 Round Robin
 Priority Scheduling
 Scheduling affects CPU utilization, throughput, turnaround time.
5. Deadlock
 Occurs when processes are stuck waiting for each other.
 Conditions: Mutual exclusion, Hold and wait, No preemption, Circular wait
 Handling:
 Deadlock Prevention
 Deadlock Avoidance (Banker's Algorithm)
 Deadlock Detection and Recovery
6. Memory Management
 Paging: Divides memory into fixed-sized pages.
 Segmentation: Divides memory into variable-sized segments.
 Virtual Memory: Uses disk space to simulate additional RAM.
 Page Replacement Algorithms: FIFO, LRU, Optimal
7. File System
 Responsible for file creation, deletion, access, and protection.
 Directory Structures: Single-level, Two-level, Tree, Acyclic Graph
 File Access Methods: Sequential, Direct, Indexed
8. Security and Protection
 Ensures protection from unauthorized access.
 Techniques: Authentication, Authorization, Encryption, Firewall
9. I/O Systems
 Manages input and output devices.
 Uses interrupts and buffers for efficient handling.
Summary
 OS is vital for efficient resource management.
 Modern OS supports multitasking, security, and resource optimization.

You might also like