Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

POP > Chap 8 > Flashcards

Chap 8 Flashcards

1
Q

The size of virtual storage is limited by the actual number of main storage locations.

A

FALSE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

The addresses a program may use to reference memory are distinguished from the addresses the memory system uses to identify physical storage sites.

A

TRUE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

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

A

TRUE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Segmentation is not visible to the programmer.

A

FALSE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

The placement policy determines where in real memory a process piece is to reside.

A

TRUE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Virtual memory allows for very effective multiprogramming and relieves the user of the unnecessarily tight constraints of main memory.

A

TRUE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

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

A

FALSE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

The smaller the page size, the greater the amount of internal fragmentation.

A

FALSE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

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

A

TRUE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Segments may be of unequal, indeed dynamic, size.

A

TRUE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

The page currently stored in a frame may still be replaced even when the page is locked.

A

FALSE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

One way to counter the potential performance problems of a variable-allocation global scope policy is to use page buffering.

A

TRUE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

The PFF policy evaluates the working set of a process at sampling instances based on elapsed virtual time.

A

FALSE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

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

A

TRUE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

UNIX is intended to be machine-independent; therefore its memory management scheme will vary from one system to the next.

A

TRUE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

The address of a storage location in main memory is the _________.

A

real address

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

__________ is the virtual storage assigned to a process.

A

virtual address space

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

_________ is the range of memory addresses available to a process.

A

address space

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

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

A

inverted page table

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

The _______ states the process that owns the page.

A

process identifier

21
Q

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

A

page fault

22
Q

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

A

segmentation

23
Q

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

A

paging

24
Q

The _________ determines when a page should be brought into main memory.

A

fetch policy

25
Q

With ________ pages other than the one demanded by a page fault are brought in.

A

prepaging

26
Q

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

A

optimal

27
Q

A ________ chooses only among the resident pages of the process that generated the page fault in selecting a page to replace.

A

local replacement policy

28
Q

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

A

page fault frequency

29
Q

________ is where modified process pages can be written out at the time of replacement, or a precleaning policy can be used, which clusters the output activity by writing out a number of pages at once.

A

Cleaning policy

30
Q

_________ is the concept associated with determining the number of processes that will be resident in main memory.

A

Load control

31
Q

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

A

virtual address

32
Q

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

A

virtual memory

33
Q

The size of virtual storage is limited by the addressing scheme of the computer system and by the amount of ___________ available

A

secondary memory

34
Q

The ______ policy treats the page frames allocated to a process as a circular buffer and pages are removed in a round robin style.

A

FIFO

35
Q

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

A

resident set

36
Q

A __________ policy allows the number of page frames allocated to a process to be varied over the lifetime of the process.

A

variable allocation

37
Q

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

A

real memory

38
Q

When the system spends most of its time swapping pieces rather than executing instructions it leads to a condition known as ____________.

A

thrashing

39
Q

To overcome the problem of doubling the memory access time, most virtual memory schemes make use of a special high-speed cache for page table entries called a ____________.

A

translation lookaside buffer

40
Q

The technique where the processor is equipped with hardware that allows it to interrogate simultaneously a number of TLB entries to determine if there is a match on page number is referred to as ______________.

A

associative mapping

41
Q

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

A

demand paging

42
Q

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

A

least recently used

43
Q

The __________ provides a virtual memory capability that allocates page frames in main memory to processes and also allocates page frames to disk block buffers.

A

paging system

44
Q

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

A

page middle directory

45
Q

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

A

kernel memory allocator

46
Q

_________ allows the programmer to view memory as consisting of multiple address spaces. Select one:
a. Paging
b. Locality
c. Segmentation
d. Resident set management

A

c

47
Q

With _________ pages other than the one demanded by a page fault are brought in. Select one:
a. slab allocation
b. thrashing
c. hashing
d. prepaging

A

d

48
Q

_________ is the concept associated with determining the number of processes that will be resident in main memory. Select one:
a. Virtual memory manager
b. Page fault frequency
c. LRU policy
d. Load Control

A

d

49
Q

The _________ algorithm requires a use bit to be associated with each page in memory. Select one:
a. page placement
b. working set
c. VSWS
d. page fault frequency

A

b

POP (11 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2025 Bold Learning Solutions. Terms and Conditions