Q. In fixed sized partition, the degree of multi programming is bounded by ___________

View solution

Q. The first fit, best fit and worst fit are strategies to select a ______

View solution

Q. In internal fragmentation, memory is internal to a partition and :

View solution

Q. A solution to the problem of external fragmentation is :

View solution

Q. Another solution to the problem of external fragmentation problem is to :

View solution

Q. If relocation is static and is done at assembly or load time, compaction _________

View solution

Q. The disadvantage of moving all process to one end of memory and all holes to the other direction, producing one large hole of available memory is :

View solution

Q. __________ is generally faster than _________ and _________

View solution

Q. External fragmentation exists when :

View solution

Q. External fragmentation will not occur when :

View solution

Q. Sometimes the overhead of keeping track of a hole might be :

View solution

Q. When the memory allocated to a process is slightly larger than the process, then :

View solution

Q. Physical memory is broken into fixed-sized blocks called ________

View solution

Q. Logical memory is broken into blocks of the same size called _________

View solution

Q. Every address generated by the CPU is divided into two parts :

View solution

Q. The __________ is used as an index into the page table.

View solution

Q. The _____ table contains the base address of each page in physical memory.

View solution

Q. The size of a page is typically :

View solution

Q. 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.

View solution

Q. With paging there is no ________ fragmentation.

View solution