Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by `JEET
0
votes
151
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 36 (Page No. 335)
Consider the idea behind Fig. $4-21,$ but now for a disk with a mean seek time of $6\: msec,$ a rotational rate of $15,000\: rpm,$ and $1,048,576$ bytes per track. What are the data rates for block sizes of $1\: KB, 2\: KB,$ and $4\: KB,$ respectively?
Consider the idea behind Fig. $4-21,$ but now for a disk with a mean seek time of $6\: msec,$ a rotational rate of $15,000\: rpm,$ and $1,048,576$ bytes per track. What a...
1.0k
views
answered
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
disk
descriptive
+
–
0
votes
152
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 4 (Page No. 333)
Is the open system call in $UNIX$ absolutely essential? What would the consequences be of not having it?
Is the open system call in $UNIX$ absolutely essential? What would the consequences be of not having it?
622
views
answered
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
unix
descriptive
+
–
0
votes
153
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 39 (Page No. 336)
Files in $MS-DOS$ have to compete for space in the $FAT -16$ table in memory. If one file uses $k$ entries, that is $k$ entries that are not available to any other file, what constraint does this place on the total length of all files combined?
Files in $MS-DOS$ have to compete for space in the $FAT -16$ table in memory. If one file uses $k$ entries, that is $k$ entries that are not available to any other file, ...
222
views
answered
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
file-allocation-table
descriptive
+
–
0
votes
154
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 37 (Page No. 335)
A certain file system uses $4-KB$ disk blocks. The median file size is $1 KB.$ If all files were exactly $1 KB,$ what fraction of the disk space would be wasted? Do you think the wastage for a real file system will be higher than this number or lower than it? Explain your answer.
A certain file system uses $4-KB$ disk blocks. The median file size is $1 KB.$ If all files were exactly $1 KB,$ what fraction of the disk space would be wasted? Do you t...
1.2k
views
answered
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
disk
descriptive
+
–
3
votes
155
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 38 (Page No. 336)
Given a disk-block size of $4\: KB$ and block-pointer address value of $4$ bytes, what is the largest file size (in bytes) that can be accessed using $10$ direct addresses and one indirect block?
Given a disk-block size of $4\: KB$ and block-pointer address value of $4$ bytes, what is the largest file size (in bytes) that can be accessed using $10$ direct addresse...
2.1k
views
answered
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
disk
descriptive
+
–
0
votes
156
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 52 (Page No. 178)
A real-time system needs to handle two voice calls that each run every $6$ msec and consume $1$ msec of CPU time per burst, plus one video at $25$ frames/sec, with each frame requiring $20$ msec of CPU time. Is this system schedulable?
A real-time system needs to handle two voice calls that each run every $6$ msec and consume $1$ msec of CPU time per burst, plus one video at $25$ frames/sec, with each f...
1.3k
views
answered
Oct 26, 2019
Operating System
tanenbaum
operating-system
process-and-threads
process-scheduling
descriptive
+
–
1
votes
157
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 33 (Page No. 176)
If a system has only two processes, does it make sense to use a barrier to synchronize them? Why or why not?
If a system has only two processes, does it make sense to use a barrier to synchronize them? Why or why not?
1.1k
views
answered
Oct 26, 2019
Operating System
tanenbaum
operating-system
process-and-threads
process-synchronization
descriptive
+
–
1
votes
158
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 38 (Page No. 177)
The $CDC\: 6600$ computers could handle up to $10\: I/O$ processes simultaneously using an interesting form of round-robin scheduling called processor sharing. A process switch occurred after each instruction, so ... the absence of competition, how much time would it need if processor sharing was used with n processes?
The $CDC\: 6600$ computers could handle up to $10\: I/O$ processes simultaneously using an interesting form of round-robin scheduling called processor sharing. A process ...
839
views
answered
Oct 26, 2019
Operating System
tanenbaum
operating-system
process-and-threads
process-synchronization
descriptive
+
–
0
votes
159
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 31 (Page No. 176)
How could an operating system that can disable interrupts implement semaphores?
How could an operating system that can disable interrupts implement semaphores?
1.1k
views
answered
Oct 26, 2019
Operating System
tanenbaum
operating-system
process-and-threads
interrupts
semaphore
descriptive
+
–
0
votes
160
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 21 (Page No. 175)
Consider a system in which threads are implemented entirely in user space, with the run-time system getting a clock interrupt once a second. Suppose that a clock interrupt occurs while some thread is executing in the run-time system. What problem might occur? Can you suggest a way to solve it?
Consider a system in which threads are implemented entirely in user space, with the run-time system getting a clock interrupt once a second. Suppose that a clock interrup...
1.3k
views
answered
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
interrupts
descriptive
+
–
0
votes
161
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 16 (Page No. 175)
Can a thread ever be preempted by a clock interrupt? If so, under what circumstances? If not, why not?
Can a thread ever be preempted by a clock interrupt? If so, under what circumstances? If not, why not?
1.7k
views
answered
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
interrupts
descriptive
+
–
0
votes
162
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 13 (Page No. 174)
In the text, we described a multithreaded Web server, showing why it is better than a single-threaded server and a finite-state machine server. Are there any circumstances in which a single-threaded server might be better? Give an example.
In the text, we described a multithreaded Web server, showing why it is better than a single-threaded server and a finite-state machine server. Are there any circumstance...
741
views
answered
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
descriptive
+
–
1
votes
163
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 14 (Page No. 175)
In Fig. $2-12$ the register set is listed as a per-thread rather than a per-process item. Why? After all, the machine has only one set of registers.
In Fig. $2-12$ the register set is listed as a per-thread rather than a per-process item. Why? After all, the machine has only one set of registers.
1.2k
views
answered
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
descriptive
+
–
1
votes
164
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 15 (Page No. 175)
Why would a thread ever voluntarily give up the CPU by calling thread yield? After all, since there is no periodic clock interrupt, it may never get the CPU back.
Why would a thread ever voluntarily give up the CPU by calling thread yield? After all, since there is no periodic clock interrupt, it may never get the CPU back.
1.7k
views
answered
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
interrupts
descriptive
+
–
0
votes
165
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 2 (Page No. 174)
Suppose that you were to design an advanced computer architecture that did process switching in hardware, instead of having interrupts. What information would the CPU need? Describe how the hardware process switching might work.
Suppose that you were to design an advanced computer architecture that did process switching in hardware, instead of having interrupts. What information would the CPU nee...
917
views
answered
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
interrupts
descriptive
+
–
0
votes
166
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 11 (Page No. 174)
If a multithreaded process forks, a problem occurs if the child gets copies of all the parent’s threads. Suppose that one of the original threads was waiting for keyboard input. Now two threads are waiting for keyboard input, one in each process. Does this problem ever occur in single-threaded processes?
If a multithreaded process forks, a problem occurs if the child gets copies of all the parent’s threads. Suppose that one of the original threads was waiting for keyboa...
1.3k
views
answered
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
threads
descriptive
+
–
0
votes
167
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 3 (Page No. 254)
A swapping system eliminates holes by compaction. Assuming a random distribution of many holes and many data segments and a time to read or write a $32-bit$ memory word of $4\:nsec$, about how long does it take to ... simplicity, assume that word $0$ is part of a hole and that the highest word in memory contains valid data.
A swapping system eliminates holes by compaction. Assuming a random distribution of many holes and many data segments and a time to read or write a $32-bit$ memory word o...
1.3k
views
answered
Oct 25, 2019
Operating System
tanenbaum
operating-system
memory-management
descriptive
+
–
0
votes
168
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 35 (Page No. 176)
Synchronization within monitors uses condition variables and two special operations, wait and signal. A more general form of synchronization would be to have a single primitive, waituntil, that had an arbitrary Boolean predicate as ... or Brinch Hansen, but it is not used. Why not? (Hint: Think about the implementation.)
Synchronization within monitors uses condition variables and two special operations, wait and signal. A more general form of synchronization would be to have a single pri...
681
views
answered
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
process-synchronization
semaphore
descriptive
+
–
0
votes
169
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 18 (Page No. 175)
What is the biggest advantage of implementing threads in user space? What is the biggest disadvantage?
What is the biggest advantage of implementing threads in user space? What is the biggest disadvantage?
296
views
answered
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
descriptive
+
–
1
votes
170
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 4 (Page No. 174)
When an interrupt or a system call transfers control to the operating system, a kernel stack area separate from the stack of the interrupted process is generally used. Why?
When an interrupt or a system call transfers control to the operating system, a kernel stack area separate from the stack of the interrupted process is generally used. Wh...
2.0k
views
answered
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
system-call
threads
descriptive
+
–
2
votes
171
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 3 (Page No. 174)
On all current computers, at least part of the interrupt handlers are written in assembly language. Why?
On all current computers, at least part of the interrupt handlers are written in assembly language. Why?
2.3k
views
answered
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
interrupts
descriptive
+
–
1
votes
172
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 7 (Page No. 174)
Multiple jobs can run in parallel and finish faster than if they had run sequentially. Suppose that two jobs, each needing $20$ minutes of CPU time, start simultaneously. How long will the last one take to complete if they run sequentially? How long if they run in parallel? Assume $50\%$ I/O wait.
Multiple jobs can run in parallel and finish faster than if they had run sequentially. Suppose that two jobs, each needing $20$ minutes of CPU time, start simultaneously....
1.9k
views
answered
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
descriptive
+
–
3
votes
173
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 8 (Page No. 174)
Consider a multiprogrammed system with degree of $6$ (i.e., six programs in memory at the same time). Assume that each process spends $40\%$ of its time waiting for I/O. What will be the CPU utilization?
Consider a multiprogrammed system with degree of $6$ (i.e., six programs in memory at the same time). Assume that each process spends $40\%$ of its time waiting for I/O. ...
2.8k
views
answered
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
descriptive
+
–
0
votes
174
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 5 (Page No. 174)
A computer system has enough room to hold five programs in its main memory. These programs are idle waiting for I/O half the time. What fraction of the CPU time is wasted?
A computer system has enough room to hold five programs in its main memory. These programs are idle waiting for I/O half the time. What fraction of the CPU time is wasted...
3.9k
views
answered
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
descriptive
+
–
0
votes
175
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 6 (Page No. 174)
A computer has $4$ GB of RAM of which the operating system occupies $512$ MB. The processes are all $256$ MB (for simplicity) and have the same characteristics. If the goal is $99\%$ CPU utilization, what is the maximum I/O wait that can be tolerated?
A computer has $4$ GB of RAM of which the operating system occupies $512$ MB. The processes are all $256$ MB (for simplicity) and have the same characteristics. If the go...
4.4k
views
answered
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
descriptive
+
–
1
votes
176
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 43 (Page No. 177)
Measurements of a certain system have shown that the average process runs for a time $T$ before blocking on $I/O$. A process switch requires a time $S$, which is effectively wasted (overhead). For round-robin scheduling with quantum $Q$, give a formula ... $Q > T$ $S < Q < T $ $Q = S$ $Q\: \text{nearly}\: 0$
Measurements of a certain system have shown that the average process runs for a time $T$ before blocking on $I/O$. A process switch requires a time $S$, which is effectiv...
2.0k
views
answered
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
process-scheduling
round-robin-scheduling
descriptive
+
–
2
votes
177
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 50 (Page No. 178)
A soft real-time system has four periodic events with periods of $50, 100, 200,$ and $250$ msec each. Suppose that the four events require $35, 20, 10,$ and $x$ msec of CPU time, respectively. What is the largest value of $x$ for which the system is schedulable?
A soft real-time system has four periodic events with periods of $50, 100, 200,$ and $250$ msec each. Suppose that the four events require $35, 20, 10,$ and $x$ msec of C...
2.8k
views
answered
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
process-scheduling
descriptive
+
–
0
votes
178
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 49 (Page No. 178)
The aging algorithm with $a = 1/2$ is being used to predict run times. The previous four runs, from oldest to most recent, are $40, 20, 40,$ and $15$ msec. What is the prediction of the next time?
The aging algorithm with $a = 1/2$ is being used to predict run times. The previous four runs, from oldest to most recent, are $40, 20, 40,$ and $15$ msec. What is the pr...
2.2k
views
answered
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
process-scheduling
descriptive
+
–
1
votes
179
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 46 (Page No. 178)
A process running on $CTSS$ needs $30$ quanta to complete. How many times must it be swapped in, including the very first time (before it has run at all)?
A process running on $CTSS$ needs $30$ quanta to complete. How many times must it be swapped in, including the very first time (before it has run at all)?
722
views
answered
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
process-scheduling
descriptive
+
–
2
votes
180
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 44 (Page No. 177)
Five jobs are waiting to be run. Their expected run times are $9, 6, 3, 5,$ and $X$. In what order should they be run to minimize average response time? $($Your answer will depend on $X.)$
Five jobs are waiting to be run. Their expected run times are $9, 6, 3, 5,$ and $X$. In what order should they be run to minimize average response time? $($Your answer wi...
2.9k
views
answered
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
process-scheduling
descriptive
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
...
14
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
