Which of the following is considered the primary purpose of an Operating System?

A Batch Operating System is characterized by processing jobs in:

Which feature of an Operating System is responsible for continually ensuring that the system is operating correctly by monitoring hardware and software for possible errors?

The operating system's ability to run multiple processes seemingly simultaneously, managed by rapid context switching, is the primary characteristic of which classification of OS?

Which type of User Interface is characterized by commands or codes being entered at a command prompt to perform operations?

A primary advantage of implementing OS Virtualization is:

The term for the time it takes to stop one process and start running another, saving the state of the old process and loading the saved state for the new process, is known as:

In the Deadlock model, what type of resource is shareable and typically does not require mutual exclusion?

Which of the four conditions necessary for a Deadlock to occur is violated when all resources are either shareable or, if exclusive, a process can be forced to temporarily relinquish a resource it holds?

The process of swapping pages between main memory and secondary storage on demand, where a page is only moved to main memory when it is actually referenced, is called:

Which memory management technique is defined by fixed-size divisions of memory that may result in internal fragmentation?

Consider four processes P1, P2, P3, and P4 with Arrival Times (AT) 0, 1, 2, 3 ms and Burst Times (BT) 10, 5, 2, 4 ms, respectively. What is the Completion Time (CT) for process P3 using the First-Come, First-Served (FCFS) scheduling algorithm?

Using the same processes from Q13 (P1 (10, 0), P2 (5, 1), P3 (2, 2), P4 (4, 3) ), what is the Waiting Time (WT) for process P4 using FCFS?

Consider four processes P1, P2, P3, and P4 with Arrival Times (AT) 0, 1, 2, 3 ms and Burst Times (BT) 10, 5, 2, 4 ms, respectively.

Using the processes from the above, what is the Average Waiting Time (Avg WT) using the FCFS algorithm?

Consider four processes P1, P2, P3, and P4 with Arrival Times (AT) 0, 1, 2, 3 ms and Burst Times (BT) 10, 5, 2, 4 ms, respectively.

Using the processes from the above, what is the Completion Time (CT) for process P2 using the Non-Preemptive Shortest Job First (SJF) scheduling algorithm?

Consider four processes P1, P2, P3, and P4 with Arrival Times (AT) 0, 1, 2, 3 ms and Burst Times (BT) 10, 5, 2, 4 ms, respectively.

Using the processes from the above, and the Non-Preemptive SJF algorithm, what is the Waiting Time (WT) for process P3?

Consider four processes P1, P2, P3, and P4 with Arrival Times (AT) 0, 1, 2, 3 ms and Burst Times (BT) 10, 5, 2, 4 ms, respectively.

Using the processes from the above and the Non-Preemptive SJF algorithm, what is the Waiting Time (WT) for process P3?

Consider four processes P1, P2, P3, and P4 with Arrival Times (AT) 0, 1, 2, 3 ms and Burst Times (BT) 10, 5, 2, 4 ms, respectively.

Using the processes from Q13 and the Non-Preemptive SJF algorithm, what is the Average Turnaround Time (Avg TAT)?

Consider four processes P1, P2, P3, and P4 with Arrival Times (AT) 0, 1, 2, 3 ms and Burst Times (BT) 10, 5, 2, 4 ms, respectively.

Using the processes from Q13 and the Round Robin (RR) algorithm with a time slice q = 2ms, what is the Completion Time (CT) for process P4?

Consider four processes P1, P2, P3, and P4 with Arrival Times (AT) 0, 1, 2, 3 ms and Burst Times (BT) 10, 5, 2, 4 ms, respectively.

Using the processes from Q13 and the Round Robin (RR) algorithm with a time slice q = 2ms, what is the Waiting Time (WT) for process P2?

Consider four processes P1, P2, P3, and P4 with Arrival Times (AT) 0, 1, 2, 3 ms and Burst Times (BT) 8, 4, 9, 5 ms, respectively. What is the Completion Time (CT) for process P1 using the Shortest Remaining Time First (SRTF) scheduling algorithm (preemptive)?

Consider four processes P1, P2, P3, and P4 with Arrival Times (AT) 0, 1, 2, 3 ms and Burst Times (BT) 8, 4, 9, 5 ms, respectively.

