Which of these statements about the algorithm "First fit" is true? *

Memory Manager scans along with the list of segments until it finds a hole that is big enough.

Memory Manager starting searching the list of segments from the place where it left off last time.

Memory Manager searches the entire list of segments from beginning to end and takes the smallest hole that is adequate.

The page size that is too small will generate ____

excessive external fragmentation

Excessive internal fragmentation

More difficult to calculate the actual position

Which of the following is a method to keep track of memory usages?

Memory Management with Bit Maps and Memory Management with Linked Lists

Memory Management with Bit Maps

Memory Management with Linked Lists

Which of these statements about the algorithm "Worst fit" is true?

Memory Manager starting searching the list of segments from the place where it left off last time.

Memory Manager scans along with the list of segments until it finds a hole that is big enough.

Memory Manager searches the entire list of segments from beginning to end and takes the smallest hole that is adequate.

Which strategy is the simplest design for speeding up Paging?

Page table is loaded into registers

Page table is loaded into main memory

Which of the following statements is incorrect about the Translation Look-aside Buffer (TLB)?

A TLB miss implies a disk operation will follow

Each entry of a TLB contains the information about one page, including the virtual page number and the corresponding page frame

A TLB is sometimes known as an associative memory

The second-chance page-replacement algorithm

Moves pages found at the head of a FIFO queue with the referenced bit turned on back to the tail of the queue to avoid replacing them

Searches through a circular list of pages and replaces the first page it encounters that have the referenced bit turned off

Relies on a modified bit to determine which page to replace

Which of these statements about the Inverted Page Table are true?

An entry contains the pair (segment, virtual page) mapped into the corresponding page frame

An entry contains the pair (process, virtual page) mapped into the corresponding page frame

An entry contains the pair (segment, offset) mapped into the corresponding page frame

An entry contains the pair (process, offset) mapped into the corresponding page frame

LRU replaces the page that has spent the

longest time in memory without being referenced

shortest time in memory without being referenced

Which of these statements about the algorithm "Next fit" is true?

Memory Manager starting searching the list of segments from the place where it left off last time.

Memory Manager scans along the list of segments until it finds a hole that is big enough.

Memory Manager searches the entire list of segments from beginng to end and take smallest hole that is adequate.

In a system employing a paging scheme for memory management, wasted space is due to:

Pages and frames of different specified sizes

Working set model is used for:

Finding the minimum number of frames necessary for a job so that jobs can be run without "thrashing"

Finding the average number of frames a job will need to run smoothly

Determining whether page replacement is needed

Which of the following statements is incorrect about Translation Look-aside Buffer (TLB)?

The use of TLB eliminates the need for keeping a page table in memory

TLB only maintains a subset of the entries stored in the full memory-based page table

When there is a TLB miss the system needs to access the page table

With paging, when is the internal fragmentation possible?

The last page of the job is less than the maximum page size

The virtual memory assigned to the program is less than the physical memory assigned to it

A page fault means that we referenced a page

That was outside the memory boundaries

That was not in secondary storage

In "No Memory Abstraction", the static relocation technique is ____ *

When the program is loaded at address n, the constant n was added to every program address

After the program is loaded at address n, the constant n is stored at a particular register.

When the program is compiled, the address of program is added with the constant value where the program will be loaded

Which of the following statements about segmentation is false?

There are several linear address spaces

Sharing of procedures between different users can be facilitated

The total address space can be more than the size of physical memory

Which kind of tables is used in the segmentation?

Global Descriptor Table (GDT) and Local Descriptor Table (LDT)

Which of these statements about the algorithm "Best fit" is true?

Memory Manager searches the entire list of segments from beginning to end and take the smallest hole that is adequate.

Memory Manager scans along with the list of segments until it finds a hole that is big enough.

Memory Manager starting searching the list of segments from the place where it left off last time.

OS_03

Authored by Lê Thị Phương Dung (FE FPTU CT)

Computers

2nd Grade

Used 1+ times

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

Content View

Student View

47 questions

Show all answers

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Page replacement algorithms determine

Which pages should be brought into memory because a process is likely to reference them soon

Which page to remove to provide space for an incoming page

