Process Management Post Quiz Flashcards
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
D- STACK
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
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
C- CONTEXT SWITCH
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
D- ALL OF THE ABOVE
A blocking send() and blocking receive() is known as a(n) _________________.
a. synchronized message
b. rendezvous
c. blocked message
d. asynchronous message
B- RENDEZVOUS
A(n) ______________ allows several unrelated processes to use the pipe for communication.
a. named pipe
b. anonymous pipe
c. LIFO
d. ordinary pipe
A- NAMED PIPE
Imagine that a host with IP address 150.55.66.77 wishes to download a file from the web server at IP address 202.28.15.123. Select a valid socket pair for a connection between this pair of hosts
a. 150.55.66.77:80 and 202.28.15.123:80
b. 150.55.66.77:150 and 202.28.15.123:80
c. 150.55.66.77:2000 and 202.28.15.123:80
d. 150.55.66.77:80 and 202.28.15.123:3500
C
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.
B- A PIPE IS TREATED AS A FILE DESCRIPTOR AND CHILD PROCESSES INHERIT OPEN FILE DESCRIPTORS FROM THEIR PARENTS
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
A- ZOMBIE
The _______ process is assigned as the parent to orphan processes.
a. zombie
b. init
c. main
d. renderer
B- INIT
____ is a thread library for Solaris that maps many user-level threads to one kernel thread.
a. Pthreads
b. Green threads
c. Sthreads
d. Java threads
B- GREEN THREADS
Pthreads refers to ____.
a. the POSIX standard
b. an implementation for thread behavior
c. a specification for thread behavior
d. an API for process creation and synchronization
C- A SPECIFICATION FOR THREAD BEHAVIOR (however, Pthreads also refers to the POSIX standard. Looking for the detailed answer, I guess.)
Cancellation points are associated with ____ cancellation.
a. asynchronous
b. deferred
c. synchronous
d. non-deferred
B- DEFERRED
Signals can be emulated in windows through ____.
a. asynchronous procedure calls
b. local procedure calls
c. remote procedure calls
d. none of the above
A- ASYNCHRONOUS PROCEDURE CALLS
_____ is not considered a challenge when designing applications for multicore systems.
a. Deciding which activities can be run in parallel
b. Ensuring there is a sufficient number of cores
c. Determining if data can be separated so that it is accessed on separate cores
d. Identifying data dependencies between tasks
B- ENSURING THERE IS A SUFFICIENT NUMBER OF CORES
A ____ provides an API for creating and managing threads.
a. set of system calls
b. multicore system
c. thread library
d. multithreading model
C- THREAD LIBRARY
The most common technique for writing multithreaded Java programs is _____.
a. extending the Thread class and overriding the run() method
b. implementing the Runnable interface and defining its run() method
c. designing your own Thread class
d. using the CreateThread() function
B- IMPLEMENTING THE Runnable INTERFACE AND DEFINING ITS run() METHOD
_________ involves distributing tasks across multiple computing cores.
a. Concurrency
b. Task parallelism
c. Data parallelism
d. Parallelism
B- TASK PARALLELISM
Grand Central Dispatch handles blocks by ____.
a. placing them on a dispatch queue
b. creating a new thread
c. placing them on a dispatch stack
d. constructing a parallel region
A- PLACING THEM ON A DISPATCH QUEUE
An instruction that executes atomically ____.
a. must consist of only one machine instruction
b. executes as a single, uninterruptible unit
c. cannot be used to solve the critical section problem
d. all of the above
B- EXECUTES AS A SINGLE, UNINTERRUPTIBLE UNIT
In Peterson’s solution, the ____ variable indicates if a process is ready to enter its critical section.
a. turn
b. lock
c. flag[i]
d. turn[i]
C- flag[i]
What is the correct order of operations for protecting a critical section using mutex locks?
a. release() followed by acquire()
b. acquire() followed by release()
c. wait() followed by signal()
d. signal() followed by wait()
B- acquire() FOLLOWED BY release()
Assume an adaptive mutex is used for accessing shared data on a Solaris system with multiprocessing capabilities. Which of the following statements is not true?
a. A waiting thread may spin while waiting for the lock to become available.
b. A waiting thread may sleep while waiting for the lock to become available.
c. The adaptive mutex is only used to protect short segments of code.
d. Condition variables and semaphores are never used in place of an adaptive mutex.
D- CONDITION VARIABLES AND SEMAPHORES ARE NEVER USED IN PLACE OF AN ADAPTIVE MUTEX.
Which of the following statements is true?
Select one:
a. A counting semaphore can never be used as a binary semaphore.
b. A binary semaphore can never be used as a counting semaphore.
c. Spinlocks can be used to prevent busy waiting in the implementation of semaphores.
d. Counting semaphores can be used to control access to a resource with a finite number of instances.
D- COUNTING SEMAPHORES CAN BE USED TO CONTROL ACCESS TO A RESOURCE WITH A FINITE NUMBER OF INSTANCES
