Midterm Questions

Question 1

The ___ of a process contains temporary data such as function parameters, return addresses, and local variables

Answer 1

Stack

Question 2

Which of the following component of program state are shared are shared across threads in a multi-threaded process?

register variables, local variables, global variables, stack memory

Answer 2

global variables

Question 3

The list of a process waiting for an I/O device

Answer 3

device queue

Question 4

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?

The child process runs concurrently with parent
The child process has a new program loaded into it
The child is a duplicate of the parent
All of the above

Answer 4

All of the above

Question 5

When a process creates a new process using the fork() operation, what state is shared between parent process and child process?

Answer 5

shared memory segments

Question 6

What is most often used by operating systems to handle deadlock?

Answer 6

pretend that deadlocks never occur (ostrich approach)

Question 7

The number of processes that are completed per time unit

Answer 7

Throughput

Question 8

___ scheduling is approximated by predicting the next CPU burst with an exponential average of the measured lengths of the previous CPU burst

Answer 8

SJF

Question 9

Presents a set of programmer-defined operations that are provided mutual exclusion within it

Answer 9

monitor

Question 10

The ___ multi-threading model multiplexes many user-level threads to a smaller or equal number of kernel threads

Answer 10

many-to-many model

Question 11

Which of the following would be an acceptable signal handling scheme for a multi-threaded program?

Deliver the signal to the thread to which the signal applies
Deliver the signal to every thread in the process
Deliver the signal to only certain threads in the process
All of the above

Answer 11

All of the above

Question 12

Which of the following is not a necessary condition for deadlock?

Circular Wait
Starvation
Mutual Exclusion
Hold and wait

Answer 12

Starvation

Question 13

In a system where round robin is used for CPU scheduling, what happens when a process can’t finish its computation during its current time quantum?

Answer 13

The process state is changed from running to ready

Question 14

A process control block ___

Answer 14

includes information on a process’s state

Question 15

Which of the following is true?

A safe state is a deadlocked state
A safe state may lead to a deadlocked state
An unsafe state is always a deadlocked state
An unsafe state may lead to a deadlocked state

Answer 15

An unsafe state may lead to a deadlocked state

Question 16

Which of the following scheduling algorithms could result in starvation?

FCFS, SJF, Round Robin

Answer 16

SJF

Question 17

Fill in the blanks using scheduling algorithms (FCFS, SJF, Round Robin, Priority based)

In multi-level feedback queue, Q0 usually uses ___, Q1 uses ___, and Q3 uses ___.

Answer 17

Round Robin, Round Robin, FCFS

Question 18

T/F:

A thread is composed of a thread ID, program counter, register set, and heap

Answer 18

F

Question 19

T/F:

While a process is blocked on a semaphore’s queue, it is engaged in busy waiting

Answer 19

F

Question 20

T/F:
Starvation is a situation in which a process is denied access to a resource because of the competitive activity of other, possibly unrelated, processes

Answer 20

T

Question 21

T/F:
Deadlock is a situation in which two or more processes (or threads) are waiting for an event that will occur in the future

Answer 21

F

Question 22

T/F:

Spinlock has a better performance than semaphore even on single CPU and single core

Answer 22

F

Question 23

T/F:
Assume that there are three queues in the multilevel feedback queue, only there are no jobs in the first two queues, the jobs in the third queue will be executed

Answer 23

T

Question 24

T/F:

Assume x is a conditional variable, x.wait() will invoke busy waiting

Answer 24

F

Question 25

T/F:

Assume x is a conditional variable, the process woken up by x.signal() will obtain a lock automatically

Answer 25

F