Scribd
Upload
7 views

Operating System

Operating System

Uploaded by

chi.cka0006
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 views

Operating System

Operating System

Uploaded by

chi.cka0006
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/ 3

Operating System

1. What is an Operating System (OS), and what are its types?

 OS Definition: Acts as an interface between hardware and user applications,


managing resources for efficient execution.
 Types:
1. Windows: User-friendly, supports various apps.
2. macOS: Seamless integration with Apple devices.
3. Linux: Open-source, highly customizable.
4. Unix: Multi-user, secure, server-friendly.
5. Android: Open-source, mobile-specific.
6. iOS: Secure, Apple-device exclusive.
7. RTOS: Real-time, used in IoT and embedded systems.

2. Explain Multiprogramming, Multiprocessing, Multitasking, and


Multithreading.

1. Multiprogramming: CPU switches between programs to maximize use.


2. Multiprocessing: Uses multiple CPUs for faster execution.
3. Multitasking: Executes tasks on a single CPU via rapid switching.
4. Multithreading: Executes multiple threads in a single process concurrently.

3. What is the difference between Program, Process, and Thread?

 Program: Static set of instructions.


 Process: Program in execution, has independent resources.
 Thread: Lightweight execution unit within a process, sharing memory.

4. What are the Process States?

1. New: Process creation.


2. Ready: Waiting for CPU allocation.
3. Running: Executing instructions.
4. Waiting: Waiting for an event or resource.
5. Terminated: Completed execution.

5. Explain CPU Scheduling Algorithms.

1. FCFS: Executes first-arrived process; simple but inefficient.


2. SJF: Selects shortest process; minimizes waiting time.
3. Round Robin: Fixed time slices for fairness; overhead involved.
4. Priority: Executes highest-priority process; risk of starvation.
5. Multilevel Queue: Separate queues based on priority or type.

6. What is the Critical Section Problem?

 A part of code accessing shared resources; must ensure:

1. Mutual exclusion: Only one process accesses at a time.


2. Progress: Processes make progress without deadlock.
3. Bounded waiting: No indefinite waiting.

7. Describe Process Synchronization Mechanisms.

1. Locks/Mutexes: Ensures only one process accesses a resource.


2. Semaphores: Controls access; supports multiple users.
3. Read-Write Locks: Allows multiple readers or one writer.

8. What is a Deadlock, and what are its handling techniques?

 Deadlock: Circular wait for resources, leading to halt.


 Handling:

1. Prevention: Break necessary conditions.


2. Avoidance: Use algorithms like Banker's.
3. Detection: Periodic checks for deadlocks.
4. Recovery: Terminate/restart processes.
5. Ignore: Rare occurrence, no action.

9. Explain Fixed vs. Dynamic Partitioning in Memory Management.

 Fixed: Divides memory into fixed blocks; simple but wasteful.


 Dynamic: Allocates memory based on needs; better utilization.

10. What are Paging and Virtual Memory?

1. Paging: Divides memory into pages and frames for better management.
2. Virtual Memory: Combines RAM and disk space for running large programs.
11. Describe Page Replacement Algorithms.

1. FIFO: Removes oldest page.


2. Optimal: Replaces page not used for the longest time (theoretical).
3. LRU: Replaces least recently used page.

12. What is Thrashing?

 Excessive paging causing system slowdown due to constant memory swaps.

13. What is Segmentation?

 Divides memory into logical segments for easier management and reduced
fragmentation.

14. Explain Disk Management Terms and Algorithms.

1. Seek Time: Time to move disk arm to the track.


2. Rotational Latency: Time for the desired sector to reach the R/W head.
3. Algorithms:

o FCFS: Simple but inefficient.


o SSTF: Shortest seek time first.
o SCAN: Moves head in one direction, services requests.
o C-SCAN: Circular SCAN for fairness.
o LOOK/C-LOOK: Similar to SCAN but limits traversal to active requests.

You might also like