MCQs of Memory Management (Operating System - 3140702)

Operating System (3140702) MCQs

MCQs of Memory Management

Showing 51 to 60 out of 85 Questions

51.

Which type of memory is fastest?

(a)	RAM
(b)	Cache memory
(c)	ROM
(d)	Register

52.

__________starts from the starting location of the memory and first available hole that is large enough to hold the process is selected for allocation.

(a)	First fit
(b)	Best fit
(c)	Next fit
(d)	Worst fit

53.

______________ memory allocation method avoids memory allocation always from the beginning of the memory space.

(a)	First fit
(b)	Best fit
(c)	Next fit
(d)	Worst fit

54.

In which memory allocation method entire memory is searched and the smallest hole, which is large enough to hold the process, is selected for allocation.

(a)	First fit
(b)	Best fit
(c)	Next fit
(d)	Worst fit

55.

Memory loss is less in ___________ memory allocation method

(a)	first fit
(b)	best fit
(c)	next fit
(d)	worst fit

56.

In which memory allocation method entire memory is searched and the largest hole, which is largest enough to hold the process, is selected for allocation.

(a)	First fit
(b)	Best fit
(c)	Next fit
(d)	Worst fit

57.

The set of pages that a process is currently using is known as _________

(a)	working set
(b)	current set
(c)	using set
(d)	None of the mentioned

58.

Full form of TLB is _________

(a)	Transfer Lookaside Buffer
(b)	Translation Lookinside Buffer
(c)	Translation Lookaside Buffer
(d)	None of the mentioned

59.

In a optimal page replacement algorithm, when a page is to be replaced, which of the following pages is chosen?

(a)	Oldest page
(b)	Newest page
(c)	Frequently occurred page in the future
(d)	Not frequently occurred page in the future

60.

Consider a reference string 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1 of frame size 3. Calculate the number of page faults using optimal page replacement algorithm.

(a)	10
(b)	9
(c)	8
(d)	7

Showing 51 to 60 out of 85 Questions