Question

Which of the following about virtual memory is not true? A) Virtual memory needs paging hardware...

Which of the following about virtual memory is not true?

A) Virtual memory needs paging hardware

B)Virtual Memory uses storage device to extend the physical main memory

C)The optimal replacement strategy is the most practical strategy

D)Multiple process can share pages

What should we do when having a page fault (Multiple answers)?

A)Skip the machine instruction causing the page fault.

B)Update the page table after loading the missing page

C) Switch to a process that does not have page faults

D) Look for the missing page on storage device

Which page replacement algorithm is always better than others?

A)The optimal
B)FIFO
C) Least recently used
D)Least frequently used

Which of the following data structures are usually used for directory? (multiple answers)

A)Stack

B)B+ tree

C) Linear list

D) Hash Table

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Which of the following about virtual memory is not true?

Answer:

D)Multiple process can share pages

2.

What should we do when having a page fault (Multiple answers)?

Option D

3. Option A,

Optimal replacement algorithm is better than others.

4.Hash table is used to implement directory data structure.

Option D

Add a comment
Know the answer?
Add Answer to:
Which of the following about virtual memory is not true? A) Virtual memory needs paging hardware...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Operating Systems Virtual Memory Management question Given the reference string of page accesses below, and an...

    Operating Systems Virtual Memory Management question Given the reference string of page accesses below, and an allocation of 3 page frames, and the Least-Frequently Used page replacement algorithm. Show the content of the frames as the references are processed, and indicate which references cause page faults. Record the #page faults. ref 1 2 3 5 4 2 5 3 4 5 1 1 3 1 4 frame1 frame2 frame3 fault(X) #faults =

  • 3. Assume a virtual memory system with the following properties: • The physical memory available to...

    3. Assume a virtual memory system with the following properties: • The physical memory available to an application consists of four-page frames, with frame numbers 0, 1, 2, and 3. The application has six pages of data in its virtual address space, using page numbers 0, 1, 2, 3, 4, and 5. Build a table showing which frame is used to bring in each page for the following sequences of page references using FIFO, MIN, and LRU as page replacement...

  • 3. Consider a paging system with the page table in memory. A. If a memory reference...

    3. Consider a paging system with the page table in memory. A. If a memory reference takes 100 nanoseconds, how long does a paged memory reference take? B. If we add TLBs, and 75 percent of all page-table references are found in the TLBs, what is the effective memory reference time? (Assume that finding a page-table entry for the TLBs takes 20 nanoseconds.) C. It takes 750 milliseconds to service a page fault. The page fault rate is .001. What...

  • 3. Consider a paging system with the page table in memory. A. If a memory reference takes 100 nanoseconds, how long does...

    3. Consider a paging system with the page table in memory. A. If a memory reference takes 100 nanoseconds, how long does a paged memory reference take? B. If we add TLBs, and 75 percent of all page-table references are found in the TLBs, what is the effective memory reference time? (Assume that finding a page-table entry for the TLBs takes 20 nanoseconds.) C. It takes 750 milliseconds to service a page fault. The page fault rate is .001. What...

  • Assume demand paging with three frames. Consider the following page reference string: 7, 2, 3, 1,...

    Assume demand paging with three frames. Consider the following page reference string: 7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1 If OPT replacement is used, the number of page faults will be a. 8 b. 9 c. 10 d. 7 e.None of the above If LRU replacement is used, the number of page fault will be a. 8 b. 9 c. 10 d. 11 e. None of the above

  • 4 Consider a virtual memory system with FIFO page replacement policy. For an arbitrary page acces...

    4 Consider a virtual memory system with FIFO page replacement policy. For an arbitrary page access pattern, increasing the number of page frames in main memory will (GATE CS 2001) a) Always decrease the number of page faults b) Always increase the number of page faults c) Some times increase the number of page faults d) Never affect the number of page faults

  • Name Olbinna COSC414/514 Quiz3 (1) Suppose a computer has 4 physical pages, and a process referen...

    Name Olbinna COSC414/514 Quiz3 (1) Suppose a computer has 4 physical pages, and a process references its virtual pages (page o through page 7) in the following order: 021354637473355311172341 Also suppose the first four pages have been loaded in the physical memory as the following figure: Frame 0 Frame 1 Frame 2 Frame 3 a. Suppose the kernel uses First-In-First-Out (FIFO) page replacement algorithm. How many page faults would the process have? Which page references are page faults? b. Suppose...

  • D | Question 1 7.14 pts 57 Minutes. 29 Secon What causes the VM subsystem to...

    D | Question 1 7.14 pts 57 Minutes. 29 Secon What causes the VM subsystem to handle a page fault? 0 the M?U translates wrtual address and determines the page numbers beyond the page table length register's value the process attempts to exeoute this code 100. O the MMU translates a virtual address and whenit reads the page entry from the pare tables finds the vald/invalid bit to be imalid and thus trisgers a pae fault exception O the process...

  • 1- Stack algorithms are a class of page replacement algorithms that Select one: a. are guaranteed...

    1- Stack algorithms are a class of page replacement algorithms that Select one: a. are guaranteed to incur no more page faults than FIFO page replacement algorithm. b. do not suffer from Belady’s anomaly. c. are implemented using stacks. d. are guaranteed to incur the least number of page faults. 2- Which of the following is true about the strategy that uses page fault frequency (PFF) to prevent thrashing? Select one: a. A new page is allocated to a process...

  • Question 1 Which of the following is true about virtual addresses? Virtual addresses for the same...

    Question 1 Which of the following is true about virtual addresses? Virtual addresses for the same physical memory location may differ from process to process Virtual addresses are synonymous with physical addresses Virtual addresses always refer to locations on disk Virtual addresses for the same physical memory location may differ from thread to thread Question 2 How do pages and frames relate to each other? A page holds words while a frame holds pictures A frame is a larger structure...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT