1.

The main memory accommodates ____________

a) operating system
b) cpu
c) user processes
d) all of the mentioned
View Answer
Answer: a
Explanation: None.

2. What is the operating system?

a) in the low memory
b) in the high memory
c) either low or high memory (depending on the location of interrupt vector)
d) none of the mentioned
View Answer
Answer: c
Explanation: None.

3. In contiguous memory allocation ____________

a) each process is contained in a single contiguous section of memory
b) all processes are contained in a single contiguous section of memory
c) the memory space is contiguous
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

4. The relocation register helps in ____________

a) providing more address space to processes
b) a different address space to processes
c) to protect the address spaces of processes
d) none of the mentioned
View Answer
Answer: c
Explanation: None.

5. With relocation and limit registers, each logical address must be _______ the limit
register.
a) less than
b) equal to
c) greater than
d) none of the mentioned
View Answer
Answer: a
Explanation: None.
6. The operating system and the other processes are protected from being modified
by an already running process because ____________
a) they are in different memory spaces
b) they are in different logical addresses
c) they have a protection algorithm
d) every address generated by the CPU is being checked against the relocation and
limit registers
View Answer
Answer: d
Explanation: None.

7. Transient operating system code is code that ____________

a) is not easily accessible
b) comes and goes as needed
c) stays in the memory always
d) never enters the memory space
View Answer
Answer: b
Explanation: None.

8. Using transient code, _______ the size of the operating system during program
execution.
a) increases
b) decreases
c) changes
d) maintains
View Answer
Answer: c
Explanation: None.

9. When memory is divided into several fixed sized partitions, each partition may
contain ________
a) exactly one process
b) at least one process
c) multiple processes at once
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

10. In fixed size partition, the degree of multiprogramming is bounded by

___________
a) the number of partitions
b) the CPU utilization
c) the memory size
d) all of the mentioned
View Answer
Answer: a
Explanation: None

11. The first fit, best fit and worst fit are strategies to select a ______
a) process from a queue to put in memory
b) processor to run the next process
c) free hole from a set of available holes
d) all of the mentioned
View Answer
Answer: c
Explanation: None.

1. In internal fragmentation, memory is internal to a partition and ____________

a) is being used
b) is not being used
c) is always used
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

2. A solution to the problem of external fragmentation is ____________

a) compaction
b) larger memory space
c) smaller memory space
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

3. Another solution to the problem of external fragmentation problem is to

____________
a) permit the logical address space of a process to be noncontiguous
b) permit smaller processes to be allocated memory at last
c) permit larger processes to be allocated memory at last
d) all of the mentioned
View Answer
Answer: a
Explanation: None.

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

a) cannot be done
b) must be done
c) must not be done
d) can be done
View Answer
Answer: a
Explanation: None.

5. 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 ____________
a) the cost incurred
b) the memory used
c) the CPU used
d) all of the mentioned
View Answer
Answer: a
Explanation: None.

6. __________ is generally faster than _________ and _________

a) first fit, best fit, worst fit
b) best fit, first fit, worst fit
c) worst fit, best fit, first fit
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

7. External fragmentation exists when?

a) enough total memory exists to satisfy a request but it is not contiguous
b) the total memory is insufficient to satisfy a request
c) a request cannot be satisfied even when the total memory is free
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

8. External fragmentation will not occur when?

a) first fit is used
b) best fit is used
c) worst fit is used
d) no matter which algorithm is used, it will always occur
View Answer
Answer: d
Explanation: None.

9. Sometimes the overhead of keeping track of a hole might be ____________

a) larger than the memory
b) larger than the hole itself
c) very small
d) all of the mentioned
View Answer
Answer: b
Explanation: None.

10. When the memory allocated to a process is slightly larger than the process, then
____________
a) internal fragmentation occurs
b) external fragmentation occurs
c) both internal and external fragmentation occurs
d) neither internal nor external fragmentation occurs
View Answer
Answer: a
Explanation: None.

“Memory Management – Paging”.

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

a) frames
b) pages
c) backing store
d) none of the mentioned
View Answer
Answer: a
Explanation: None.

2. Logical memory is broken into blocks of the same size called _________
a) frames
b) pages
c) backing store
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

3. Every address generated by the CPU is divided into two parts. They are
____________
a) frame bit & page number
b) page number & page offset
c) page offset & frame bit
d) frame offset & page offset
View Answer
Answer: b
Explanation: None.

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

a) frame bit
b) page number
c) page offset
d) frame offset
View Answer
Answer: b
Explanation: None.

5. The _____ table contains the base address of each page in physical memory.
a) process
b) memory
c) page
d) frame
View Answer
Answer: c
Explanation: None.

6. The size of a page is typically ____________

a) varied
b) power of 2
c) power of 4
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

7. 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
View Answer
Answer: d
Explanation: None.

