Back to Subject
View Notes

Unit 2 - Practice Quiz

CSE316

1 Which component of the Operating System is responsible for selecting a process from the ready queue and allocating the CPU to it?

A. Dispatcher
B. CPU Scheduler
C. Interrupt Handler
D. Job Scheduler

2 The module that gives control of the CPU to the process selected by the short-term scheduler is known as:

A. Dispatcher
B. Scheduler
C. Allocator
D. Interrupt Service Routine

3 What is 'Dispatch Latency'?

A. The time it takes for a process to complete execution
B. The time it takes for the dispatcher to stop one process and start another
C. The time a process waits in the ready queue
D. The time taken by the CPU to execute an instruction

4 In which of the following situations is CPU scheduling decision mandatory (non-preemptive)?

A. When a process switches from running to ready state
B. When a process switches from waiting to ready state
C. When a process terminates
D. When a process switches from ready to running state

5 Which scheduling algorithm results in the 'Convoy Effect'?

A. Round Robin
B. Shortest Job First
C. First-Come, First-Served
D. Priority Scheduling

6 What is the primary objective of the Shortest Job First (SJF) scheduling algorithm?

A. To maximize throughput
B. To minimize average waiting time
C. To ensure fairness
D. To minimize response time

7 Preemptive Shortest Job First scheduling is also known as:

A. Shortest Remaining Time First
B. Preemptive Priority Scheduling
C. Round Robin
D. Multilevel Queue Scheduling

8 In Round Robin scheduling, if the time quantum is extremely large, the algorithm degenerates into which scheduling policy?

A. Shortest Job First
B. First-Come, First-Served
C. Priority Scheduling
D. Multilevel Feedback Queue

9 What is the major drawback of Priority Scheduling?

A. Deadlock
B. Starvation
C. High overhead
D. Low throughput

10 Which technique is used to solve the problem of starvation in Priority Scheduling?

A. Context Switching
B. Aging
C. Paging
D. Swapping

11 Which scheduling criteria refers to the number of processes that complete their execution per time unit?

A. CPU utilization
B. Throughput
C. Turnaround time
D. Response time

12 Turnaround time is defined as:

A. The time from submission of a process to the time of completion
B. The time a process spends waiting in the ready queue
C. The time from submission to the first response
D. The total time the CPU is busy

13 Which scheduling algorithm is designed specifically for time-sharing systems?

A. First-Come, First-Served
B. Shortest Job First
C. Round Robin
D. Non-preemptive Priority

14 In Multilevel Feedback Queue scheduling, a process can:

A. Move between queues
B. Only stay in one queue
C. Never be preempted
D. Choose its own priority

15 If a process is I/O bound, in a Multilevel Feedback Queue, it should ideally be placed in:

A. A lower priority queue with a long time quantum
B. A higher priority queue with a short time quantum
C. The last queue in the system
D. A blocked queue permanently

16 What is 'Process Affinity' (or Processor Affinity) in multiprocessor scheduling?

A. A process creates a child process
B. A process prefers to run on the same processor it ran on previously
C. Two processes share the same memory
D. Processes communicate via signals

17 Which of the following is NOT a characteristic of a Hard Real-Time System?

A. Critical tasks must complete on time
B. Missing a deadline is a total system failure
C. Guaranteed quality of service
D. Deadlines are optional if system is busy

18 Rate Monotonic Scheduling assigns priorities to tasks based on their:

A. CPU Burst time
B. Arrival time
C. Period (frequency)
D. Deadline

19 Earliest Deadline First (EDF) scheduling assigns priorities:

A. Statically based on period
B. Dynamically based on closeness to deadline
C. Based on shortest burst
D. Randomly

20 In Thread Scheduling, the distinction between PCS (Process-Contention Scope) and SCS (System-Contention Scope) relies on:

A. The size of the thread
B. The level at which threads compete for CPU time
C. The programming language used
D. The amount of memory allocated

21 The formula for calculating Waiting Time for a specific process is:

A. Turnaround Time - Burst Time
B. Completion Time - Arrival Time
C. Burst Time + Arrival Time
D. Response Time + Burst Time

22 Which scheduling algorithm is most difficult to implement because it requires predicting the future?

A. FCFS
B. Round Robin
C. SJF
D. Multilevel Queue

23 In asymmetric multiprocessing:

A. All processors are peers
B. One processor (master) controls the system, others look to it or have predefined tasks
C. No processor controls another
D. Each processor has its own ready queue only

24 Load balancing in multiprocessor systems involves:

A. Increasing the time quantum
B. Push migration and Pull migration
C. Disabling interrupts
D. Reducing the number of processors

25 Which of the following is a criterion for 'Response Time'?

A. Time to output the first character
B. Time to finish the whole job
C. Time from submission to first response produced
D. Time spent in ready queue

