11786863
Questão 1
Questão
The segment of code in which the process may change common variables, update tables, write into files is known as?
Responda
-
critical section
-
mutual exclusion
-
non-critical section
-
program
Questão 2
Questão
A problem encountered in multitasking when a process is perpetually denied necessary resources is called:
Responda
-
starvation
-
inversion
-
aging
-
deadlock
Questão 3
Questão
What is the reusable resource:
Responda
-
that can be used by one process at a time and is not depleted by that use
-
that can be used by more than one process at a time
-
none of the above
-
that can be shared between various threads
Questão 4
Questão
A minimum_______ variables is/are required to be shared between processes to solve the critical section problem?
Responda
-
three
-
two
-
one
-
four
Questão 5
Questão
For non-sharable resources like a printer, mutual exclusion:
Responda
-
must exist
-
none of the above
-
may exist
-
must not exist
Questão 6
Questão
Part of a program where the shared memory is accessed and which should be executed invisibly, is called:
Responda
-
critical section
-
semaphores
-
directory
-
mutual exclusion
Questão 7
Questão
Memory partitioning algorithm that uses binary tree as a data structure is called: (не точно, примеры есть только с ним, если не правильно поменяйте)
Responda
-
First-fit algorithm
-
Buddy system
-
Next-fit algorithm
-
Best-fit algorithm
Questão 8
Questão
Current allocation of resources to processes where there is no sequence that does not result in deadlock is called: (не точно)
Responda
-
Alternative state
-
Unsafe state
-
Ambiguous state
-
Safe state
Questão 9
Questão
The context of a process in the PCB of a process DOESN’T contain:
Responda
-
memory- management information
-
the value of the CPU registers
-
the process state
-
context switch time
Questão 10
Questão
The link between two processes P and Q to send and receive messages is called:
Responda
-
communication link
-
message-passing link
-
synchronization link
-
all of the above
Questão 11
Questão
When free memory is split into many unconnected pieces we call it: (не точно)
Responda
-
compaction
-
external fragmentation
-
memory distribution
-
internal fragmentation
Questão 12
Questão
To avoid the race condition, the number of processes that may be simultaneously inside their critical section is:
Responda
-
0
-
1
-
10
-
2
Questão 13
Questão
What thread approach does Java runtime environment use?
Responda
-
Multiple processes, multiple threads per process
-
One process, one thread
-
One process, multiple threads
-
multiple processes, single thread per process
Questão 14
Questão
The primary distinction between the short-term scheduler and the long-term scheduler is:
Responda
-
The frequency of their execution
-
None of the above
-
The length of their queues
-
The type of processes they schedule
Questão 15
Questão
Paging:
Responda
-
allows multiple programs to reside in separate areas of core at the time
-
consists of those addresses that may be generated by a processor execution of a computation
-
is a method of allocating process time
-
is a method of memory allocation by which the program is subdivided into equal portions, or pages and core is subdivided into equal portions or blocks
Questão 16
Questão
Which of the replacement algorithms selects for replacement that page for which the time to the next reference is the longest?
Responda
-
optimal
-
Clock
-
LRU
-
FIFO
Questão 17
Questão
Which of the replacement algorithms treats the page frames allocated to a process as a circular buffer?
Responda
-
optimal
-
Clock
-
LRU
-
FIFO
Questão 18
Questão
Virtual memory takes advantage of: (не точно)
Responda
-
Fast CPU
-
Large secondary memory
-
Scheduling
-
Modular programming
Questão 19
Questão
The size of virtual storage is limited by…
Responda
-
the number of processors in a system
-
the actual number of main storage locations
-
the addressing scheme of the computer system and by the amount of secondary memory
-
the amount of main memory and secondary memory
Questão 20
Questão
What is trashing?
Responda
-
Guessing, based on recent history, which pieces are least likely to be used in the near future
-
Assumption that only a few pieces of a process will be needed over a short period of time
-
Condition when the system spends most of its time swapping pieces rather than executing instructions
-
Saving time by swapping unused pieces of process out of the memory
Questão 21
Questão
What is the real address?
Responda
-
physical address in cache memory
-
virtual address in main memory
-
virtual address in secondary memory
-
physical address in main memory
Quer criar seus próprios Quizzes gratuitos com a GoConqr? Saiba mais.