Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged paging
6
votes
1
answer
61
GATE Overflow Test Series | Mock GATE | Test 1 | Question: 22
Let the page fault service time be $25$ milliseconds(ms) in a computer with average memory access time being $40$ nanoseconds (ns). If one page fault is generated every $100,000$ memory accesses, the effective access time in nanoseconds for memory is _______
Let the page fault service time be $25$ milliseconds(ms) in a computer with average memory access time being $40$ nanoseconds (ns). If one page fault is generated every $...
gatecse
737
views
gatecse
asked
Jan 3, 2021
Operating System
go2025-mockgate-1
numerical-answers
memory-management
paging
virtual-memory
operating-system
+
–
7
votes
1
answer
62
GATE Overflow Test Series | Mock GATE | Test 1 | Question: 23
With $\text{64 bit}$ virtual addresses, a $\text{4 KB}$ page and $\text{16 GB}$ of RAM, an inverted page table requires ______ $2$ million entries $4$ million entries $512$ thousand entries $1$ million entries
With $\text{64 bit}$ virtual addresses, a $\text{4 KB}$ page and $\text{16 GB}$ of RAM, an inverted page table requires ______$2$ million entries$4$ million entries$512$ ...
gatecse
519
views
gatecse
asked
Jan 3, 2021
Operating System
go2025-mockgate-1
memory-management
paging
virtual-memory
operating-system
+
–
2
votes
1
answer
63
GATE Overflow Test Series | Operating Systems | Test 2 | Question: 8
Which of the following is/are correct? (Mark all the appropriate choices) Paging avoids external fragmentation Paging avoids internal fragmentation Segmentation avoids external fragmentation Segmentation avoids internal fragmentation
Which of the following is/are correct? (Mark all the appropriate choices)Paging avoids external fragmentationPaging avoids internal fragmentationSegmentation avoids exter...
gatecse
207
views
gatecse
asked
Dec 7, 2020
Operating System
go2025-os-2
memory-management
paging
virtual-memory
multiple-selects
+
–
2
votes
1
answer
64
GATE Overflow Test Series | Operating Systems | Test 2 | Question: 15
Consider a machine with $8\; GB$ physical memory and a $34$-bit virtual address space. If the page size s $4\; KB,$ the approximate size of the page table assuming $3$ auxiliary bits (for protection, page replacement information etc.) on ... table entry will be _______ $\text{16 MB}$ $\text{8 MB}$ $\text{2 MB}$ $\text{12 MB}$
Consider a machine with $8\; GB$ physical memory and a $34$-bit virtual address space. If the page size s $4\; KB,$ the approximate size of the page table assuming $3$ au...
gatecse
185
views
gatecse
asked
Dec 7, 2020
Operating System
go2025-os-2
memory-management
paging
virtual-memory
+
–
2
votes
1
answer
65
GATE Overflow Test Series | Operating Systems | Test 2 | Question: 16
In a virtual memory system, size of the virtual address is $\text{64-bit}$, size of the physical address is $\text{60-bit},$ page size is $4\;\text{Kbyte}$ ... . The maximum number of bits that can be used for storing protection and other information in each page table entry is _______
In a virtual memory system, size of the virtual address is $\text{64-bit}$, size of the physical address is $\text{60-bit},$ page size is $4\;\text{Kbyte}$ and size of ea...
gatecse
158
views
gatecse
asked
Dec 7, 2020
Operating System
go2025-os-2
numerical-answers
memory-management
paging
virtual-memory
+
–
2
votes
1
answer
66
GATE Overflow Test Series | Operating Systems | Test 2 | Question: 17
Consider a system with byte-addressable memory, $\text{31-bit}$ logical addresses, $4\;\text{kilobyte}$ page size and page table entries of $8\;\text{bytes}$ each. The size of the page table in the system in $\text{megabytes}$ is ________
Consider a system with byte-addressable memory, $\text{31-bit}$ logical addresses, $4\;\text{kilobyte}$ page size and page table entries of $8\;\text{bytes}$ each. The si...
gatecse
113
views
gatecse
asked
Dec 7, 2020
Operating System
go2025-os-2
numerical-answers
memory-management
paging
virtual-memory
+
–
2
votes
1
answer
67
GATE Overflow Test Series | Operating Systems | Test 2 | Question: 18
A computer system implements huge pages of $1\;\text{megabyte}$ and a $\text{64-bit}$ physical address space. Each page table entry contains a valid bit, a dirty bit, two permission bits, and the translation. If ... process is $48\;\text{megabytes}$, the length of the virtual address supported by the system in bits is _________
A computer system implements huge pages of $1\;\text{megabyte}$ and a $\text{64-bit}$ physical address space. Each page table entry contains a valid bit, a dirty bit, two...
gatecse
237
views
gatecse
asked
Dec 7, 2020
Operating System
go2025-os-2
numerical-answers
memory-management
paging
virtual-memory
+
–
8
votes
2
answers
68
GATE Overflow Test Series | Operating Systems | Test 2 | Question: 19
A computer uses $\text{42-bit}$ virtual address, $\text{32-bit}$ physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table $(T_1)$, which occupies ... is $\text{32 bits}$ in size. The size of a page in $\text{KB}$ in this computer is ________
A computer uses $\text{42-bit}$ virtual address, $\text{32-bit}$ physical address, and a three–level paged page table organization. The page table base register stores ...
gatecse
357
views
gatecse
asked
Dec 7, 2020
Operating System
go2025-os-2
numerical-answers
memory-management
paging
virtual-memory
+
–
4
votes
1
answer
69
GATE Overflow Test Series | Operating Systems | Test 2 | Question: 20
If the virtual address space supported is $2^{64}\:\text{bits},$ the page size is $4\:\text{Kbyte,}$ the size of the physical memory is $2\:\text{GB,}$ the size of a PTE is four bytes for standard page table and eight bytes for inverted ... $2^{51}\;\text{bytes},\;2^{22}\;\text{bytes}$ $2^{50}\;\text{bytes},\;256\;\text{bytes}$
If the virtual address space supported is $2^{64}\:\text{bits},$ the page size is $4\:\text{Kbyte,}$ the size of the physical memory is $2\:\text{GB,}$ the size of a PTE ...
gatecse
388
views
gatecse
asked
Dec 7, 2020
Operating System
go2025-os-2
memory-management
paging
virtual-memory
+
–
4
votes
1
answer
70
GATE Overflow Test Series | Operating Systems | Test 2 | Question: 30
A computer uses $\text{48-bit}$ virtual address, $\text{32-bit}$ physical address, and a three-level paged page table organization with page size being $16\:\text{KB}.$ The processor used in the computer ... colours needed to guarantee that no two synonyms map to different sets in the processor cache of this computer is _________
A computer uses $\text{48-bit}$ virtual address, $\text{32-bit}$ physical address, and a three-level paged page table organization with page size being $16\:\text{KB}.$ T...
gatecse
570
views
gatecse
asked
Dec 7, 2020
Operating System
go2025-os-2
numerical-answers
memory-management
paging
virtual-memory
+
–
2
votes
4
answers
71
NIELIT 2017 DEC Scientific Assistant A - Section B: 9
Operating System maintains the page table for : each process each thread each instruction each address
Operating System maintains the page table for :each processeach threadeach instructioneach address
admin
17.3k
views
admin
asked
Mar 31, 2020
Operating System
nielit2017dec-assistanta
operating-system
paging
threads
+
–
2
votes
2
answers
72
NIELIT 2017 July Scientist B (CS) - Section B: 32
A CPU generates $32$-bit virtual addresses. The page size is $4$ KB. The processor has a Translation Look-aside Buffer (TLB) which can hold a total of $128$ page table entries and is $4$-way set associative. The minimum size of the TLB tag is $\text{11 bits}$ $\text{13 bits}$ $\text{15 bits}$ $\text{20 bits}$
A CPU generates $32$-bit virtual addresses. The page size is $4$ KB. The processor has a Translation Look-aside Buffer (TLB) which can hold a total of $128$ page table en...
admin
1.2k
views
admin
asked
Mar 30, 2020
Operating System
nielit2017july-scientistb-cs
operating-system
memory-management
paging
translation-lookaside-buffer
+
–
1
votes
2
answers
73
NIELIT 2017 DEC Scientist B - Section B: 16
Which of the following is added to the page table in order to track whether a page of cache has been modified since it was read from the memory? Reference bit Dirty bit Tag bit Valid bit
Which of the following is added to the page table in order to track whether a page of cache has been modified since it was read from the memory?Reference bitDirty bitTag ...
admin
3.2k
views
admin
asked
Mar 30, 2020
Operating System
nielit2017dec-scientistb
operating-system
memory-management
paging
cache-memory
+
–
1
votes
5
answers
74
UGC NET CSE | January 2017 | Part 2 | Question: 37
In a paging system, it takes $30$ ns to search translation Look-a-side Buffer (TLB) and $90$ ns to access the main memory. If the TLB hit ratio is $70\%$, the effective memory access time is : $48$ ns $147$ns $120$ns $84$ns
In a paging system, it takes $30$ ns to search translation Look-a-side Buffer (TLB) and $90$ ns to access the main memory. If the TLB hit ratio is $70\%$, the effective m...
go_editor
2.3k
views
go_editor
asked
Mar 24, 2020
Operating System
ugcnetjan2017ii
operating-system
paging
+
–
0
votes
0
answers
75
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 55 (Page No. 261 - 262)
Write a program that can be used to compare the effectiveness of adding a tag field to $TLB$ entries when control is toggled between two programs. The tag field is used to effectively label each entry with the ... for a simple (but nontrivial) input example. Plot the number of $TLB$ updates per $1000$ references.
Write a program that can be used to compare the effectiveness of adding a tag field to $TLB$ entries when control is toggled between two programs. The tag field is used t...
admin
362
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
translation-lookaside-buffer
descriptive
+
–
0
votes
0
answers
76
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 52 (Page No. 260 - 261)
Write a program that simulates a toy paging system that uses the $\text{WSClock}$ algorithm. The system is a toy in that we will assume there are no write references (not very realistic), and process ... references. Explain what is needed to extend the program to handle a page reference stream that also includes writes.
Write a program that simulates a toy paging system that uses the $\text{WSClock}$ algorithm. The system is a toy in that we will assume there are no write references (not...
admin
388
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
page-fault
descriptive
+
–
0
votes
0
answers
77
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 51 (Page No. 260)
Write a program that simulates a paging system using the aging algorithm. The number of page frames is a parameter. The sequence of page references should be read from a file. For a given input file, plot the number of page faults per $1000$ memory references as a function of the number of page frames available.
Write a program that simulates a paging system using the aging algorithm. The number of page frames is a parameter. The sequence of page references should be read from a ...
admin
528
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
page-fault
descriptive
+
–
0
votes
0
answers
78
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 50 (Page No. 260)
Plot a histogram and calculate the mean and median of the sizes of executable binary files on a computer to which you have access. On a Windows system, look at all .exe and .dll files; on a UNIX system look at ... of a page table entry. Assume that all programs are equally likely to be run and thus should be weighted equally.
Plot a histogram and calculate the mean and median of the sizes of executable binary files on a computer to which you have access. On a Windows system, look at all .exe a...
admin
382
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
descriptive
+
–
0
votes
0
answers
79
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 49 (Page No. 260)
Virtual memory provides a mechanism for isolating one process from another. What memory management difficulties would be involved in allowing two operating systems to run concurrently? How might these difficulties be addressed?
Virtual memory provides a mechanism for isolating one process from another. What memory management difficulties would be involved in allowing two operating systems to run...
admin
426
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
virtual-memory
descriptive
+
–
0
votes
1
answer
80
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 48 (Page No. 260)
Can you think of any situations where supporting virtual memory would be a bad idea, and what would be gained by not having to support virtual memory? Explain.
Can you think of any situations where supporting virtual memory would be a bad idea, and what would be gained by not having to support virtual memory? Explain.
admin
430
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
virtual-memory
paging
descriptive
+
–
1
votes
0
answers
81
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 47 (Page No. 259 - 260)
We consider a program which has the two segments shown below consisting of instructions in segment $0,$ and read/write data in segment $1.$ Segment $0$ has read/execute protection, and segment $1$ has just read/write protection. The ... $1,$ page $4,$ offset $28$ Jump to location in segment $1,$ page $3,$ offset $32$
We consider a program which has the two segments shown below consisting of instructions in segment $0,$ and read/write data in segment $1.$ Segment $0$ has read/execute p...
admin
772
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
page-fault
descriptive
+
–
0
votes
0
answers
82
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 46 (Page No. 259)
When segmentation and paging are both being used, as in $MULTICS,$ first the segment descriptor must be looked up, then the page descriptor. Does the $TLB$ also work this way, with two levels of lookup?
When segmentation and paging are both being used, as in $MULTICS,$ first the segment descriptor must be looked up, then the page descriptor. Does the $TLB$ also work this...
admin
296
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
segmentation
descriptive
+
–
0
votes
2
answers
83
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 45 (Page No. 259)
Explain the difference between internal fragmentation and external fragmentation. Which one occurs in paging systems? Which one occurs in systems using pure segmentation?
Explain the difference between internal fragmentation and external fragmentation. Which one occurs in paging systems? Which one occurs in systems using pure segmentation?...
admin
912
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
fragmentation
segmentation
descriptive
+
–
0
votes
0
answers
84
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 44 (Page No. 259)
A machine-language instruction to load a $32-bit$ word into a register contains the $32-bit$ address of the word to be loaded. What is the maximum number of page faults this instruction can cause?
A machine-language instruction to load a $32-bit$ word into a register contains the $32-bit$ address of the word to be loaded. What is the maximum number of page faults t...
admin
313
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
page-fault
descriptive
+
–
0
votes
0
answers
85
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 43 (Page No. 259)
A group of operating system designers for the Frugal Computer Company are thinking about ways to reduce the amount of backing store needed in their new operating system. The head guru has just suggested not bothering to save the ... this idea work for the program text? Under what conditions, if any, does it work for the data?
A group of operating system designers for the Frugal Computer Company are thinking about ways to reduce the amount of backing store needed in their new operating system. ...
admin
212
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
descriptive
+
–
1
votes
1
answer
86
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 42 (Page No. 259)
It has been observed that the number of instructions executed between page faults is directly proportional to the number of page frames allocated to a program. If the available memory is doubled, the mean interval between page faults ... page faults, how long would it take to run if twice as much memory were available?
It has been observed that the number of instructions executed between page faults is directly proportional to the number of page frames allocated to a program. If the ava...
admin
634
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
page-fault
descriptive
+
–
1
votes
2
answers
87
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 41 (Page No. 259)
A computer provides each process with $65,536$ bytes of address space divided into pages of $4096$ bytes each. A particular program has a text size of $32,768$ bytes, a data size of $16,386$ bytes, and a stack size of ... it then fit? Each page must contain either text, data, or stack, not a mixture of two or three of them.
A computer provides each process with $65,536$ bytes of address space divided into pages of $4096$ bytes each. A particular program has a text size of $32,768$ bytes, a d...
admin
2.4k
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
descriptive
+
–
0
votes
0
answers
88
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 40 (Page No. 259)
One of the first timesharing machines, the $DEC\: PDP-1,$ had a (core) memory of $4K\: 18-bit$ words. It held one process at a time in its memory. When the scheduler decided to run another process, the process in ... start writing (or reading) at any word, rather than only at word $0.$ Why do you suppose this drum was chosen?
One of the first timesharing machines, the $DEC\: PDP-1,$ had a (core) memory of $4K\: 18-bit$ words. It held one process at a time in its memory. When the scheduler deci...
admin
187
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
page-replacement
descriptive
+
–
0
votes
0
answers
89
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 39 (Page No. 259)
You have been hired by a cloud computing company that deploys thousands of servers at each of its data centers. They have recently heard that it would be worthwhile to handle a page fault at server A by reading ... local disk drive. How could that be done? Under what conditions would the approach be worthwhile? Be feasible?
You have been hired by a cloud computing company that deploys thousands of servers at each of its data centers. They have recently heard that it would be worthwhile to ha...
admin
272
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
page-fault
descriptive
+
–
1
votes
0
answers
90
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 35 (Page No. 258)
How long does it take to load a $64-KB$ program from a disk whose average seek time is $5\: msec,$ whose rotation time is $5 msec,$ and whose tracks hold $1\: MB$ for a $2-KB$ page size? for a ... around the disk and the number of cylinders is so large that the chance of two pages being on the same cylinder is negligible.
How long does it take to load a $64-KB$ program from a disk whose average seek time is $5\: msec,$ whose rotation time is $5 msec,$ and whose tracks hold $1\: MB$for a $2...
admin
375
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
page-replacement
descriptive
+
–
Page:
« prev
1
2
3
4
5
6
7
8
...
10
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register