Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
35 Cards in this Set
- Front
- Back
|
The ____ of a process contains temporary data such as function parameters, return addresses, and local variables. A) text section B) data section C) program counter D) stack |
A) text section B) data section C) program counter D) stack |
|
|
A process control block ____. A) includes information on the process's state B) stores the address of the next instruction to be processed by a different process C) determines which process is to be executed next D) is an example of a process queue |
A) includes information on the process's state B) stores the address of the next instruction to be processed by a different process C) determines which process is to be executed next D) is an example of a process queue |
|
|
The list of processes waiting for a particular I/O device is called a(n) ____. A) standby queue B) device queue C) ready queue D) interrupt queue |
A) standby queue B) device queue C) ready queue D) interrupt queue |
|
|
The _____________ refers to the number of processes in memory. A) process count B) long-term scheduler C) degree of multiprogramming D) CPU scheduler |
A) process count B) long-term scheduler C) degree of multiprogramming D) CPU scheduler |
|
|
When a child process is created, which of the following is a possibility in terms of the execution or address space of the child process? A) The child process runs concurrently with the parent. B) The child process has a new program loaded into it. C) The child is a duplicate of the parent. D) All of the above |
A) The child process runs concurrently with the parent. B) The child process has a new program loaded into it. C) The child is a duplicate of the parent. D) All of the above |
|
|
A _________________ saves the state of the currently running process and restores the state of the next process to run. A) save-and-restore B) state switch C) context switch D) none of the above |
A) save-and-restore B) state switch C) context switch D) none of the above |
|
|
A process may transition to the Ready state by which of the following actions? A) Completion of an I/O event B) Awaiting its turn on the CPU C) Newly-admitted process D) All of the above |
A) Completion of an I/O event B) Awaiting its turn on the CPU C) Newly-admitted process D) All of the above |
|
|
Which of the following statements is true? A) Shared memory is typically faster than message passing. B) Message passing is typically faster than shared memory. C) Message passing is most useful for exchanging large amounts of data. D) Shared memory is far more common in operating systems than message passing. |
A) Shared memory is typically faster than message passing. B) Message passing is typically faster than shared memory. C) Message passing is most useful for exchanging large amounts of data. D) Shared memory is far more common in operating systems than message passing. |
|
|
Child processes inherit UNIX ordinary pipes from their parent process because: A) The pipe is part of the code and children inherit code from their parents. B) A pipe is treated as a file descriptor and child processes inherit open file descriptors from their parents. C) The STARTUPINFO structure establishes this sharing. D) All IPC facilities are shared between the parent and child processes. |
A) The pipe is part of the code and children inherit code from their parents. B) A pipe is treated as a file descriptor and child processes inherit open file descriptors from their parents. C) The STARTUPINFO structure establishes this sharing. D) All IPC facilities are shared between the parent and child processes. |
|
|
A process that has terminated, but whose parent has not yet called wait(), is known as a________ process |
A) zombie B) orphan C) terminated D) init |
|
|
True/False The difference between a program and a process is that a program is an active entity while a process is a passive entity |
False |
|
|
True/False The exec() system call creates a new process |
False |
|
|
True/False For a single-processor system, there will never be more than one process in the Running state |
True |
|
|
True/False Shared memory is a more appropriate IPC mechanism than message passing for distributed systems. |
False |
|
|
True/False Ordinary pipes in UNIX require a parent-child relationship between the communicating processes. |
True |
|
|
True/False A socket is identified by an IP address concatenated with a port number |
True |
|
|
Which of the following is true of cooperative scheduling? A) It requires a timer. B) A process keeps the CPU until it releases the CPU either by terminating or by switching to the waiting state. C) It incurs a cost associated with access to shared data. D) A process switches from the running state to the ready state when an interrupt occurs. |
A) It requires a timer. B) A process keeps the CPU until it releases the CPU either by terminating or by switching to the waiting state. C) It incurs a cost associated with access to shared data. D) A process switches from the running state to the ready state when an interrupt occurs. |
|
|
____ is the difference in time between the first execution of a program and its starting time. A) CPU utilization B) Response time C) Turnaround time D) Throughput |
A) CPU utilization B) Response time C) Turnaround time D) Throughput |
|
|
____ scheduling is approximated by predicting the next CPU burst with an exponential average of the measured lengths of previous CPU bursts. A) Multilevel queue B) RR C) FCFS D) SJF |
A) Multilevel queue B) RR C) FCFS D) SJF |
|
|
The ____ scheduling algorithm is designed especially for time-sharing systems. A) SJF B) FCFS C) RR D) Multilevel queue |
A) SJF B) FCFS C) RR D) Multilevel queue |
|
|
Which of the following scheduling algorithms must be non-preemptive? A) SJF B) RR C) FCFS D) priority algorithms |
A) SJF B) RR C) FCFS D) priority algorithms |
|
|
Which of the following is true of multilevel queue scheduling? A) Processes can move between queues. B) Each queue has its own scheduling algorithm. C) A queue cannot have absolute priority over lower-priority queues. D) It is the most general CPU-scheduling algorithm. |
A) Processes can move between queues. B) Each queue has its own scheduling algorithm. C) A queue cannot have absolute priority over lower-priority queues. D) It is the most general CPU-scheduling algorithm. |
|
|
A significant problem with priority-based scheduling algorithms is _____.
A) complexity B) starvation C) determining the length of the next CPU burst D) determining the length of the time quantum |
A) complexity
B) starvation C) determining the length of the next CPU burst D) determining the length of the time quantum |
|
|
The ______ occurs in first-come-first-served scheduling when a process with a long CPU burst occupies the CPU.
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 |
|
|
True/False In preemptive scheduling, the sections of code affected by interrupts must be guarded from simultaneous use. |
True |
|
|
True/False In RR scheduling, the time quantum should be small with respect to the context-switch time. |
False |
|
|
True/False The most complex scheduling algorithm reviewed in class was multilevel feedback-queue algorithm. |
True |
|
|
True/False Round-robin (RR) scheduling degenerates to first-come-first-served (FCFS) scheduling if the time quantum is too long. |
True |
|
|
True/False A multicore system allows two (or more) process that are in compute cycles to execute at the same time. |
True |
|
|
Turnaround Time Equation |
Completion - Arrival |
|
|
Response Time Equation |
First Exec - Arrival |
|
|
# of pages |
2^VPN |
|
|
Size of page |
2^offset |
|
|
Process Size |
2^#bits |
|
|
What are the steps for translation? |
1. Determine process size. 2. Convert to binary 3. Insert binary into slots 4. First 2 bits determine segment 5. Add base + # to get physical address |
