Operating System Test 2 Computer Subject
Operating System Test 2 Computer Subject
Question 1
An optimal job scheduling scheme is _____?
Round-Robin (RR) is often considered optimal for time-sharing systems as it provides fairness by giving each process equal CPU time.
Not clear enough?
Question 2
The FIFO algorithm _____?
FIFO (First-In, First-Out) executes jobs in the exact order they arrive, meaning the first job to enter is executed first.
Not clear enough?
Question 3
Among CPU scheduling policies, First Come First Serve (FCFS) is attractive because _____?
FCFS is attractive mainly due to its simplicity in implementation, even though it may not always minimize waiting time.
Not clear enough?
Question 4
_____ is the number of processes that are completed per unit time.
Throughput refers to the total number of processes completed in a given time unit, indicating efficiency.
Not clear enough?
Question 5
What type of scheduling is round-robin scheduling?
Round-robin scheduling is a preemptive scheduling algorithm that assigns a fixed time quantum to each process in a cyclic order.
Not clear enough?
Question 6
A circular queue is the most appropriate data structure for _____ scheduling.
Round Robin scheduling uses a circular queue to cycle through processes in a fair and repetitive manner.
Not clear enough?
Question 7
Turnaround time refers to the amount of time _____?
Turnaround time is the total time taken from process submission to process completion.
Not clear enough?
Question 8
_____ is the amount of time it takes from when a request was submitted until the first response is produced.
Response time measures how quickly the system produces the first response after a request is submitted.
Not clear enough?
Question 9
The threading model supported by Linux operating system is _____?
Linux primarily uses the one-to-one threading model, mapping each user thread to a kernel thread.
Not clear enough?
Question 10
Which of the following scheduling algorithms is preemptive scheduling?
Shortest Remaining Time First (SRTF) is a preemptive version of SJF where the shortest job can preempt a longer one.
Not clear enough?
You might like
The colour changes observed when testing for reducing agents using acidified potassium heptaoxodichromate (VI) solution is
2/3 Purchases 900 books at #1,000 each
4/3 Purchases 590 books at #950 each
15/3 Sales 300 books at #900 each
Calculate the cost of goods available for sale using LIFO.
When you save data to a shared network drive, the physical location where your file is stored is typically a: