Virtual Memory

1.
Memory tables are used to keep track of
a. Real and Virtual Memory
b. I/O Devices
c. Resources
d. I/O Modules
View Answer Report Discuss Too Difficult!
Answer: (a).Real and Virtual Memory
2. Virtual Memory is commonly implemented by __________.
a. Segmentation
b. Swapping
c. Demand Paging
d. None of the above
Answer: (c).Demand Paging
3. Virtual memory is __________.
a. An extremely large main memory
b. An extremely large secondary memory
c. An illusion of extremely large main memory
d. A type of memory used in super computers
Answer: (c).An illusion of extremely large main memory
4. _________ is a high speed cache used to hold recently referenced page table entries a part of paged virtual
memory .
a. Translation Lookaside buffer
b. Inverse page table
c. Segmented page table
d. All the above
Answer: (a).Translation Lookaside buffer

5. The high paging activity is called ________.
a. Inter process communication
b. Thrashing
c. Context Switch
Answer: (b).Thrashing
6. Virtual memory is __________.
a. An extremely large main memory
b. An extremely large secondary memory
c. An illusion of extremely large main memory
d. A type of memory used in super computers
Answer: (c).An illusion of extremely large main memory

7. The principle of locality of reference justifies the use of ________.
a. Virtual Memory
b. Interrupts
c. Main memory
d. Cache memory
Answer: (d).Cache memory
8. In a virtual memory environment
a. segmentation and page tables are stored in the cache and do not add any substantial overhead
b. slow down the computer system considerable
c. segmentation and page tables are stored in the RAM
d. none of the above
Answer: (c).segmentation and page tables are stored in the RAM

9. The mechanism that bring a page into memory only when it is needed is called _____________
a. Segmentation
b. Fragmentation
c. Demand Paging
d. Page Replacement
Answer: (c).Demand Paging
10. Demand paged memory allocation
a. allows the virtual address space to be independent of the physical memory
b. allows the virtual address space to be a multiple of the physical memory size
c. allows deadlock tobe detected in paging schemes
d. is present only in Windows NT

Answer: (a).allows the virtual address space to be independent of the physical memory
11. What is a page fault ?
a. is an spelling error in a page

in memory
b. is a reference to a page
which is in another program
c. is an access to a page not

currently in memory
d. always occurs whenever a

page is accessed
Answer: (c).is an access to a page not currently in memory
12. Dirty bit is used to show
a. Page with corrupted data
b. Wrong page in memory
c. Page that is modified after being loaded in the cache memory
d. page that is less frequently accessed
Answer: (c).Page that is modified after being loaded in the cache memory
13. Size of virtual memory depends on
a. size of data bus
b. size of address bus
c. size of main memory

d. none of above
Answer: (b).size of address bus
14. A program is executing in a pure demand paging system with 100 records per page with 1 free main memory
frame. The address sequence that is generated by tracing this program is recorded as follows,
0100, 0200, 0430, 0499, 0510, 0530, 0560, 0120, 0220, 0240, 0260, 0320, 0370
What are the number of page faults?
a. 8
b. 11
c. 7
d. 12
Answer: (c).7
15. If hardware does not support _________ then a multi - user and multi - processing operating system cannot be
implemented.
a. At least two modes of CPU execution
b. Demand paging
c. DMA for disk transfer
d. Address translation
Answer: (b).Demand paging
16. Consider a virtual memory system that uses First In First Out (FIFO) page replacement policy and it allocates a
fixed number of frames to a process. Consider the following two statements,
1: Sometimes the page fault rate is increased if the number of page frames allocated is increased.
2: Some programs do not exhibit Locality of reference.
Which of the following is true?
a. 1 is false and 2 is true
b. both 1 and 2 are false
c. both 1 and 2 are true but 2 is not the reason for 1
d. both 1 and 2 are true and 2 is the reason for 1

