Test
Operating Systems Part 2
Este test tiene tiempo límite, así que se abre en el reproductor de siempre.
Preguntas del test (18)
1Processes executing concurrently in the operating system may be either [blank_start]independent[blank_end] or [blank_start]concurrent[blank_end] processes
- Aindependent
- Bconcurrent
2[blank_start]Independent[blank_end] - It can not affect or be affected by any other process in the system. It does not share data with other processes
- AIndependent
3[blank_start]cooperating[blank_end] - It can affect and be affected by other processes executing in the system. Any process that shares data with another is a cooperating process
- Acooperating
4There are several reasons to provide an environment that allows process cooperation
- AInformation sharing
- Bcomputation speedup
- Cmodularity
- Dconnivence
- Ecost
5cooperating processes require an [blank_start]interprocess communication (IPC)[blank_end] mechanism, which allows them to exchange data and information
- Ainterprocess communication (IPC)
- Bprocess communication (PC)
- Cindependent communication (IPC)
6message passing is useful for smaller amounts of data, where no conflict need to be avoided
- AVerdadero
- BFalso
7a [blank_start]producer[blank_end] process produces information that is consumed by a [blank_start]consumer[blank_end] process
- Aproducer
- Bconsumer
8how do we handle producer/consumer processes?
- Ashared memory
- Bmessage passing
9[blank_start]unbounded buffer[blank_end] - Places no practical limit on the size of the buffer. The consumer may need to wait for new items, but producers can always produce new items
[blank_start]bounded buffer[blank_end] - Assumes a buffer of a fixed size, in this case, the [blank_start]consumer[blank_end] must wait if the buffer is empty, and the [blank_start]producer[blank_end] must wait if the buffer is full- Aunbounded buffer
- Bbounded buffer
- Cconsumer
- Dproducer
10A shared buffer is implemented as a circular array with two logical pointers, in and out. In points to the next free position, and out points to the first full position in the buffer. The buffer is empty if in == out, and the buffer is full when [blank_start]((in + 1) % BUFFER_SIZE == out[blank_end].
- A((in + 1) % BUFFER_SIZE == out
- Bin == out
11A shared buffer is implemented as a circular array with two logical pointers, in and out. In points to the next free position, and out points to the first full position in the buffer. The buffer is empty if [blank_start]in == out[blank_end], and the buffer is full when [blank_start]((in + 1) % BUFFER_SIZE) == out[blank_end].
- Ain == out
- B((in + 1) % BUFFER_SIZE) == out
- C((in + 1) % BUFFER_SIZE) == out
- Din == out
12We can make a communication link from message passing several different ways
- ADirect or indirect communication
- BSynchronous or Asynchronous communication
- CAutomatic or explicit buffering
13under [blank_start]direct[blank_end] communication, each process that wants to communicate must explicitly name the recipient or sender of the communication
- Adirect
14With [blank_start]indirect[blank_end] communication, the messages are sent to mailboxes or ports. A mailbox can be viewed as an object where messages can be placed by processes and from which messages can be removed.
- Aindirect
15Select which is not as benefit of multithreading
- Aresponsiveness
- Bresource sharing
- Ceconomy
- Dscalability
- Eportability
16[blank_start]many-to-one[blank_end] model: maps many user-level threads to one kernel thread
- Amany-to-one
- Bone-to-one
- Cmany-to-many
17[blank_start]one-to-one[blank_end] model: maps each user thread to a kernel thread
- Aone-to-one
18[blank_start]many-to-many[blank_end] model: multiplexes many user-level threads to a smaller or equal number of kernel threads
- Amany-to-many
Información
- Descripción
- Test sobre Operating Systems Part 2, creado por Matthew Warner el 03/10/2015.
- Autor
- Matthew Warner
- Idioma
- English
- Visitas
- 2
- Valoración
- Aún sin valoraciones Valora este test