26 Under preemptive scheduling, when can the CPU be taken away from a process?

A. Only when the process terminates
B. Only when the process requests I/O
C. When an interrupt occurs or a higher priority process arrives
D. Never

27 What determines the efficiency of the Round Robin algorithm?

A. The size of the time quantum
B. The number of processes
C. The memory size
D. The I/O speed

28 In the context of scheduling, what is 'Little's Law' used for?

A. Estimating the next CPU burst
B. Determining average queue length based on arrival rate and average wait time
C. Assigning priorities
D. Detecting deadlocks

29 Which method is commonly used to predict the next CPU burst duration for SJF?

A. Random guessing
B. Exponential averaging of previous bursts
C. Fixed constant value
D. User input

30 What is 'Soft Affinity'?

A. The OS guarantees the process runs on the same processor
B. The OS attempts to keep the process on the same processor but doesn't guarantee it
C. The process runs on any processor randomly
D. The process runs only on the master processor

31 A system where the ready queue is partitioned into separate queues (e.g., foreground and background) with different scheduling algorithms is called:

A. Round Robin
B. Multilevel Queue Scheduling
C. SJF
D. FCFS

32 Which priority applies in Windows scheduling when a thread is running in the kernel?

A. Variable priority
B. Real-time priority
C. GUI priority
D. Idle priority

33 Pthread scheduling API allows specifying the scope of contention. What does PTHREAD_SCOPE_SYSTEM mean?

A. The thread competes with all threads in the system for CPU
B. The thread competes only within the process
C. The thread cannot be preempted
D. The thread is a kernel thread only

34 In a real-time system, 'Interrupt Latency' refers to:

A. Time from interrupt arrival to the start of the execution of the ISR
B. Time to execute the ISR
C. Time to return from the ISR
D. Time waiting for the interrupt

35 Which scheduling algorithm ensures that no process waits more than (n-1) x q time units, where n is the number of processes and q is the time quantum?

A. SJF
B. FCFS
C. Round Robin
D. Priority

36 Cooperative scheduling is another name for:

A. Preemptive scheduling
B. Non-preemptive scheduling
C. Multiprocessor scheduling
D. Thread scheduling

37 Typically, a long-term scheduler executes:

A. Every few milliseconds
B. Much less frequently than the short-term scheduler
C. Only at system boot
D. When an interrupt occurs

38 Which of the following is true about 'Admission Control' in Real-Time Scheduling?

A. It admits all processes regardless of load
B. It admits a process only if the system can guarantee its deadline
C. It is used in FCFS
D. It ignores deadlines

39 In calculating average waiting time, what is the arrival time usually assumed to be if not specified?

A. 1
B. 10
C.
D. Infinity

40 What is the main disadvantage of Multilevel Feedback Queue scheduling?

A. It is the most complex to implement and tune
B. It does not support interactive users
C. It causes immediate deadlock
D. It cannot handle I/O bound processes

41 What happens to the 'Context Switch' time?

A. It is useful processing time
B. It is pure overhead
C. It is used for I/O
D. It shortens the process execution

42 Conflict phase of dispatch latency typically involves:

A. Preemption of any process running in the kernel and release by low-priority process of resources
B. Formatting the hard drive
C. Loading the new program from disk
D. Waiting for user input

43 Which scheduling algorithm suffers from the problem of indefinite blocking?

A. Round Robin
B. Priority Scheduling
C. FIFO
D. Rate Monotonic

44 In SMP (Symmetric Multiprocessing), where can a process run?

A. Only on CPU 0
B. On any available processor
C. On the I/O processor only
D. On the GPU only

45 What is the 'Throughput' if 10 processes finish in 5 seconds?

A. 2 processes/second
B. 0.5 processes/second
C. 50 processes/second
D. 5 processes/second

46 Typically, 'Foreground' processes in a Multilevel Queue system use which algorithm?

A. FCFS
B. Round Robin
C. SJF
D. Random

47 Typically, 'Background' processes in a Multilevel Queue system use which algorithm?

A. Round Robin
B. FCFS
C. Priority
D. Real-time

48 Which type of thread scheduling allows the user-level thread library to schedule threads?

A. System-Contention Scope (SCS)
B. Process-Contention Scope (PCS)
C. Hard Real-time
D. Round Robin

49 If a process has a CPU burst of 10ms and the time quantum is 20ms, what happens?

A. The process runs for 10ms, terminates/yields, and the context switches
B. The CPU idles for 10ms
C. The process is forced to run for 20ms
D. An error occurs

50 Which concept describes the cycle of CPU execution and I/O wait?

A. CPU-I/O Burst Cycle
B. Fetch-Decode-Execute Cycle
C. Interrupt Cycle
D. Boot Cycle