Operating System MCQ and Answers – Paging

These Operating System MCQ and Answers – Paging are asked in various examinations including BCA, MCA, GATE, and other tests. The questions based on the below Operating System MCQ and Answers – Paging test your basic knowledge of MCQs on the topic of Operating Systems and the level of comprehension and grasp that you hold.

Operating System MCQ and Answers – Paging

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

a) frame bit

b) page number

c) page offset

d) frame offset

Answer: b

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

a) process

b) memory

c) page

d) frame

Answer: c

3. The size of a page is typically ____________

a) varied

b) power of 2

c) power of 4

d) none of the mentioned

Answer: b

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

Answer: d

5. With paging there is no ________ fragmentation.

a) internal

b) external

c) either type of

d) none of the mentioned

Answer: b

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

Answer: c

7. Paging increases the ______ time.

a) waiting

b) execution

c) context – switch

d) all of the mentioned

Answer: c

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

a) queues

b) stacks

c) counters

d) registers

Answer: d

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

Answer: b

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

Answer: a

11. For every process there is a __________

a) page table

b) copy of page table

c) pointer to page table

d) all of the mentioned

Answer: a

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

Answer: d

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

a) key

b) value

c) bit value

d) constant

Answer: a

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

Answer: a

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

Answer: b

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

Answer: b

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

Answer: d

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

Answer: c

19. Illegal addresses are trapped using the _____ bit.

a) error

b) protection

c) valid – invalid

d) access

Answer: c

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

Answer: b

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

Answer: c

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

Answer: d

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

Answer: b

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

a) frames

b) pages

c) backing store

d) none of the mentioned

Answer: a

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

a) frames

b) pages

c) backing store

d) none of the mentioned

Answer: b

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

Answer: b

Comments