Jawaharlal Nehru Technological University Hyderabad B.Tech II OPERATING SYSTEMS Previous Question Paper (July/August - 2021 - R16)

Protection and security are distinct but complementary mechanisms in an operating system. Protection refers to the internal control mechanisms that govern the access of processes or users to the resources defined by the computer system. Its primary goal is to ensure that each active program and user can only perform actions within the system that are permitted by the operating system's policies, preventing unauthorized or accidental interference between processes.

In contrast, Security is a broader measure that protects the entire system against external and internal threats, including unauthorized access, malicious attacks, data breaches, and system failures. While protection focuses on internal resource management, security focuses on the integrity, confidentiality, and availability of the system as a whole.

Key differences include:

• Scope: Protection is internal to the system, managing resource access; security is external and internal, dealing with threats like viruses, worms, and unauthorized users.
• Objective: Protection ensures system reliability and process isolation; security ensures system integrity and data privacy.
• Mechanism: Protection uses mechanisms like access control lists (ACLs), domains, and memory protection; security uses authentication (passwords, biometrics), encryption, firewalls, and intrusion detection systems.

A Time-Shared Operating System is a multi-user, multi-tasking system that allows multiple users to interact with a single computer system simultaneously. This is achieved through CPU scheduling and multiprogramming, where the CPU switches rapidly between different tasks or user processes.

The fundamental concept is that the CPU allocates a small slice of time, known as a Time Quantum or time slice, to each process. Once the time slice expires, the OS interrupts the current process, saves its state, and switches to the next process in the queue. Because these switches occur in milliseconds, each user perceives that they have exclusive access to the system, despite the CPU being shared among many.

Key features include:

1. Responsiveness: Provides quick interaction for users, as the system cycles through tasks frequently.
2. Concurrent Execution: Multiple programs reside in memory and execute concurrently, increasing system utilization.
3. Fairness: Every user or process gets an equal opportunity to use the CPU resources based on the scheduling algorithm (e.g., Round Robin).
4. Resource Sharing: Efficiently shares hardware resources like memory, I/O devices, and processors among multiple users.

The primary challenge in time-shared systems is the overhead associated with Context Switching, where the OS must save and restore the state of processes. If the time quantum is too small, the system spends more time switching than executing; if it is too large, the system loses its interactive, real-time feel.