8. With paging there is no ________ fragmentation.

a) internal
b) external
c) either type of
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

9. The operating system maintains a ______ table that keeps track of how many
frames have been allocated, how many are there, and how many are available.
a) page
b) mapping
c) frame
d) memory
View Answer
Answer: c
Explanation: None.

10. Paging increases the ______ time.

a) waiting
b) execution
c) context – switch
d) all of the mentioned
View Answer
Answer: c
Explanation: None.

11. Smaller page tables are implemented as a set of _______

a) queues
b) stacks
c) counters
d) registers
View Answer
Answer: d
Explanation: None.

12. The page table registers should be built with _______

a) very low speed logic
b) very high speed logic
c) a large memory space
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

13. For larger page tables, they are kept in main memory and a __________ points to
the page table.
a) page table base register
b) page table base pointer
c) page table register pointer
d) page table base
View Answer
Answer: a
Explanation: None.

14. For every process there is a __________

a) page table
b) copy of page table
c) pointer to page table
d) all of the mentioned
View Answer
Answer: a
Explanation: None.

15. Time taken in memory access through PTBR is ____________

a) extended by a factor of 3
b) extended by a factor of 2
c) slowed by a factor of 3
d) slowed by a factor of 2
View Answer
Answer: d
Explanation: None.

1. Each entry in a translation lookaside buffer (TLB) consists of ____________

a) key
b) value
c) bit value
d) constant
View Answer
Answer: a
Explanation: None.

2. 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
d) All of the mentioned
View Answer
Answer: a
Explanation: None.

3. An ______ uniquely identifies processes and is used to provide address space

protection for that process.
a) address space locator
b) address space identifier
c) address process identifier
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

4. 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 the mentioned
View Answer
Answer: b
Explanation: None.

5. 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
View Answer
Answer: d
Explanation: None.

6. When the valid – invalid bit is set to valid, it means that the associated page
____________
a) is in the TLB
b) has data in it
c) is in the process’s logical address space
d) is the system’s physical address space
View Answer
Answer: c
Explanation: None.

7. Illegal addresses are trapped using the _____ bit.

a) error
b) protection
c) valid – invalid
d) access
View Answer
Answer: c
Explanation: None.
8. When there is a large logical address space, the best way of paging would be
____________
a) not to page
b) a two level paging algorithm
c) the page table itself
d) all of the mentioned
View Answer
Answer: b
Explanation: None.

9. 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
View Answer
Answer: c
Explanation: None.

10. To obtain better memory utilization, dynamic loading is used. With dynamic
loading, a routine is not loaded until it is called. For implementing dynamic loading
____________
a) special support from hardware is required
b) special support from operating system is essential
c) special support from both hardware and operating system is essential
d) user programs can implement dynamic loading without any special support from
hardware or operating system
View Answer
Answer: d
Explanation: None.

11. In paged memory systems, if the page size is increased, then the internal
fragmentation generally ____________
a) becomes less
b) becomes more
c) remains constant
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

1. Each entry in a translation lookaside buffer (TLB) consists of ____________

a) key
b) value
c) bit value
d) constant
View Answer
Answer: a
Explanation: None.

2. 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
d) All of the mentioned
View Answer
Answer: a
Explanation: None.

3. An ______ uniquely identifies processes and is used to provide address space

protection for that process.
a) address space locator
b) address space identifier
c) address process identifier
d) none of the mentioned
View Answer
Answer: b
Explanation: None.

4. 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 the mentioned
View Answer
Answer: b
Explanation: None.

5. 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
View Answer
Answer: d
Explanation: None.

6. When the valid – invalid bit is set to valid, it means that the associated page
____________
a) is in the TLB
b) has data in it
c) is in the process’s logical address space
d) is the system’s physical address space
View Answer
Answer: c
Explanation: None.

7. Illegal addresses are trapped using the _____ bit.

a) error
b) protection
c) valid – invalid
d) access
View Answer
Answer: c
Explanation: None.

8. When there is a large logical address space, the best way of paging would be
____________
a) not to page
b) a two level paging algorithm
c) the page table itself
d) all of the mentioned
View Answer
Answer: b
Explanation: None.

9. 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
View Answer
Answer: c
Explanation: None.

10. To obtain better memory utilization, dynamic loading is used. With dynamic
loading, a routine is not loaded until it is called. For implementing dynamic loading
____________
a) special support from hardware is required
b) special support from operating system is essential
c) special support from both hardware and operating system is essential
d) user programs can implement dynamic loading without any special support from
hardware or operating system
View Answer
Answer: d
Explanation: None.

11. In paged memory systems, if the page size is increased, then the internal
fragmentation generally ____________
a) becomes less
b) becomes more
c) remains constant
d) none of the mentioned
View Answer
Answer: b
Explanation: None.