Mock Quiz Hub

Time: 00:00

Quiz

Navigate through questions using the controls below

Question 1 of 60 Quiz ID: q1

What is the primary goal of multiprogramming in CPU scheduling?

To reduce memory usage

To maximize CPU utilization

To minimize power consumption

To increase disk storage capacity

Question 2 of 60 Quiz ID: q2

In the CPU-I/O Burst Cycle, what follows a CPU burst?

Another CPU burst

Process termination

An I/O burst

Memory allocation

Question 3 of 60 Quiz ID: q3

According to the histogram of CPU-burst times, what characterizes the distribution?

Equal distribution of short and long bursts

Large number of short bursts, small number of longer bursts

Small number of short bursts, large number of longer bursts

Only medium-length bursts

Question 4 of 60 Quiz ID: q4

Which of the following situations requires a scheduling decision?

Process switches from running to waiting state

Process switches from running to ready state

Process switches from waiting to ready state

All of the above

Question 5 of 60 Quiz ID: q5

For which situations is there no choice in terms of scheduling?

Situations 1 and 4 (running to waiting, and termination)

Situations 2 and 3 (running to ready, and waiting to ready)

Only situation 1 (running to waiting)

Only situation 4 (termination)

Question 6 of 60 Quiz ID: q6

When does nonpreemptive scheduling take place?

Only under circumstances 1 and 4

Only under circumstances 2 and 3

Under all circumstances

Never in modern systems

Question 7 of 60 Quiz ID: q7

Which type of scheduling do virtually all modern operating systems use?

Nonpreemptive scheduling

Preemptive scheduling

First-come, first-served only

Priority scheduling only

Question 8 of 60 Quiz ID: q8

What potential problem can preemptive scheduling cause?

Increased memory usage

Race conditions when data are shared

Slower CPU performance

Reduced disk space

Question 9 of 60 Quiz ID: q9

What does the dispatcher module do?

Selects which process to run next

Gives control of the CPU to the selected process

Manages memory allocation

Handles I/O operations

Question 10 of 60 Quiz ID: q10

What is dispatch latency?

Time to select the next process

Time for a process to complete

Time for dispatcher to stop one process and start another

Time for I/O operations

Question 11 of 60 Quiz ID: q11

Which scheduling criterion measures the percentage of time the CPU is busy?

Throughput

CPU utilization

Turnaround time

Response time

Question 12 of 60 Quiz ID: q12

What does throughput measure in CPU scheduling?

CPU utilization percentage

Number of processes completed per time unit

Time to execute one process

Time spent waiting in queue

Question 13 of 60 Quiz ID: q13

What is turnaround time?

Time spent waiting in ready queue

Time from request submission to first response

Amount of time to execute a particular process

Time for context switching

Question 14 of 60 Quiz ID: q14

What does waiting time specifically measure?

Total execution time

Time spent in ready queue

Time for I/O operations

Time for memory allocation

Question 15 of 60 Quiz ID: q15

What is response time in CPU scheduling?

Time to complete a process

Time from request submission until first response is produced

Time spent in waiting state

Time for CPU burst

Question 16 of 60 Quiz ID: q16

In First-Come, First-Served (FCFS) scheduling, if processes P1(24), P2(3), P3(3) arrive in order P1, P2, P3, what is the average waiting time?

Question 17 of 60 Quiz ID: q17

What is the convoy effect in FCFS scheduling?

Multiple processes running simultaneously

Short processes waiting behind long processes

Processes sharing resources

High priority processes being delayed

Question 18 of 60 Quiz ID: q18

What makes Shortest-Job-First (SJF) scheduling optimal?

It maximizes throughput

It gives minimum average waiting time

It provides best response time

It uses least memory

Question 19 of 60 Quiz ID: q19

What is the main difficulty with SJF scheduling?

High context switch overhead

Knowing the length of the next CPU request

Memory management issues

I/O coordination problems

Question 20 of 60 Quiz ID: q20

What is the preemptive version of SJF called?

Preemptive shortest job

Shortest-remaining-time-first

Priority scheduling

Round robin

Question 21 of 60 Quiz ID: q21

