Discuss, Learn and be Happy דיון בשאלות

help brightness_4 brightness_7 format_textdirection_r_to_l format_textdirection_l_to_r

Signals are identified by

1
sentiment_very_satisfied
by
מיין לפי

The _______ maintains pending and blocked bit vectors in the context of each process.

1
done
by
מיין לפי

The usefulness of signals as a general inter process communication mechanism is limited because

1
done
by
מיין לפי

The usual effect of abnormal termination of a program is

1
sentiment_very_satisfied
by
מיין לפי

In most cases, if a process is sent a signal while it is executing a system call

1
done
by
מיין לפי

A process can never be sure that a signal it has sent

1
done
by
מיין לפי

In UNIX, the ______________ system call is used to send a signal.

1
done
by
מיין לפי

Consider a machine with 64 MB physical memory and a 32-bit virtual address space. If the page size is 4KB, what is the approximate size of the page table?

1
done
A page entry is used to get address of physical memory. Here we assume that single level of Paging is happening. So the resulting page table will contain entries for all the pages of the Virtual address space. Number of entries in page table = (virtual address space size)/(page size) Using above formula we can say that there will be 2^(32-12) = 2^20 entries in page table. No. of bits required to address the 64MB Physical memory = 26. So there will be 2^(26-12) = 2^14 page frames in the physical memory. And page table needs to store the address of all these 2^14 page frames. Therefore, each page table entry will contain 14 bits address of the page frame and 1 bit for valid-invalid bit. Since memory is byte addressable. So we take that each page table entry is 16 bits i.e. 2 bytes long. Size of page table = (total number of page table entries) *(size of a page table entry) = (2^20 *2) = 2MB For the clarity of the concept, please see the following figure. As per our question, here p = 20, d = 12 and f = 14.
by
מיין לפי

Consider a set of n tasks with known runtimes r1, r2, … rn to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput?

1
done
by
מיין לפי

who does not interrupt a running process?

1
done
Scheduler process doesn’t interrupt any process, it’s Job is to select the processes for following three purposes. Long-term scheduler(or job scheduler) –selects which processes should be brought into the ready queue Short-term scheduler(or CPU scheduler) –selects which process should be executed next and allocates CPU.
by
מיין לפי