The address sequence generated by tracing a particular program executing in a puredem and paging system with 100 records per page,with a free main memory frame is recorded as follows. What is the number of page faults?0100, 0200, 0430, 0499, 0510, 0530, 0560, 0120, 0220, 0240,0260, 0320, 0370.
-
Solution
When it tries to access 0100, it results in a page fault as the memory is empty right now. So,it loads the second page(which has the addresses 100-199).
Trying to access 200 will result in a page fault, as it is not in memory right now. So the third page with the addresses from 200 to 299 will replace the second page in memory.Trying to access 430 will result in another page fault.Proceeding this way,we find trying to access the addresses 0510, 0120, 0220, 0320 will all result in page faults. So,altogether 7 page faults.
Individual stages of data path have the following latencies
What is clock cycle time of a pipelined processor?
-
Solution
For the pipelined processor, we find the stage with the highest latency.So in the given question, MEM is the state with the highest latency.Hence, option (a) is correct i.e., 500 ps.
Access to moving head disks requires three periods of delay before information is brought into memory.The response that correctly lists the three time delays for the physical access of data in the order of the relative speed from the slowest to the fastest is
A state is safe if the system can allocate resources to each process (up to its maximum) in some order and still avoid dead lock. Then
A non-relocatable program is one which
What is the main advantage of magnetic core memory over semiconductor RAM memory?
Find the value of z in the given circuit?
-
Solution
(101)2+ (220)3+ (4567)8+ (9329)10+ (786)9 is
-
Solution
What is the maximum counting speed of a 4-bit binary counter which is composed of flip-flops with a propagation delay of 25 ns?
A full-adder is a logic circuit which can add two single order bits plus a carry-in from a previous adder. Its incomplete truth table is given in the table below. The missing entry in the outputs for SUM and CARRY out are