Using the SRTF processes from Q21, what is the Waiting Time (WT) for process P3?

Consider four processes P1, P2, P3, and P4 with Arrival Times (AT) 0, 1, 2, 3 ms and Burst Times (BT) 8, 4, 9, 5 ms, respectively.

Using the SRTF processes from Q21, what is the Average Waiting Time (Avg WT) for all processes?

Consider four processes P1, P2, P3, and P4 with Arrival Times (AT) 0, 1, 2, 3 ms and Burst Times (BT) 8, 4, 9, 5 ms, respectively.

What is the Average Turnaround Time (Avg TAT) for all processes using the SRTF algorithm with the processes from the above information.

Three processes P1, P2, and P3 have Arrival Times (AT) of 0, 0, 0 ms and Burst Times (BT) of 24, 3, 3 ms. Assuming FCFS scheduling order P1, P2, P3, what is the Average Waiting Time (Avg WT)?

Three processes P1, P2, and P3 have Arrival Times (AT) of 0, 0, 0 ms and Burst Times (BT) of 24, 3, 3 ms.

Using the processes from the above, what is the Average Waiting Time (Avg WT) if the Non-Preemptive Shortest Job First (SJF) algorithm is used (assuming order P2, P3, P1 for tie-breaking)?

The Non-Preemptive SJF scheduling algorithm is provably optimal in terms of minimizing which performance metric?

A scheduling algorithm where a high-priority process can interrupt and halt a currently running low-priority process is an example of:

Which of the following is a key advantage of the Round Robin (RR) scheduling algorithm?

In the process lifecycle, a Context Switch primarily occurs when a process transitions from the running state to which other state?

Which of the following is NOT one of the four necessary conditions for a Deadlock to exist in a system?

In the Deadlock Avoidance strategy using the Banker's Algorithm, a process Pi can be safely granted a requested resource Rj if and only if:

In the Banker's Algorithm, the Need matrix for a process Pi is calculated by subtracting the Allocation from the Max matrix. Given Max P1 =(3, 2, 2) and Allocation P1 = (2, 0, 0), what is Need P1 ?

Consider a system with Total Resources = (10, 5, 7) of types A, B, and C, and a set of processes P0, P1, P2. The total current Allocation is (5, 1, 2). What is the Available resource vector?

The Resource Allocation Graph (RAG) is a visual model used primarily to detect deadlock conditions. Which statement correctly describes the nature of cycles in the RAG?

A system state is considered Safe if and only if:

Deadlock prevention often requires violating one of the four necessary conditions. Which prevention method leads to low resource utilization due to resources being allocated unnecessarily long?

In Memory Management, the wasted space left within an allocated memory partition or page when the process size is smaller than the allocated size is called:

A memory partitioning scheme uses fixed partitions of size 100KB, 200KB, 300KB, and 400KB. If a process P4 requiring 100KB is placed in the 300KB partition, what is the resulting Internal Fragmentation?

Consider a system where four processes P1 (90KB), P2 (150KB), P3 (350KB), and P4 (100KB) are allocated to fixed partitions of 100KB, 200KB, 400KB, and 300KB respectively. What is the total Internal Fragmentation for all allocated partitions?

If a memory system uses a 32-bit logical address space and a Page Size of 4 KB, how many bits are required for the Page Offset?

Using the same logical address space and page size from Q41 (32bit address, 4KB page size), how many bits are required for the Page Number?

Which dynamic memory allocation strategy searches for the smallest hole that is large enough to satisfy the process request?

The primary goal of Virtual Memory is to:

Which of the following is a key advantage of Demand Segmentation over simple Paging?

A key disadvantage of Command Line Interfaces (CLI) compared to Graphical User Interfaces (GUI) is the requirement for the user to:

The operating system in an embedded system that must guarantee a response within a fixed, very tight time constraint, such as in industrial control or medical devices, is an example of a:

Which software component in a Demand Paging system decides which page should be swapped out of physical memory when a new page fault occurs?

A system implements a 1-level paging structure. The Page Table Entry (PTE) size is 4 Bytes. If a process has a 256MB logical address space and the page size is 4KB, what is the total memory space required for the Page Table itself?

