Operating Systems Series 3

Physical memory is broken into fixed-sized blocks called ________.
a) frames
b) pages
c) backing store
d) None of these

The __________ is used as an index into the page table.
a) frame bit
b) page number
c) page offset
d) frame offset

The _____ table contains the base address of each page in physical memory.
a) process
b) memory
c) page
d) frame

If the size of logical address space is 2 to the power of m, and a page size is 2 to the power of n addressing units, then the high order _____ bits of a logical address designate the page number, and the ____ low order bits designate the page offset.
a) m, n
b) n, m
c) m – n, m
d) m – n, n

For every process there is a __________.
a) page table
b) copy of page table
c) pointer to page table
d) All of these

A process is selected from the ______ queue by the ________ scheduler, to be executed.
a) blocked, short term
b) wait, long term
c) ready, short term
d) ready, long term

 Turnaround time is :
a) the total waiting time for a process to finish execution
b) the total time spent in the ready queue
c) the total time spent in the running queue
d) the total time from the completion till the submission of a process

 If a page number is not found in the TLB, then it is known as a :
a) TLB miss
b) buffer miss
c) TLB hit

The percentage of times a page number is found in the TLB is known as :
a) miss ratio
b) hit ratio
c) miss percent
d) None of these

Memory protection in a paged environment is accomplished by :
a) protection algorithm with each page
b) restricted access rights to users
c) restriction on page visibility
d) protection bit with each page

 Illegal addresses are trapped using the _____ bit.
a) error
b) protection
c) valid – invalid
d) access

In a paged memory, the page hit ratio is 0.35. The required to access a page in secondary memory is equal to 100 ns. The time required to access a page in primary memory is 10 ns. The average time required to access a page is :
a) 3.0 ns
b) 68.0 ns
c) 68.5 ns
d) 78.5 ns

Round robin scheduling falls under the category of :
a) Non preemptive scheduling
b) Preemptive scheduling
c) None of these

With round robin scheduling algorithm in a time shared system,
a) using very large time slices converts it into First come First served scheduling algorithm
b) using very small time slices converts it into First come First served scheduling algorithm
c) using extremely small time slices increases performance
d) using very small time slices converts it into Shortest Job First algorithm