Answer: (c).both 1 and 2 are true but 2 is not the reason for 1
17. Why do we translate a virtual address to physical address where a multilevel page table is preferred in
comparison to a single level page table?
a. It is required by the translation look-aside buffer
b. It helps to reduce the memory access time to read or write a memory location
c. It helps to reduce the number of page faults in page replacement algorithm
d. It helps to reduce the size of a page table needed to implement the virtual address space of a process
Answer: (d).It helps to reduce the size of a page table needed to implement the virtual address space of a process
18. What is the impact of thrashing?
a. It improves system performance
b. It implies excessive page I/O
c. It decreases the degree of multiprogramming

d. It reduces page I/O
Answer: (c).It decreases the degree of multiprogramming
19. Memory utilization factor shall be computed as follows
a. memory in use/allocated memory
b. memory in use/total memory connected.
c. memory allocated/free existing memory
d. memory committed/total memory available.
Answer: (b).memory in use/total memory connected.
20. Which of the following is not a key piece of information, stored in single page table entry, assuming pure paging
and virtual memory
a. Frame number
b. A bit indicating whether the page is in physical memory or on the disk

c. A reference for the disk block that stores the page
Answer: (c).A reference for the disk block that stores the page
21. A set of techniques that allow to execute a program which is not entirely in memory is called
a. demand paging
b. virtual memory
c. auxiliary memory
d. secondary memory
Answer: (b).virtual memory
22. Page fault frequency in an operating system is reduced when the
a. processes tend to the I/O-bound

b. size of pages is reduced
c. processes tend to be CPU-bound
d. locality of reference is applicable to the process
Answer: (d).locality of reference is applicable to the process
23. Virtual memory can be implemented with
a. Segmentation
b. Paging
c. None of the above
d. Both of the above
Answer: (d).Both of the above
24. A process that execute only in main memory is referred to as ……………… and that allocated in disk is referred to
a …………….
a. virtual memory, true memory
b. virtual memory, real memory
c. real memory, virtual memory
d. imaginary memory, real memory
Answer: (c).real memory, virtual memory
25. Thrashing
a. is a natural consequences of virtual memory system
b. can always be avoided by swapping
c. always occurs on large computers
d. can be caused by poor paging algorithms
Answer: (d).can be caused by poor paging algorithms

26. Which is not true about the memory management?
a. virtual memory is used in multi-user system
b. segmentation suffers from external fragmentation
c. paging suffers from internal fragmentation
d. segmented memory can be paged
Answer: (a).virtual memory is used in multi-user system
27. In virtual memory systems, Dynamic address translation
a. is the hardware necessary to implemented paging
b. stores pages at a specifies location on disk
c. is useless when swapping is used
d. is part of the operating system paging algorithm
Answer: (a).is the hardware necessary to implemented paging

28. The principle of locality of reference justifies the use of
a. reenterable
b. non reusable
c. virtual memory
d. cache memory
Answer: (d).cache memory
29. Which of the following is not true about the memory management?
a. virtual memory is used only in multi-user systems
b. segmentation suffers from external fragmentation
c. paging suffers from internal fragmentation
d. segmented memory can be paged
Answer: (a).virtual memory is used only in multi-user systems

30. Paging
a. is a method of memory allocation by which the program is subdivided into equal portions, or pages and core is
subdivided into equal portions or blocks.
b. consists of those addresses that may be generated by a processor during execution of a computation.
c. is a method of allocating processor time.
d. allows multiple programs to reside in separate areas of core at the time.
Answer: (a).is a method of memory allocation by which the program is subdivided into equal portions, or pages and
core is subdivided into equal portions or blocks.
.
31. Under virtual storage,
a. a single program is processed by two or more CPUs
b. two or more programs are stored concurrently in primary storage
c. only the active pages of a program are stored in primary storage
d. interprogram interference may occur
Answer: (c).only the active pages of a program are stored in primary storage