Which memory allocation scheme is most vulnerable to External Fragmentation ?

In a demand paging system, what is the term for the event that occurs when a process attempts to access a page that is not currently in main memory?

Which field in the Page Table Entry (PTE) is used by the operating system to indicate whether a page is currently located in physical memory or on secondary storage?

If the Memory Access Time is 200 ns and the Page Fault Service Time is 8 ms (including swapping), what is the Effective Access Time for a Page Fault Rate of p = 0.001 ?

What is the primary consequence of a Page Fault Rate being too high in a demand paging system?

Which strategy for handling a page fault requires the system to check the 'Dirty Bit' of the victim page before writing it back to the disk?

Consider the page reference string: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1. If the system has 3 free frames, how many Page Faults occur using the First-In, First-Out (FIFO) page replacement algorithm?

Using the same reference string and 3 frames, what is the number of Page Faults using the Least Recently Used (LRU) page replacement algorithm?

Using the same reference string and 3 frames, what is the number of Page Faults using the Optimal (OPT) / MIN page replacement algorithm?

The Least Frequently Used (LFU) page replacement algorithm suffers from the potential problem of:

Excessive hardware overhead due to the use of a stack for page access times.

A key characteristic of all Disk Scheduling Algorithms is that they aim to minimize the total amount of:

Which disk scheduling algorithm is most likely to cause starvation for requests near the inner or outer edge of the disk, if a steady stream of new requests continually arrives near the current head position?

Consider the request queue 98, 183, 37, 122, 14, 124, 65, 67. If the current head position is 53, and cylinders range from 0 to 199, what is the total $\text{Head Movement}$ (in cylinders) using the First-Come, First-Served (FCFS) algorithm?

Consider the request queue 98, 183, 37, 122, 14, 124, 65, 67. If the current head position is 53.

Using the same request queue and current head position from the above, what is the total Head Movement (in cylinders) using the Shortest Seek Time First (SSTF) algorithm?

Which disk scheduling algorithm ensures fairness and prevents starvation by sweeping the disk head in one direction, serving all requests encountered, and then reversing direction?

Using the request queue 98, 183, 37, 122, 14, 124, 65, 67, a current head position of 53, and cylinders 0 to 199. What is the total Head Movement (in cylinders) using the SCAN algorithm, assuming the head is initially moving towards 199 (the largest cylinder)?

The C-SCAN (Circular SCAN) algorithm improves upon SCAN primarily by:

Consider the request queue 98, 183, 37, 122, 14, 124, 65, 67. If the current head position is 53.

Using the same request queue and current head position from the above, what is the total Head Movement (in cylinders) using the C-SCAN algorithm, assuming the head is initially moving towards 199 and cylinders 0 to 199?

What is the primary difference between the LOOK and SCAN disk scheduling algorithms?

Consider the request queue 98, 183, 37, 122, 14, 124, 65, 67. If the current head position is 53.

Using the request queue and current head position from the above, what is the total Head Movement (in cylinders) using the LOOK algorithm, assuming the head is initially moving towards 199 (the largest cylinder)?

What is the primary difference between the C-LOOK and C-SCAN disk scheduling algorithms?

Consider the request queue 98, 183, 37, 122, 14, 124, 65, 67. If the current head position is 53.

Using the request queue and current head position from Q13, what is the total Head Movement (in cylinders) using the C-LOOK algorithm, assuming the head is initially moving towards 199 (the largest cylinder)?

In a demand paging system, what is the role of the Paging Daemon process?

Which page replacement algorithm is impractical to implement because it requires foreknowledge of future page references?

What is the primary function of the Dirty Bit (or Modified Bit) in a Page Table Entry?

Which of the following is considered a major drawback of the FIFO page replacement algorithm?

In the LOOK disk scheduling algorithm, the worst-case seek time for a request occurs for a request that is:

If a memory system uses 1 - level paging, a 64-bit logical address, and a Page Size of 16 KB, how many bits are used for the Page Offset?

In the Second Chance (Clock) page replacement algorithm, what is the action taken when a victim page is found to have its Reference Bit set to '1'?

Which of the following disk scheduling algorithms typically results in the highest average response time and highest total head movement?