Question 1

Which of the following criteria is more important for an interactive system?

Accepted Answer

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

Question 2

Which of the following criteria is more important from the point of view of a particular process?

Accepted Answer

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

Question 3

In Solaris, what is the time quantum (in milliseconds) of an interactive thread with priority 35?

Accepted Answer

A)  25 
B)  54 
C)  80 
D)  35 
A)  25 
B)  54 
C)  80 
D)  35 C

Question 4

Shortest-remaining-time-first scheduling is the preemptive version of __________?

Accepted Answer

A)  SJF 
B)  FCFS 
C)  RR 
D)  Multilevel queue 
A)  SJF 
B)  FCFS 
C)  RR 
D)  Multilevel queue

Question 5

The most complex scheduling algorithm is the multilevel feedback-queue algorithm.

Accepted Answer

A) True 
 B)False

Question 6

Solaris and Windows assign higher-priority threads/tasks longer time quantums and lower-priority tasks shorter time quantums.

Accepted Answer

A) True 
 B)False

Question 7

Assume process P0 and P1 are the process before and after a context switch, and PCB0 and PCB1 are respectively their process control block. Which of the following time units are included inside the dispatch latency?

Accepted Answer

A)  P0 executing 
B)  save state into PCB0, and restore state from PCB1 
C)  P1 executing 
D)  all of the above 
A)  P0 executing 
B)  save state into PCB0, and restore state from PCB1 
C)  P1 executing 
D)  all of the above

Question 8

I/O-bound program typically has many short ______ and a CPU-bound program might have a few long __________.

Accepted Answer

A)  I/O burst, CPU burst 
B)  I/O burst, I/O burst 
C)  CPU burst, CPU burst 
D)  CPU burst, I/O burst 
A)  I/O burst, CPU burst 
B)  I/O burst, I/O burst 
C)  CPU burst, CPU burst 
D)  CPU burst, I/O burst

Question 9

Which of the following system architectures involves multiprocessor scheduling?

Accepted Answer

A)  multicore CPUs 
B)  multithreaded cores 
C)  NUMA systems 
D)  heterogeneous multiprocessing 
E)  all of the above 
A)  multicore CPUs 
B)  multithreaded cores 
C)  NUMA systems 
D)  heterogeneous multiprocessing 
E)  all of the above

Question 10

Windows 7 User-mode scheduling (UMS) allows applications to create and manage thread independently of the kernel

Accepted Answer

A) True 
 B)False

Question 11

Round-robin (RR) scheduling degenerates to first-come-first-served (FCFS) scheduling if the time quantum is too long.

Accepted Answer

A) True 
 B)False

Question 12

Explain the difference between response time and turnaround time. These times are both used to measure the effectiveness of scheduling schemes.

Accepted Answer

Turnaround time is the sum of the period

Question 13

In hard real-time systems, interrupt latency must be bounded.

Accepted Answer

A) True 
 B)False

Question 14

What is deterministic modeling and when is it useful in evaluating an algorithm?

Accepted Answer

Deterministic modeling takes a particula

Question 15

Which of the following scheduling algorithms gives the minimum average waiting time for a given set of processes?

Accepted Answer

A)  SJF 
B)  FCFS 
C)  RR 
D)  Multilevel queue 
A)  SJF 
B)  FCFS 
C)  RR 
D)  Multilevel queue

Question 16

Which of the following is allowed on Linux and Mac OS X systems?

Accepted Answer

A)  only PTHREAD_SCOPE_PROCESS 
B)  only PTHREAD_SCOPE_SYSTEM 
C)  Both PTHREAD_SCOPE_PROCESS and PTHREAD_SCOPE_SYSTEM 
D)  none of the above 
A)  only PTHREAD_SCOPE_PROCESS 
B)  only PTHREAD_SCOPE_SYSTEM 
C)  Both PTHREAD_SCOPE_PROCESS and PTHREAD_SCOPE_SYSTEM 
D)  none of the above

Question 17

The ______ occurs in first-come-first-served scheduling when a process with a long CPU burst occupies the CPU.

Accepted Answer

A)  dispatch latency 
B)  waiting time 
C)  convoy effect 
D)  system-contention scope 
A)  dispatch latency 
B)  waiting time 
C)  convoy effect 
D)  system-contention scope

Question 18

What is the numeric priority of a Windows thread in the BELOW_NORMAL_PRIORITY_CLASS with NORMAL relative priority?

Accepted Answer

A)  6 
B)  7 
C)  5 
D)  8 
A)  6 
B)  7 
C)  5 
D)  8

Question 19

