OS The Linux System

proportional allocation algorithm

equal allocation algorithm

split allocation algorithm

none of the mentioned

the page is clean

the page has been modified since it was read in from the disk

the page is dirty

the page has been modified since it was read in from the disk & page is dirty

sig

send

kill

sigsend

time it was brought into memory

the time of that page’s last use

page after and before it

all of the mentioned

increases the swap time

decreases the swap time

decreases the swap time & amount of physical memory needed

increases the amount of physical memory needed

then the process crashes

the memory overflows

the system crashes

the operating system selects a process to suspend

greater than the time required to create a new process

less than the time required to create a new process

equal to the time required to create a new process

none of the mentioned

other threads in the another process can also read from that file

other threads in the same process can also read from that file

any other thread can not read from that file

all of the mentioned

continuing to run even if a part of it is blocked

waiting for one part to finish before the other begins

asking the user to decide the order of multithreading

none of the mentioned

Counters

RAM & Registers

Stack & Counters

Registers