The segment of code in which the process may change common variables, update tables, write into files is known as?
critical section
mutual exclusion
non-critical section
program
A problem encountered in multitasking when a process is perpetually denied necessary resources is called:
starvation
inversion
aging
deadlock
What is the reusable resource:
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
A minimum_______ variables is/are required to be shared between processes to solve the critical section problem?
three
two
one
four
For non-sharable resources like a printer, mutual exclusion:
must exist
may exist
must not exist
Part of a program where the shared memory is accessed and which should be executed invisibly, is called:
semaphores
directory
Memory partitioning algorithm that uses binary tree as a data structure is called: (не точно, примеры есть только с ним, если не правильно поменяйте)
First-fit algorithm
Buddy system
Next-fit algorithm
Best-fit algorithm
Current allocation of resources to processes where there is no sequence that does not result in deadlock is called: (не точно)
Alternative state
Unsafe state
Ambiguous state
Safe state
The context of a process in the PCB of a process DOESN’T contain:
memory- management information
the value of the CPU registers
the process state
context switch time
The link between two processes P and Q to send and receive messages is called:
communication link
message-passing link
synchronization link
all of the above
When free memory is split into many unconnected pieces we call it: (не точно)
compaction
external fragmentation
memory distribution
internal fragmentation
To avoid the race condition, the number of processes that may be simultaneously inside their critical section is:
0
1
10
2
What thread approach does Java runtime environment use?
Multiple processes, multiple threads per process
One process, one thread
One process, multiple threads
multiple processes, single thread per process
The primary distinction between the short-term scheduler and the long-term scheduler is:
The frequency of their execution
None of the above
The length of their queues
The type of processes they schedule
Paging:
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
Which of the replacement algorithms selects for replacement that page for which the time to the next reference is the longest?
optimal
Clock
LRU
FIFO
Which of the replacement algorithms treats the page frames allocated to a process as a circular buffer?
Virtual memory takes advantage of: (не точно)
Fast CPU
Large secondary memory
Scheduling
Modular programming
The size of virtual storage is limited by…
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
What is trashing?
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
What is the real address?
physical address in cache memory
virtual address in main memory
virtual address in secondary memory
physical address in main memory