Explain the concept of a CPU-I/O burst cycle.

Accepted Answer

The lifecycle of a process can be consid

Question 20

Which of the following scheduling algorithms gives the minimum average response time?

Accepted Answer

A)  SJF 
B)  FCFS 
C)  RR 
D)  Multilevel queue 
A)  SJF 
B)  FCFS 
C)  RR 
D)  Multilevel queue

Which of the following criteria is more important for an interactive system?

Which of the following criteria is more important from the point of view of a particular process?

In Solaris, what is the time quantum (in milliseconds) of an interactive thread with priority 35?

Shortest-remaining-time-first scheduling is the preemptive version of __________?

The most complex scheduling algorithm is the multilevel feedback-queue algorithm.

Solaris and Windows assign higher-priority threads/tasks longer time quantums and lower-priority tasks shorter time quantums.

Assume process P₀ and P₁ are the process before and after a context switch, and PCB₀ and PCB₁are respectively their process control block. Which of the following time units are included inside the dispatch latency?

I/O-bound program typically has many short and a CPU-bound program might have a few long ____.

Which of the following system architectures involves multiprocessor scheduling?

Windows 7 User-mode scheduling (UMS) allows applications to create and manage thread independently of the kernel

Round-robin (RR) scheduling degenerates to first-come-first-served (FCFS) scheduling if the time quantum is too long.

Explain the difference between response time and turnaround time. These times are both used to measure the effectiveness of scheduling schemes.

In hard real-time systems, interrupt latency must be bounded.

What is deterministic modeling and when is it useful in evaluating an algorithm?

Which of the following scheduling algorithms gives the minimum average waiting time for a given set of processes?

Which of the following is allowed on Linux and Mac OS X systems?

The ______ occurs in first-come-first-served scheduling when a process with a long CPU burst occupies the CPU.

What is the numeric priority of a Windows thread in the BELOW_NORMAL_PRIORITY_CLASS with NORMAL relative priority?

Explain the concept of a CPU-I/O burst cycle.

Which of the following scheduling algorithms gives the minimum average response time?

Introduction

Operating-System Structures

Processes

Threads Concurrency

Synchronization Tools

Synchronization Examples

Deadlocks

Main Memory

Virtual Memory

Mass-Storage Structure

Io Systems

File-System Interface

File-System Implementation

File-System Internals

Security

Protection

Filters

Exam 5: Cpu Scheduling

Which of the following criteria is more important for an interactive system?

Which of the following criteria is more important from the point of view of a particular process?

In Solaris, what is the time quantum (in milliseconds) of an interactive thread with priority 35?

Shortest-remaining-time-first scheduling is the preemptive version of __________?

The most complex scheduling algorithm is the multilevel feedback-queue algorithm.

Solaris and Windows assign higher-priority threads/tasks longer time quantums and lower-priority tasks shorter time quantums.

Assume process P0 and P1 are the process before and after a context switch, and PCB0 and PCB1 are respectively their process control block. Which of the following time units are included inside the dispatch latency?

I/O-bound program typically has many short ______ and a CPU-bound program might have a few long __________.

Which of the following system architectures involves multiprocessor scheduling?

Windows 7 User-mode scheduling (UMS) allows applications to create and manage thread independently of the kernel

Round-robin (RR) scheduling degenerates to first-come-first-served (FCFS) scheduling if the time quantum is too long.

Explain the difference between response time and turnaround time. These times are both used to measure the effectiveness of scheduling schemes.

In hard real-time systems, interrupt latency must be bounded.

What is deterministic modeling and when is it useful in evaluating an algorithm?

Which of the following scheduling algorithms gives the minimum average waiting time for a given set of processes?

Which of the following is allowed on Linux and Mac OS X systems?

The ______ occurs in first-come-first-served scheduling when a process with a long CPU burst occupies the CPU.

What is the numeric priority of a Windows thread in the BELOW_NORMAL_PRIORITY_CLASS with NORMAL relative priority?

Explain the concept of a CPU-I/O burst cycle.

Which of the following scheduling algorithms gives the minimum average response time?

Introduction

Operating-System Structures

Processes

Threads Concurrency

Synchronization Tools

Synchronization Examples

Deadlocks

Main Memory

Virtual Memory

Mass-Storage Structure

Io Systems

File-System Interface

File-System Implementation

File-System Internals

Security

Protection

Filters

Assume process P₀ and P₁ are the process before and after a context switch, and PCB₀ and PCB₁are respectively their process control block. Which of the following time units are included inside the dispatch latency?

I/O-bound program typically has many short and a CPU-bound program might have a few long ____.