QUESTION 1 What is true concerning page replacement policies for the page frames of a process? Select two. OA. A FIFO policy maintains the page frames in a circular buffer. OB. A local policy views all unlocked pages as candidates for replacement. OC. A global policy selects a page based on process that caused a fault. OD. A clock policy is similar to FIFO but passes over recently used pages.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Subject is Operating Systems - Please answer the following:

Some questions could have multiple correct answers.

Choose all correct answers.

QUESTION 1
What is true concerning page replacement policies for the page frames of a
process? Select two.
OA. A FIFO policy maintains the page frames in a circular buffer.
OB. A local policy views all unlocked pages as candidates for replacement.
OC. A global policy selects a page based on process that caused a fault.
OD. A clock policy is similar to FIFO but passes over recently used pages.
QUESTION 2
Select the two true statements. The resident set size of a process
OA. must be large enough to hold the entire process image.
OB. must be the same size for all processes.
Oc. is minimized in order to maximize the number of processes in memory.
OD. can be small since most processes never use all of allocated virtual memory.
QUESTION 3
Select the two true statements concerning page cleaning policies.
OA. Under any policy a dirty page can be replaced before it is written to disk.
OB. A downside to demand cleaning is that dirty pages could be lost in a crash.
Oc. A pre-cleaning policy writes a modified page before it needs to be replaced.
OD. In demand cleaning pages are often buffered before writing to disk.
QUESTION 4
Select the two true statements. The translation lookaside buffer (TLB) is
OA. a fixed-size, high-speed cache that contains page table entries.
OB. updated only if a page fault occurs.
Oc. updated when a new page table entry is grabbed from a process page table.
OD. queried after the page table is queried.
QUESTION 5
Select the two true statements. A pre-paging fetch policy
OA. brings in only those pages that generated the page fault.
OB. exploits the seek time and rotational latency of storage devices.
Oc. takes advantage of the principle of locality.
OD. causes a flurry of page faults early on in program execution (i.e.,startup).
Transcribed Image Text:QUESTION 1 What is true concerning page replacement policies for the page frames of a process? Select two. OA. A FIFO policy maintains the page frames in a circular buffer. OB. A local policy views all unlocked pages as candidates for replacement. OC. A global policy selects a page based on process that caused a fault. OD. A clock policy is similar to FIFO but passes over recently used pages. QUESTION 2 Select the two true statements. The resident set size of a process OA. must be large enough to hold the entire process image. OB. must be the same size for all processes. Oc. is minimized in order to maximize the number of processes in memory. OD. can be small since most processes never use all of allocated virtual memory. QUESTION 3 Select the two true statements concerning page cleaning policies. OA. Under any policy a dirty page can be replaced before it is written to disk. OB. A downside to demand cleaning is that dirty pages could be lost in a crash. Oc. A pre-cleaning policy writes a modified page before it needs to be replaced. OD. In demand cleaning pages are often buffered before writing to disk. QUESTION 4 Select the two true statements. The translation lookaside buffer (TLB) is OA. a fixed-size, high-speed cache that contains page table entries. OB. updated only if a page fault occurs. Oc. updated when a new page table entry is grabbed from a process page table. OD. queried after the page table is queried. QUESTION 5 Select the two true statements. A pre-paging fetch policy OA. brings in only those pages that generated the page fault. OB. exploits the seek time and rotational latency of storage devices. Oc. takes advantage of the principle of locality. OD. causes a flurry of page faults early on in program execution (i.e.,startup).
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY