Section 1
Preview this deck
A system in an unsafe state will ultimately deadlock.
Front
| 5 | 0 | ||
| 4 | 0 | ||
| 3 | 0 | ||
| 2 | 0 | ||
| 1 | 0 |
Active users
1
All-time users
1
Favorites
0
Last updated
1 year ago
Date created
Mar 1, 2020
Cards (68)
Section 1
(50 cards)
A system in an unsafe state will ultimately deadlock.
False
Multiprogramming increases CPU utilization.
True
Every system call requires a change from user mode to kernel mode.
True
Each thread of a process has a separate stack and PC value.
True
Is busy waiting desirable or undesirable?
Undesirable
Each thread has its own register set and stack.
True
Multiprogramming cannot increase CPU utilization in a single processor system.
False
Global variables are shared between the threads of a process.
True
FCFS turn around time
burst time + waiting time
Issuing an I/O request may cause a process to move from running state to waiting state.
True
All processes in UNIX first translate to a zombie process upon termination.
True
A system call is triggered by hardware.
False
It is possible to create a thread library without any kernel-level support.
True
FIFO (first in, first out)
The oldest or 1st entry in the queue is processed first
If a resource allocation graph has a cycle, then the system must be in a deadlock state.
False
FCFS waiting time
start time - arrival time
The exec() system call creates a new process.
False
Every child process has a separate address space than its parent
False
I/O devices and the CPU can execute concurrently.
True
Application programmers typically use an API rather than directly invoking system calls.
True
Issuing an I/O request may cause a process to move from ready state to waiting state.
False
For a single-processor system, there will never be more than one process in the Running state.
True
Is bounded waiting desirable or undesirable?
Desirable
Round-robin (RR) scheduling degenerates to first-come-first-served (FCFS) scheduling if the time quantum is too long.
True
Semaphore is a synchronization tool that might cause busy waiting.
True
For a single-processor system, there will never be more than one process in the Ready state.
False
A trap is another name for software interrupt.
True
Incorrect use of semaphores might cause deadlocks.
True
Peterson's solution for mutual exclusion fulfills the bounded waiting property.
True
The operating system kernel consists of all system and application programs in a computer.
False
Each thread has its own global variables.
False
A trap is another name for hardware interrupt.
False
The value of a counting semaphore can range only between 0 and 1.
False
Each thread of a process has a separate address space
False
First-Come First-Served (FCFS) and Shortest Job First (SJF) algorithms are both preemptive CPU scheduling algorithms.
Fasle
Round Robin (RR) is a non-preemptive CPU scheduling algorithm.
False
Timer interrupt may cause the currently running process to move from running state to ready state.
True
System calls can be run in either user mode or kernel mode.
False
A batch system should have a preemptive scheduler.
False
System calls are part of the kernel code.
False
SJF scheduling provides the optimal average turnaround time if all processes arrive at the same time to a batch system.
True
Round Robin (RR) is a preemptive CPU scheduling algorithm.
True
Bounded Waiting
There exists a bound, or limit, on the number of times other processes are allowed to enter their critical sections after a process has made request to enter its critical section and before that request is granted.
The difference between a program and a process is that a program is an active entity while a process is a passive entity.
False
In shared memory, kernel is not involved during the communication process.
True
Completion of an I/O request may cause a process to move from waiting state to ready state.
True
Busy waiting
Busy waiting is a technique in which a process repeatedly checks to see if a condition is true, such as whether keyboard input or a lock is available.
How does Round Robin work?
lets each process run for the quantum amount then it gets preempted and added to the back of the ready queue.
In message queues, kernel is not involved during the communication process.
False
Interrupts may be triggered by either hardware or software.
True
Section 2
(18 cards)