Question 1

Define Operating System and its role.

Accepted Answer

An Operating System is the master control program that mathematically allocates physical hardware resources and provides a secure abstraction layer for user applications.

Question 2

What is a Process Control Block?

Accepted Answer

A Process Control Block (PCB) is a massive data structure utilized by the OS to perfectly track the mathematical state of a specific process.

Question 3

Define Scheduling.

Accepted Answer

Scheduling is the mathematical algorithmic process of dictating exactly which process receives CPU execution time and for exactly how long.

Question 4

What is Mutual Exclusion?

Accepted Answer

Mutual Exclusion is the absolute mathematical guarantee that only one thread can physically execute inside a shared critical section at any given millisecond.

Question 5

Define Deadlock.

Accepted Answer

Deadlock is a catastrophic system failure where a set of processes are permanently blocked because they are mathematically waiting on each other's resources.

Question 6

What is Memory Allocation?

Accepted Answer

Memory Allocation is the mathematical process of dividing and assigning physical RAM blocks to requesting processes.

Question 7

Define Page Table.

Accepted Answer

A Page Table is a massive architectural data structure used to mathematically translate logical virtual addresses into physical RAM frame addresses.

Question 8

What is a System Call?

Accepted Answer

A System Call is a strictly controlled software interrupt utilized by user applications to demand privileged hardware operations from the Kernel.

Question 9

Define File Descriptor.

Accepted Answer

A File Descriptor is a positive mathematical integer utilized by the OS Kernel to uniquely identify an open file within a specific process.

Question 10

What is a Kernel?

Accepted Answer

The Kernel is the absolute core, highly privileged architectural engine of the Operating System that constantly resides in physical RAM.

Question 11

Explain the concept of Process Scheduling and different scheduling criteria.

Accepted Answer

A rigorous breakdown of Process Scheduling architecture, detailing the Long, Medium, and Short-term schedulers, and the strict mathematical criteria (Throughput, Turnaround, Waiting time) used to measure algorithmic performance.

Question 12

Describe the concept of Semaphores and Monitors.

Accepted Answer

An advanced technical comparison between Dijkstra's integer-based Semaphores and the highly abstracted, object-oriented synchronization architecture of Monitors in preventing Race Conditions.

Question 13

Explain the concept of Deadlock Detection and Recovery.

Accepted Answer

A detailed exploration of Deadlock Detection and Recovery, explaining how the OS utilizes Wait-For graphs and Resource Allocation matrices to identify freezes, and aggressive process termination to recover the system.

Question 14

Discuss the concept of Contiguous Memory Allocation.

Accepted Answer

An architectural review of Contiguous Memory Allocation, highlighting the fatal flaw of External Fragmentation and the mathematical algorithms (First-Fit, Best-Fit, Worst-Fit) used to locate memory holes.

Question 15

Explain the concept of Demand Paging and Page Fault.

Accepted Answer

A deep dive into Demand Paging, explaining how the CPU's MMU mathematically triggers a hardware Page Fault to violently pause execution and load missing data from the Hard Drive.

Question 16

Describe the concept of File Protection mechanisms.

Accepted Answer

An architectural review of File Protection mechanisms, detailing how Access Control Lists (ACLs) and UNIX Permission Bits mathematically enforce strict read, write, and execute boundaries between independent users.

Question 17

Explain the concept of I/O Subsystem.

Accepted Answer

A detailed exploration of the I/O Subsystem, explaining how the OS violently isolates hardware complexity using Device Drivers, Buffering, Caching, and Spooling to synchronize slow peripherals with a fast CPU.

Question 18

(a) Explain the OS structure (Monolithic, Layered, Microkernel, Modular). (b)…

Accepted Answer

An exhaustive architectural analysis of Operating System design, mathematically contrasting the raw speed of Monolithic kernels against the absolute stability of Microkernels, followed by a rigorous breakdown of System Calls.

Question 19

(a) Explain all CPU Scheduling Algorithms (FCFS, SJF, Priority, Round Robin, …

Accepted Answer

A definitive mathematical comparison of CPU Scheduling algorithms (FCFS, SJF, Priority, Round Robin, Multilevel Queue), detailing their exact execution mechanics, the threat of Starvation, and context-switching overhead.

Question 20

(a) Explain the concept of Deadlock in detail with necessary conditions. (b) …

Accepted Answer

A rigorous theoretical exposition on Deadlock, explicitly defining the four Coffman conditions, followed by a mathematical analysis of the Banker's Algorithm for avoidance and graph theory for detection.

Question 21

(a) Explain Memory Management techniques. (b) Discuss Paging and Segmentation…

Accepted Answer

An exhaustive architectural analysis of Memory Management, mathematically contrasting the fixed block sizes of Paging against the logical divisions of Segmentation, and detailing the eviction mechanics of Page Replacement algorithms.

Question 22

(a) Explain File System Implementation. (b) Discuss File Allocation Methods (…

Accepted Answer

A deep technical exposition on File System Implementation, violently contrasting the catastrophic fragmentation of Contiguous allocation against Indexed allocation, and mathematically analyzing mechanical HDD scheduling algorithms (SCAN, SSTF).

Operating Systems (Departmental Elective)