How many pages should be added to the main memory

When the system should update page table entries

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following information bits in the entry of page table is used to indicate Page Fault? *

Present/absent bit

Status bit

Referenced bit

Modified bit

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

To specify an address in this segmented memory, the _____ form is used *

<process, offset>

<segment-number, offset>

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Consider a swapping system in which the memory consists of the following hole sizes: 10 K, 4 K, 20 K, 15 K, 9 K. Assume first fit algorithm is used. Which holes are taken for successive segment requests of 8 K, 12 K, 10 K? *

10 K, 20 K, 15 K

9 K, 15 K, 10 K

20 K, 15 K, 4 K

None of the other choices

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The page table for each process maintains _________ .

the physical memory location of the process

the frame location for each page of the process

the page location for each frame of the process

the logical memory location of the process

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The modified/dirty bit is used for the purpose of: *

None of the other choices

Implementing FIFO page replacement algorithm

Dynamic allocation of memory used by one process to another

Reduce the average time required to service page faults

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

There are ____ entries per page in the Page table: *

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever

or continue with

Microsoft

Apple

Others

Already have an account?

Similar Resources on Wayground

45 questions

Computer Hardware and Software Review

Quiz

•

KG - University

50 questions

KUIS PKK 2 (PERAKITAN PRODUK)

Quiz

•

KG - Professional Dev...

50 questions

SOCRATECHS

Quiz

•

1st Grade - Professio...

50 questions

Kuis Jaringan Komputer 1

Quiz

•

1st - 12th Grade

50 questions

GPO AD

Quiz

•

2nd Grade

50 questions

Revisão Informática 2A

Quiz

•

2nd Grade

43 questions

Let's Find the Talents of Little Heroes

Quiz

•

2nd - 4th Grade

50 questions

Test yuor STEM knowledge

Quiz

•

2nd Grade

Popular Resources on Wayground

15 questions

Fractions on a Number Line

Quiz

•

3rd Grade

20 questions

Equivalent Fractions

Quiz

•

3rd Grade

25 questions

Multiplication Facts

Quiz

•

5th Grade

$fractions$

22 questions

fractions

Quiz

•

3rd Grade

20 questions

Main Idea and Details

Quiz

•

5th Grade

20 questions

Context Clues

Quiz

•

6th Grade

15 questions

Equivalent Fractions

Quiz

•

4th Grade

20 questions

Figurative Language Review

Quiz

•

6th Grade

Discover more resources for Computers

14 questions

Contractions

Quiz

•

2nd Grade

10 questions

Exploring Rosa Parks and Black History Month

Interactive video

•

1st - 5th Grade

20 questions

Counting Coins

Quiz

•

2nd Grade

20 questions

Place Value

Quiz

•

KG - 3rd Grade

19 questions

Subject-Verb Agreement

Quiz

•

2nd - 5th Grade

13 questions

Fractions

Quiz

•

1st - 2nd Grade

12 questions

2-Digit Subtraction with Regrouping

Quiz

•

2nd Grade

14 questions

Fractions

Quiz

•

2nd - 3rd Grade

OS_03

Page replacement algorithms determine

Which of the following information bits in the entry of page table is used to indicate Page Fault? *

To specify an address in this segmented memory, the _____ form is used *

Consider a swapping system in which the memory consists of the following hole sizes: 10 K, 4 K, 20 K, 15 K, 9 K. Assume first fit algorithm is used. Which holes are taken for successive segment requests of 8 K, 12 K, 10 K? *

The page table for each process maintains _________ .

The modified/dirty bit is used for the purpose of: *

There are ____ entries per page in the Page table: *

Which of the following information bits in the entry of page table is used to indicate Page Fault? *

Consider a swapping system in which the memory consists of the following hole sizes: 10K, 4K, 20K, 15K, 9K. Assume best fit algorithm is used. Which holes are taken for successive segment requests of 8K, 12K, 10K?

When a virtual memory system manages memory in fixed-length units, which of the following terms correctly represents its unit?

Access all questions and much more by creating a free account

Similar Resources on Wayground

Popular Resources on Wayground

Discover more resources for Computers