In the exponential averaging formula for predicting CPU burst length, what does α represent?

Previous CPU burst length

Predicted next CPU burst

Control parameter (0 ≤ α ≤ 1)

Number of processes

Question 22 of 60 Quiz ID: q22

When α = 0 in exponential averaging, what happens?

Only recent history counts

Recent history does not count

All history is weighted equally

No prediction is made

Question 23 of 60 Quiz ID: q23

When α = 1 in exponential averaging, what happens?

Historical data dominates

Only the actual last CPU burst counts

No prediction is possible

All bursts are weighted equally

Question 24 of 60 Quiz ID: q24

In Round Robin (RR) scheduling, what happens after a process uses its time quantum?

Process terminates

Process is preempted and added to end of ready queue

Process continues running

Process goes to blocked state

Question 25 of 60 Quiz ID: q25

In Round Robin scheduling, if there are n processes and time quantum is q, what is the maximum wait time for any process?

n * q

(n-1) * q

n + q

Question 26 of 60 Quiz ID: q26

What happens to Round Robin performance when time quantum q becomes very large?

Becomes more efficient

Approaches FIFO behavior

Reduces context switching

Both B and C

Question 27 of 60 Quiz ID: q27

What is the typical range for time quantum in Round Robin scheduling?

1-10 microseconds

10-100 milliseconds

1-10 seconds

100-1000 milliseconds

Question 28 of 60 Quiz ID: q28

In priority scheduling, what does a smaller integer typically represent?

Lower priority

Higher priority

Medium priority

No priority

Question 29 of 60 Quiz ID: q29

What is the main problem with priority scheduling?

High overhead

Starvation of low priority processes

Memory fragmentation

Poor response time

Question 30 of 60 Quiz ID: q30

What is the solution to starvation in priority scheduling?

Reduce time quantum

Aging - increase priority over time

Use round robin instead

Eliminate low priority processes

Question 31 of 60 Quiz ID: q31

How can SJF be viewed in terms of priority scheduling?

SJF is unrelated to priority scheduling

SJF is priority scheduling where priority is inverse of predicted next CPU burst

SJF has higher priority than priority scheduling

SJF replaces priority scheduling

Question 32 of 60 Quiz ID: q32

In Priority Scheduling with Round-Robin, how are processes with the same priority handled?

FCFS order

Random selection

Round-robin scheduling

Shortest job first

Question 33 of 60 Quiz ID: q33

What characterizes a multilevel queue scheduling system?

Single queue for all processes

Separate queues for each priority level

Dynamic queue assignment

No queue structure

Question 34 of 60 Quiz ID: q34

In multilevel queue scheduling, which queue is scheduled first?

The longest queue

The shortest queue

The highest-priority queue

Random queue selection

Question 35 of 60 Quiz ID: q35

What is the key difference between multilevel queue and multilevel feedback queue?

Number of queues

Scheduling algorithms used

Processes can move between queues in feedback queue

Priority assignments

Question 36 of 60 Quiz ID: q36

How can aging be implemented?

Using single queue

Using multilevel feedback queue

Using round robin only

Using FCFS only

Question 37 of 60 Quiz ID: q37

In the multilevel feedback queue example, what happens to a process that doesn't finish in Q0?

It terminates

It moves to Q1

It returns to Q0

It goes to blocked state

Question 38 of 60 Quiz ID: q38

What type of threads does the operating system actually schedule?

User-level threads

Kernel-level threads

Both user and kernel threads equally

Process threads only

Question 39 of 60 Quiz ID: q39

What does PCS stand for in thread scheduling?

Process Control System

Process-contention scope

Priority Control Scheduling

Processor Control System

Question 40 of 60 Quiz ID: q40

What does SCS stand for in thread scheduling?

System Control Scheduling

System-contention scope

Scheduling Control System

System CPU Scheduling

Question 41 of 60 Quiz ID: q41

Which systems use only SCS scheduling?

Many-to-many model systems

Many-to-one model systems

One-to-one model systems like Windows, Solaris, Linux

All thread systems

Question 42 of 60 Quiz ID: q42

