Question 1

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

Accepted Answer

A) True 
 B)False  True

Question 2

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

Accepted Answer

A) True 
 B)False  True

Question 3

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

Accepted Answer

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

Question 4

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

Accepted Answer

The answer of Because a process executes only in main...

Question 5

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

Accepted Answer

The answer of The address assigned to a location in...

Question 6

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

Accepted Answer

The answer of With __________ , a page is brought...

Question 7

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

Accepted Answer

A) True 
 B)False

Question 8

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

Accepted Answer

kernel mem

Question 9

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

Accepted Answer

A)  paging error 
B)  page replacement policy 
C)  page fault 
D)  page placement policy 
A)  paging error 
B)  page replacement policy 
C)  page fault 
D)  page placement policy

Question 10

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

Accepted Answer

least rece

Question 11

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

Accepted Answer

The answer of _________ is a storage allocation scheme in...

Question 12

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

Accepted Answer

The answer of The portion of a process that is...

Question 13

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

Accepted Answer

page middl

Question 14

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

Accepted Answer

A)  Paging 
B)  Locality 
C)  Segmentation 
D)  Resident set management 
A)  Paging 
B)  Locality 
C)  Segmentation 
D)  Resident set management

Question 15

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

Accepted Answer

A)  page placement 
B)  working set 
C)  VSWS 
D)  page fault frequency 
A)  page placement 
B)  working set 
C)  VSWS 
D)  page fault frequency

Question 16

_________ is the virtual storage assigned to a process.

Accepted Answer

A)  Virtual address space 
B)  Virtual address 
C)  Real address 
D)  Address space 
A)  Virtual address space 
B)  Virtual address 
C)  Real address 
D)  Address space

Question 17

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

Accepted Answer

A) True 
 B)False

Question 18

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

Accepted Answer

A)  Hashing 
B)  Paging 
C)  Segmentation 
D)  Thrashing 
A)  Hashing 
B)  Paging 
C)  Segmentation 
D)  Thrashing

Question 19

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

Accepted Answer

A)  hash table 
B)  segment table 
C)  page table 
D)  inverted page table 
A)  hash table 
B)  segment table 
C)  page table 
D)  inverted page table

Question 20

The _________ states the process that owns the page.

Accepted Answer

A)  process identifier 
B)  control bits 
C)  page number 
D)  chain pointer 
A)  process identifier 
B)  control bits 
C)  page number 
D)  chain pointer

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

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

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

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

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

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

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

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

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

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.

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

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

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

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

_________ is the virtual storage assigned to a process.

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

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

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

The _________ states the process that owns the page.

Computer Systems Overview

Operating System Overview

Process Description and Control

Threads

Concurrency: Mutual Exclusion and Synchronization

Concurrency: Deadlock and Starvation

Memory Management

Uniprocessor Scheduling

Multiprocessor and Real-Time Scheduling

Io Management and Disk Scheduling

File Management

Embedded Operating Systems

Computer Security Threats

Computer Security Techniques

Distributed Processing, Clientserver, and Clusters

Network Protocols

Distributed Process Management

Filters

Exam 8: Virtual Memory

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

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

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

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

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

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

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

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

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

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.

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

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

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

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

_________ is the virtual storage assigned to a process.

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

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

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

The _________ states the process that owns the page.

Computer Systems Overview

Operating System Overview

Process Description and Control

Threads

Concurrency: Mutual Exclusion and Synchronization

Concurrency: Deadlock and Starvation

Memory Management

Uniprocessor Scheduling

Multiprocessor and Real-Time Scheduling

Io Management and Disk Scheduling

File Management

Embedded Operating Systems

Computer Security Threats

Computer Security Techniques

Distributed Processing, Clientserver, and Clusters

Network Protocols

Distributed Process Management

Filters