FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 8: Virtual Memory

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 1

Multiple Choice

Review LaterAdd Note

Review Later

The _________ policy results in the fewest number of page faults.

A) Optimal
B) FIFO
C) Clock
D) LRU

Correct Answer

verified

A

Question 2

Short Answer

Review LaterAdd Note

Review Later

Because a process executes only in main memory, that memory is referred to as ____________ .

Correct Answer

verified

Show Answer

Question 3

Short Answer

Review LaterAdd Note

In SVR4 and Solaris systems, the memory management scheme that manages memory allocation for the kernel is called the _________ .

The _________ states the process that owns the page.

A precleaning policy writes modified pages before their page frames are needed so that pages can be written out in batches.

The principle of locality states that program and data references within a process do not tend to cluster.

_________ is the virtual storage assigned to a process.

A _________ is issued if a desired page is not in main memory.

__________ is transparent to the programmer and eliminates external fragmentation providing efficient use of main memory.

Linux makes use of a three-level page table structure consisting of the following types of tables: page directory, page table, and __________ .

The __________ structure indexes page table entries by frame number rather than by virtual page number.

The portion of a process that is actually in main memory at any time is defined to be the _________ of the process.

The __________ policy replaces the page in memory that has not been referenced for the longest time.

_________ is a storage allocation scheme in which secondary memory can be addressed as though it were part of main memory.

Most of the memory management issues confronting the operating system designer are in the area of paging when segmentation is combined with paging.

_________ allows the programmer to view memory as consisting of multiple address spaces.

The address assigned to a location in virtual memory to allow that location to be accessed as though it were part of main memory is the __________ .

The design issue of page size is related to the size of physical main memory and program size.

With __________ , a page is brought into main memory only when a reference is made to a location on that page.

The _________ algorithm requires a use bit to be associated with each page in memory.