FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 3: Memory Management Includes Virtual Memory

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 1

Multiple Choice

Review LaterAdd Note

Review Later

In a paged memory allocation scheme,a simple ____ has one entry for each page frame that shows its location and its free/busy status.

A) Memory Management Table
B) Job Table
C) Page Access Table
D) Memory Map Table

E) None of the above
F) B) and C)

Correct Answer

verified

D

Question 2

True/False

Review LaterAdd Note

Review Later

Virtual memory can be implemented with both paging and segmentation.

A) True
B) False

Correct Answer

verified

True

Question 3

Multiple Choice

Review LaterAdd Note

____ effectively removes restrictions on maximum program size.

____ can be thought of as being an intermediary between main memory and the special-purpose registers,which are the domain of the CPU.

In a paged memory allocation scheme,the ____ contains two values for each active job: the size of the job and the memory location where its Page Map Table is stored.

Demand paging introduced the concept of loading only a part of the program into memory for processing

The ____ demonstrates that when using a FIFO policy,in rare cases,adding more memory to a system can cause an increase in page interrupts.

With demand paging,if there are no empty page frames available,to move in a new page,one of the current resident pages must be placed into main memory.

In a paged memory allocation scheme,to find the actual position of an instruction in memory,first the page number and displacement are determined.Then the operating system refers to the job's PMT to correlate the page with its page frame.

When using a FIFO scheme,adding more memory always results in better performance.

A job's working set is the collection of pages that must be loaded from secondary storage.

A variation of the LRU page replacement algorithm known as the clock page replacement policy is implemented using a pointer to step through the reference bits of the active pages,simulating a clockwise motion.

With segmented memory allocation,each job is divided into several ____ of different sizes,one for each module that contains pieces that perform related functions.

The Job Table (JT)contains two values for each active job: the size of the job and the memory location where its Page Map Table is stored.

In demand paging,the collection of pages residing in memory that can be accessed directly without incurring a page fault is called the ____.

With segmented memory allocation,each job is divided into several segments of the same size,one for each module containing pieces that perform related functions.

To access a location in memory when using segmented memory management,the address is composed of two entries: ____.

Paged memory allocation offers the advantage that it doesn't require the entire job to be stored in memory during its execution.

The purpose of cache memory is to keep handy the most recently accessed data and instructions so that the CPU can access them repeatedly without wasting time.This purpose is similar to that of the ____ of a Web browser.

The ____ page replacement policy is based on the theory that the best page to remove is the one that has been in memory the longest.