32. Virtual Memory
a. is a method of memory allocation by which the program is subdivided into equal portions, or pages and core is
subdivided into equal portions or blocks.
b. consists of those addresses that may be generated by a processor during execution of a computation.
c. is a method of allocating processor time.
d. allows multiple programs to reside in separate areas of core at the time.
Answer: (b).consists of those addresses that may be generated by a processor during execution of a computation.
33. Paging is implemented in
a. Operating System
b. Hardware
c. Software
d. All of them
Answer: (b).Hardware
34. Page-Table length register (PTLR) indicates size of
a. Page Table
b. Paging File
c. Main Memory
d. Virtual Memory
Answer: (a).Page Table
35. Bring a page into memory only when it is needed is called
a. Demand Memory
b. Demand Paging
c. Page Fault
d. Page Segmentation
Answer: (b).Demand Paging
36. Which of the following is not the approach to Handling Deadlocks
a. Deadlock Prevention
b. Deadlock Avoidance
c. Detect & Recover
d. Virtual Memory
Answer: (d).Virtual Memory
37. Which scheduler selects which processes should be brought into the ready queue?
a. Real-term
b. Long-term
c. Mid-term
d. Short-term
Answer: (b).Long-term
38. Dived logical memory into blocks with the same size as frames are called
a. Pages
b. Frames
c. Page Table
d. Segmentation
Answer: (a).Pages
39. Which memory allocation policy allocate the largest hole to the process?
a. Best-Fit
b. Worst-Fit
c. First-Fit
d. None of them
Answer: (b).Worst-Fit
40. When there is enough memory to fit a process in memory, but the space is not contiguous we need
a. Internal Fragmentation
b. Virtual Fragmentation
c. External Fragmentation
d. None of them
Answer: (c).External Fragmentation
41. Piece of code that only one thread can execute at a time is called
a. Mutual Exclusion
b. Critical Section
c. Synchronization
d. All of them
Answer: (b).Critical Section
42. When a thread waits indefinitely for some resource, but other threads are actually using it is called
a. Starvation
b. Demand Paging
c. Segmentation
d. None of them
Answer: (a).Starvation

Virtual Memory

Uploaded by

Copyright:

Available Formats

You might also like

Virtual Memory

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Virtual Memory

Uploaded by

Copyright:

Available Formats

1.

Memory tables are used to keep track of

a. Real and Virtual Memory

View Answer Report Discuss Too Difficult!

Answer: (a).Real and Virtual Memory

2. Virtual Memory is commonly implemented by __________.

d. None of the above

View Answer Report Discuss Too Difficult!

a. An extremely large main memory

b. An extremely large secondary memory

c. An illusion of extremely large main memory

d. A type of memory used in super computers

View Answer Report Discuss Too Difficult!

Answer: (c).An illusion of extremely large main memory

a. Translation Lookaside buffer

b. Inverse page table

c. Segmented page table

d. All the above

View Answer Report Discuss Too Difficult!

Answer: (a).Translation Lookaside buffer

a. Inter process communication

d. None of the above

View Answer Report Discuss Too Difficult!

6. Virtual memory is __________.

a. An extremely large main memory

b. An extremely large secondary memory

c. An illusion of extremely large main memory

d. A type of memory used in super computers

View Answer Report Discuss Too Difficult!

Answer: (c).An illusion of extremely large main memory

View Answer Report Discuss Too Difficult!

8. In a virtual memory environment

b. slow down the computer system considerable

c. segmentation and page tables are stored in the RAM

d. none of the above

View Answer Report Discuss Too Difficult!

Answer: (c).segmentation and page tables are stored in the RAM

View Answer Report Discuss Too Difficult!

10. Demand paged memory allocation

a. allows the virtual address space to be independent of the physical memory

c. allows deadlock tobe detected in paging schemes

d. is present only in Windows NT

Answer: (a).allows the virtual address space to be independent of the physical memory

11. What is a page fault ?

a. is an spelling error in a page

c. is an access to a page not

d. always occurs whenever a

Answer: (c).is an access to a page not currently in memory

12. Dirty bit is used to show

a. Page with corrupted data

b. Wrong page in memory

c. Page that is modified after being loaded in the cache memory

d. page that is less frequently accessed

View Answer Report Discuss Too Difficult!

Answer: (c).Page that is modified after being loaded in the cache memory

13. Size of virtual memory depends on

a. size of data bus