wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

IT 104A Quiz - Module 3

Total questions: 25

Worksheet time: 13mins

Name
Class
Date
1.

The key to the successful implementation of demand paging is the use of a direct access memory device that can work directly with the CPU.

a)

T

b)

F

2.

The address of the beginning of a page frame is found by multiplying the page frame number by the number of frames.

a)

T

b)

F

3.

To find the address of a given program line, the line number is multiplied by the page size.

a)

T

b)

F

4.

A page interrupt is generated when a new page is brought into memory.

a)

T

b)

F

5.

Every time an instruction is executed, or a data value is used, the operating system (or the hardware) must translate the job space address, which is relative, into its physical address, which is absolute.

a)

T

b)

F

6.

Paged memory allocation usually results in internal fragmentation, but never external fragmentation.

a)

T

b)

F

7.

____ gives users the appearance that their programs are being completely loaded in main memory during their entire processing time

a)

Segmenting

b)

Virtual memory

c)

Shared memory

d)

Multithreading

8.

One sector will hold one page of job instructions and fit into one page frame of memory.

a)

T

b)

F

9.

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

a)

T

b)

F

10.

The first-in-first-out replacement policy is always preferable to the least-recently-used policy.

a)

T

b)

F

11.

The segmented/demand paged memory allocation scheme is a combination of segmentation and demand paging, and it offers the logical benefits of segmentation, as well as the physical benefits of paging.

a)

T

b)

F

12.

What is the name of the page replacement policy where the page to remove is the one that has been in memory the longest.

a)

TRU

b)

LRU

c)

LIFO

d)

FIFO

13.

To move in a new page, a resident page must be swapped back into primary storage.

a)

T

b)

F

14.

In the PMT, the ____ bit for all pages in memory is 1.

a)

status

b)

referenced

c)

modified

d)

frame

15.

When using a FIFO scheme, more memory will always result in better performance.

a)

T

b)

F

16.

Within the Memory Manager the Segment Link Table lists details about each segment (one for each job).

a)

T

b)

F

17.

What happens in demand paging when a job requires a certain page to be loaded and there is no empty page frame?

a)

a resident page must be swapped back into secondary storage

b)

the page cannot be loaded and the job will exit

c)

the job must wait until a page frame is freed by another job

d)

the page will share a page frame with another page from the same job

18.

What is the primary advantage of storing programs in noncontiguous locations?

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

19.

When there is an excessive amount of page swapping between main memory and secondary storage, the operation becomes inefficient. This phenomenon is called ____.

a)

excessive demand paging

b)

hot swapping

c)

thrashing

d)

overswapping

20.

What field(s) must be added to the PMT to support demand paging?

a)

field to determine if page contents have been modified

b)

field to determine if the page being requested is already in memory

c)

field to determine if the page has been referenced recently

d)

All of the above

21.

Cache memory is a small high-speed memory unit that a processor can access less rapidly than main memory.

a)

T

b)

F

22.

What will happen when a page size is too small?

a)

very long PMTs

b)

more difficult to calculate actual position

c)

excessive internal fragmentation

d)

excessive external fragmentation

23.

____ 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)

Paging

c)

Cache memory

d)

Segmenting

24.

The segmented/demand paged memory allocation scheme divides each segment into equally sized ____.

a)

pages

b)

blocks

c)

frames

d)

sets

25.

How many entries per page are there in the PMT?

a)

0

b)

1

c)

2

d)

5