1.
The need for algorithms to resolve conflicts between processors is called process ____.
A) communication
B) synchronization
C) reduction
D) transformation
Points Earned: | 0.0/1.0 | |
Correct Answer(s): | B |
2.
The only reason for multiprocessing is to increase computer power.
A) True
B) False
Points Earned: | 1.0/1.0 | |
Correct Answer(s): | False |
3.
For many computational purposes, serial processing is sufficient; it’s easy to implement and fast enough for most users.
A) True
B) False
Points Earned: | 0.0/1.0 | |
Correct Answer(s): | True |
4.
Threads share the same resources as the process that created them.
A) True
B) False
Points Earned: | 1.0/1.0 | |
Correct Answer(s): | True |
5.
The classic problem of producers and consumers is one in which one process produces some data that another process consumes later.
A) True
B) False
Points Earned: | 0.0/1.0 | |
Correct Answer(s): | True |
6.
In a symmetric configuration, processor scheduling is ____.
A) centralized
B) decentralized
C) multifaceted
D) balanced
Points Earned: | 1.0/1.0 | |
Correct Answer(s): | B |
7.
Each active thread in a process shares the ____ and the resources allocated to its process.
A) processor registers
B) program counter
C) data area
D) status
Points Earned: | 1.0/1.0 | |
Correct Answer(s): | C |
8.
Multiprocessing can refer to one job using several processors to execute sets of instructions in parallel.
A) True
B) False
Points Earned: | 1.0/1.0 | |
Correct Answer(s): | True |
9.
Parallel processing is also called ____.
A) uniprocessing
B) multiprocessing
C) shared processing
D) divided processing
Points Earned: | 1.0/1.0 | |
Correct Answer(s): | B |
10.
____ proposed a solution to the readers and writers problem that did not result in starvation for readers or writers.
A) Hoare
B) Courtois
C) Heymans
D) Parnas
Points Earned: | 1.0/1.0 | |
Correct Answer(s): | A |
11.
The loosely coupled configuration features several complete computer systems, each with its own memory, I/O devices, CPU, and operating system.
A) True
B) False
Points Earned: | 1.0/1.0 | |
Correct Answer(s): | True |
12.
Most current operating systems support the implementation of threads, or ____, which have become part of numerous application packages.
A) parallel processes
B) lightweight processes
C) heavyweight processes
D) semaphores
Points Earned: | 0.0/1.0 | |
Correct Answer(s): | B |
Attempt 2
1.
The success of process synchronization hinges on the capability of the operating system to make a resource available to other processes while it is being used by one of them.
A) True
B) False
Points Earned: | 1.0/1.0 | |
Correct Answer(s): | False |
2.
Each active thread in a process shares the ____ and the resources allocated to its process.
A) processor registers
B) program counter
C) data area
D) status
Points Earned: | 1.0/1.0 | |
Correct Answer(s): | C |
3.
The loosely coupled configuration features several complete computer systems, each with its own memory, I/O devices, CPU, and operating system.
A) True
B) False
Points Earned: | 1.0/1.0 | |
Correct Answer(s): | True |
4.
The common element in all synchronization schemes is to allow a process to finish work on a critical region of the program before other processes have access to it.
A) True
B) False
Points Earned: | 1.0/1.0 | |
Correct Answer(s): | True |
5.
The classic problem of producers and consumers is one in which one process produces some data that another process consumes later.
A) True
B) False
Points Earned: | 1.0/1.0 | |
Correct Answer(s): | True |
6.
For many computational purposes, serial processing is sufficient; it’s easy to implement and fast enough for most users.
A) True
B) False
Points Earned: | 1.0/1.0 | |
Correct Answer(s): | True |
7.
Multiprocessing can refer to one job using several processors to execute sets of instructions in parallel.
A) True
B) False
Points Earned: | 1.0/1.0 | |
Correct Answer(s): | True |
8.
Automatic detection by the compiler of instructions that can be performed in parallel is called ____.
A) automatic parallelism
B) array parallelism
C) explicit parallelism
D) implicit parallelism
Points Earned: | 1.0/1.0 | |
Correct Answer(s): | D |
9.
Operations on semaphore s enforce the concept of ____, which is necessary to avoid having two operations attempt to execute at the same time.
A) mutual execution
B) mutex execution
C) signal exclusion
D) mutual exclusion
Points Earned: | 1.0/1.0 | |
Correct Answer(s): | D |
10.
The symmetric configuration is best implemented if the processors are all of the same type.
A) True
B) False
Points Earned: | 1.0/1.0 | |
Correct Answer(s): | True |
11.
A ____ of processing must be handled as a unit.
A) line
B) segment
C) critical region
D) semaphore
Points Earned: | 0.0/1.0 | |
Correct Answer(s): | C |
12.
The only reason for multiprocessing is to increase computer power.
A) True
B) False
Points Earned: | 1.0/1.0 | |
Correct Answer(s): | False |
Thanks, Do you have chapters 8-16 anywhere?
ReplyDelete