Filters
Question type

Study Flashcards

In demand paging,when an excessive number of pages are moved back and forth between main memory and secondary storage,it is called ____.


A) swapping
B) faulting
C) paging
D) thrashing

E) A) and C)
F) B) and D)

Correct Answer

verifed

verified

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


A) page set
B) working set
C) job set
D) denning set

E) All of the above
F) None of the above

Correct Answer

verifed

verified

One of the most important innovations of demand paging is that it makes ____ feasible.


A) parallel memory
B) automatic allocation
C) spontaneous allocation
D) virtual memory

E) A) and B)
F) A) and C)

Correct Answer

verifed

verified

A variation of the LRU page replacement algorithm known as the ____ replacement policy is implemented with a circular queue.


A) clock page
B) round robin
C) performance page
D) bit shifting

E) A) and D)
F) B) and D)

Correct Answer

verifed

verified

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


A) Virtual memory
B) Cache memory
C) Paging
D) Segmenting

E) A) and C)
F) C) and D)

Correct Answer

verifed

verified

In demand paging,pages are ____ between main memory and secondary storage.


A) swapped
B) traded
C) allocated
D) faulted

E) B) and C)
F) A) and B)

Correct Answer

verifed

verified

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


A) Paging Anomaly
B) Belady Anomaly
C) Interrupt Anomaly
D) Laszlo Anomaly

E) A) and C)
F) B) and D)

Correct Answer

verifed

verified

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) All of the above
F) A) and D)

Correct Answer

verifed

verified

The primary advantage of storing programs in noncontiguous locations is that ____.


A) multiple programs can run at the same time
B) every program will be able to run
C) secondary storage is accessed more quickly
D) main memory is used more efficiently

E) A) and D)
F) A) and C)

Correct Answer

verifed

verified

The term "____" means that during any phase of its execution,a program references only a small fraction of its pages.


A) dynamic paging
B) structured programming
C) locality of reference
D) working set

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

Correct Answer

verifed

verified

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.

A) True
B) False

Correct Answer

verifed

verified

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

A) True
B) False

Correct Answer

verifed

verified

____ effectively removes restrictions on maximum program size.


A) Segmenting
B) Virtual memory
C) Shared memory
D) Multithreading

E) A) and B)
F) B) and C)

Correct Answer

verifed

verified

A disadvantage of segmented memory allocation is ____.


A) the physical size requirements of main memory
B) the number of page faults
C) internal fragmentation
D) external fragmentation

E) C) and D)
F) A) and D)

Correct Answer

verifed

verified

Cache memory is based on the concept of using a large,fast,and expensive memory to supplement the workings of main memory.

A) True
B) False

Correct Answer

verifed

verified

Associative memory is a name given to several hardware registers that are allocated to each active job whose task is to associate segment and page numbers belonging to the job being processed with their main memory addresses.

A) True
B) False

Correct Answer

verifed

verified

In the bit-shifting variation of the LRU page replacement policy,the process of shifting bits to the right and resetting the leftmost bit to 1 when a page is referenced gives a history of each page's usage.

A) True
B) False

Correct Answer

verifed

verified

With demand paging,three additional fields are introduced for each page in each PMT: one to determine if the page being requested is already in memory,a second to determine if the page contents have been modified while in memory,and a third to determine if the page has been referenced most recently.

A) True
B) False

Correct Answer

verifed

verified

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.

A) True
B) False

Correct Answer

verifed

verified

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.

A) True
B) False

Correct Answer

verifed

verified

Showing 21 - 40 of 40

Related Exams

Show Answer