Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
5 views4 pages

OS Notes QB

The document provides comprehensive notes on Operating Systems, covering key concepts such as OS services, process management, CPU scheduling, memory management, and file management. It includes short notes, a question bank with 2-mark and 5-mark questions, and detailed explanations of various topics like deadlock conditions, CPU scheduling algorithms, and memory allocation strategies. Additionally, it outlines different types of operating systems and their functions, along with examples and diagrams for better understanding.

Uploaded by

amolchormale49
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
5 views4 pages

OS Notes QB

The document provides comprehensive notes on Operating Systems, covering key concepts such as OS services, process management, CPU scheduling, memory management, and file management. It includes short notes, a question bank with 2-mark and 5-mark questions, and detailed explanations of various topics like deadlock conditions, CPU scheduling algorithms, and memory allocation strategies. Additionally, it outlines different types of operating systems and their functions, along with examples and diagrams for better understanding.

Uploaded by

amolchormale49
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/ 4

Operating System - Notes & Question Bank

■ Short Notes (IPM)


Unit 1: OS Services & Components
- OS = interface between user & hardware, manages resources.
- Functions: Process, Memory, File, I/O, Security, Resource Allocation.
- Types: Batch, Multiprogrammed, Time-sharing, Multiprocessor, Distributed, Real-time, Mobile OS.
- System Calls: open, read, write, fork, exec.

Unit 2: Process Management


- Process = Program in execution.
- States: New, Ready, Running, Waiting, Terminated.
- PCB: process ID, state, registers, memory info.
- Scheduling: Long, Medium, Short-term.
- IPC: Shared memory, Message passing.
- Threads: Lightweight processes.

Unit 3: CPU Scheduling


- Criteria: Utilization, Throughput, Waiting time, Turnaround time, Response time.
- Algorithms: FCFS, SJF, SRTF, Round Robin, Priority, Multilevel Queue.
- Deadlock: Mutual exclusion, Hold & wait, No preemption, Circular wait.
- Handling: Prevention, Avoidance (Banker's), Detection & Recovery.

Unit 4: Memory Management


- Partitioning: Fixed vs Variable.
- Fragmentation: Internal, External.
- Allocation: First Fit, Best Fit, Worst Fit.
- Paging, Segmentation, Virtual Memory.
- Page Replacement: FIFO, LRU, Optimal.

Unit 5: File Management


- File concepts: attributes, operations, file types, structure.
- Access: Sequential, Direct.
- Allocation: Contiguous, Linked, Indexed.
- Directory: Single-level, Two-level, Tree-structured.
■ Short Q&A; (2 Marks)
Q1. Define Operating System.
Q2. Write any two OS services.
Q3. Give two examples of system calls.
Q4. Define Process.
Q5. Define Turnaround Time.
Q6. List 4 conditions of Deadlock.
Q7. Write any two File Allocation Methods.
Q8. Define Virtual Memory.
■ 5 Marks Questions with Answers
1. Explain the main functions of an Operating System. (Process, Memory, File, I/O, Security, Resource
2. Explain different states of a process with a diagram.
3. Differentiate between process and thread.
4. Explain CPU scheduling algorithms (FCFS, SJF, RR, Priority).
5. Explain Deadlock, its conditions & handling methods.
6. Explain Paging with example.
7. Explain Page Replacement algorithms (FIFO, LRU, Optimal).
8. Explain File Allocation Methods (Contiguous, Linked, Indexed).
9. Explain Directory Structures (Single, Two-level, Tree).
■ 10 Marks Questions with Answers
1. Explain types of Operating Systems with examples. (Batch, Time-sharing, Multiprocessor, Distribute
2. Explain Process Scheduling with types & algorithms. (Preemptive, Non-preemptive)
3. Explain Deadlock, Coffman conditions, and handling techniques.
4. Explain Paging & Segmentation with neat diagrams.
5. Explain Memory Allocation strategies (First Fit, Best Fit, Worst Fit).
6. Explain File Allocation methods with diagrams.
7. Explain Directory Structures with advantages & disadvantages.

You might also like