What does PTHREAD_SCOPE_PROCESS specify?

System-contention scope scheduling

Process-contention scope scheduling

Global scheduling

No specific scheduling

Question 43 of 60 Quiz ID: q43

Which pthread scope do Linux and macOS only allow?

PTHREAD_SCOPE_PROCESS

PTHREAD_SCOPE_SYSTEM

Both scopes equally

No specific scope

Question 44 of 60 Quiz ID: q44

What does SMP stand for in multiprocessor scheduling?

Single Multiprocessor Programming

Symmetric multiprocessing

System Memory Processing

Scheduled Multiprocessor Programming

Question 45 of 60 Quiz ID: q45

What is the recent trend in processor design mentioned in the lecture?

Single core processors

Multiple processor cores on same physical chip

Separate processors for each task

Elimination of cores

Question 46 of 60 Quiz ID: q46

What does CMT stand for?

Central Memory Threading

Chip-multithreading

Central Multiprocessor Threading

Core Memory Threading

Question 47 of 60 Quiz ID: q47

On a quad-core system with 2 hardware threads per core, how many logical processors does the OS see?

Question 48 of 60 Quiz ID: q48

What is push migration in load balancing?

Idle processors pull tasks from busy processors

Periodic task pushes tasks from overloaded CPU to other CPUs

Processes migrate automatically

Memory migration between processors

Question 49 of 60 Quiz ID: q49

What is pull migration in load balancing?

Overloaded processors push tasks away

Idle processors pull waiting tasks from busy processors

Automatic task distribution

Memory balancing

Question 50 of 60 Quiz ID: q50

What is processor affinity?

Processor preference for certain tasks

Thread having preference for a processor due to cache contents

Processor speed matching

Memory allocation preference

Question 51 of 60 Quiz ID: q51

What is the difference between hard and soft real-time systems?

Hard systems are faster

Hard systems must always meet deadlines; soft systems can occasionally miss them

Soft systems are more reliable

No significant difference

Question 52 of 60 Quiz ID: q52

What characterizes safety-critical systems?

High performance requirements

Low cost requirements

Missing deadlines can cause serious loss

Simple functionality

Question 53 of 60 Quiz ID: q53

What is event latency?

Time for process to complete

Time from when event occurs to when it is serviced

Time for context switching

Time for memory allocation

Question 54 of 60 Quiz ID: q54

What is interrupt latency?

Time between interrupts

Time from arrival of interrupt to start of service routine

Time for interrupt to complete

Time for process scheduling

Question 55 of 60 Quiz ID: q55

In Rate Monotonic Scheduling, how are priorities assigned?

Based on process importance

Based on inverse of period (shorter periods = higher priority)

Based on CPU burst time

Random assignment

Question 56 of 60 Quiz ID: q56

In Earliest Deadline First (EDF) scheduling, how are priorities assigned?

Based on period length

Based on CPU requirements

Based on deadlines (earlier deadline = higher priority)

Based on arrival time

Question 57 of 60 Quiz ID: q57

In Proportional Share Scheduling, if an application receives N shares out of T total shares, what fraction of processor time does it get?

N * T

N + T

N / T

T / N

Question 58 of 60 Quiz ID: q58

What does SCHED_FIFO provide in POSIX real-time scheduling?

Round-robin scheduling with time slicing

FCFS strategy with FIFO queue, no time-slicing for equal priority

Priority-based scheduling only

Shortest job first scheduling

Question 59 of 60 Quiz ID: q59

How does SCHED_RR differ from SCHED_FIFO?

Different priority assignment

Different queue structure

SCHED_RR includes time-slicing for threads of equal priority

SCHED_RR is non-preemptive

Question 60 of 60 Quiz ID: q60

For a periodic real-time process, what is the relationship between processing time t, deadline d, and period p?

t ≤ d ≤ p

0 ≤ t ≤ d ≤ p

p ≤ d ≤ t

d ≤ t ≤ p

Quiz Summary

Review your answers before submitting

Total Questions

Answered

Remaining

00:00

Time Spent

Quiz

Quiz Summary

Confirm Submission