Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged descriptive
0
votes
0
answers
871
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 8 (Page No. 254)
The Intel $8086$ processor did not have an MMU or support virtual memory. Nevertheless, some companies sold systems that contained an unmodified $8086$ CPU and did paging. Make an educated guess as to how they did it. (Hint: Think about the logical location of the MMU.)
The Intel $8086$ processor did not have an MMU or support virtual memory. Nevertheless, some companies sold systems that contained an unmodified $8086$ CPU and did paging...
admin
341
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
virtual-memory
descriptive
+
–
1
votes
0
answers
872
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 7 (Page No. 254)
Using the page table of Fig. $3-9,$ give the physical address corresponding to each of the following virtual addresses: $20$ $4100$ $8300$
Using the page table of Fig. $3-9,$ give the physical address corresponding to each of the following virtual addresses:$20$$4100$$8300$
admin
605
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
virtual-memory
descriptive
+
–
0
votes
0
answers
873
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 6 (Page No. 254)
For each of the following decimal virtual addresses, compute the virtual page number and offset for a $4-KB$ page and for an $8 KB$ page$:20000, 32768, 60000.$
For each of the following decimal virtual addresses, compute the virtual page number and offset for a $4-KB$ page and for an $8 KB$ page$:20000, 32768, 60000.$
admin
364
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
virtual-memory
descriptive
+
–
1
votes
1
answer
874
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 5 (Page No. 254)
What is the difference between a physical address and a virtual address?
What is the difference between a physical address and a virtual address?
admin
486
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
memory-management
virtual-memory
descriptive
+
–
1
votes
2
answers
875
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 4 (Page No. 254)
Consider a swapping system in which memory consists of the following hole sizes in memory order: $10\: MB, 4\: MB, 20\: MB, 18\: MB, 7\: MB, 9\: MB, 12\: MB,$ and $15\: MB$. Which hole is taken for successive segment ... $10\: MB$ $9\: MB$ for first fit? Now repeat the question for best fit, worst fit, and next fit.
Consider a swapping system in which memory consists of the following hole sizes in memory order: $10\: MB, 4\: MB, 20\: MB, 18\: MB, 7\: MB, 9\: MB, 12\: MB,$ and $15\: M...
admin
6.3k
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
memory-management
descriptive
+
–
0
votes
2
answers
876
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...
admin
1.3k
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
memory-management
descriptive
+
–
0
votes
1
answer
877
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 2 (Page No. 254)
In Fig. $3-3$ the base and limit registers contain the same value, $16,384$. Is this just an accident, or are they always the same? It is just an accident, why are they the same in this example?
In Fig. $3-3$ the base and limit registers contain the same value, $16,384$. Is this just an accident, or are they always the same? It is just an accident, why are they t...
admin
1.6k
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
memory-management
descriptive
+
–
0
votes
1
answer
878
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 1 (Page No. 254)
The $IBM\:360$ had a scheme of locking $2-KB$ blocks by assigning each one a $4-bit$ key and having the CPU compare the key on every memory reference to the $4-bit$ key in the $PSW$. Name two drawbacks of this scheme not mentioned in the text.
The $IBM\:360$ had a scheme of locking $2-KB$ blocks by assigning each one a $4-bit$ key and having the CPU compare the key on every memory reference to the $4-bit$ key i...
admin
394
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
memory-management
descriptive
+
–
0
votes
0
answers
879
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 65 (Page No. 180)
Implement a program to count the frequency of words in a text file. The text file is partitioned into $N$ segments. Each segment is processed by a separate thread that outputs the intermediate frequency ... the threads complete; then it computes the consolidated word-frequency data based on the individual threads' output.
Implement a program to count the frequency of words in a text file. The text file is partitioned into $N$ segments. Each segment is processed by a separate thread that ou...
admin
367
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
descriptive
+
–
1
votes
0
answers
880
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 64 (Page No. 179 - 180)
The objective of this exercise is to implement a multithreaded solution to find if a given number is a perfect number. $N$ is a perfect number if the sum of all its factors, excluding itself, is $N;$ examples are ... can make the computation faster by restricting the numbers searched from $1$ to the square root of $N.)$
The objective of this exercise is to implement a multithreaded solution to find if a given number is a perfect number. $N$ is a perfect number if the sum of all its facto...
admin
372
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
multithreaded
semaphore
descriptive
+
–
0
votes
0
answers
881
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 63 (Page No. 179)
A process can be put into a round-robin queue more than once to give it a higher priority. Running multiple instances of a program each working on a different part of a data pool can have the same effect. First write a ... but on a system with other processes, you should be able to grab a bigger share of the CPU this way.
A process can be put into a round-robin queue more than once to give it a higher priority. Running multiple instances of a program each working on a different part of a d...
admin
333
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
process-scheduling
descriptive
+
–
0
votes
0
answers
882
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 62 (Page No. 179)
Write a producer-consumer problem that uses threads and shares a common buffer. However, do not use semaphores or any other synchronization primitives to guard the shared data structures. Just let each thread access them when ... Do not print more than one number every minute because the I/O could affect the race conditions.
Write a producer-consumer problem that uses threads and shares a common buffer. However, do not use semaphores or any other synchronization primitives to guard the shared...
admin
725
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
semaphore
process-synchronization
descriptive
+
–
0
votes
0
answers
883
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 61 (Page No. 179)
Rewrite the program of Fig. $2-23$ to handle more than two processes.
Rewrite the program of Fig. $2-23$ to handle more than two processes.
admin
226
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
descriptive
+
–
0
votes
0
answers
884
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 60 (Page No. 179)
Suppose that a university wants to show off how politically correct it is by applying the U.S. Supreme Court's Separate but equal is inherently unequal'' doctrine to gender as well ... : woman_wants_to_enter, man_wants_to_enter, woman_leaves, man_leaves. You may use whatever counters and synchronization techniques you like.
Suppose that a university wants to show off how politically correct it is by applying the U.S. Supreme Court’s ‘‘Separate but equal is inherently unequal’’ doct...
admin
794
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
process-synchronization
semaphore
descriptive
+
–
0
votes
0
answers
885
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 59 (Page No. 179)
Solve the dining philosophers problem using monitors instead of semaphores.
Solve the dining philosophers problem using monitors instead of semaphores.
admin
348
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
semaphore
monitors
descriptive
+
–
0
votes
0
answers
886
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 58 (Page No. 179)
Assume that you have an operating system that provides semaphores. Implement a message system. Write the procedures for sending and receiving messages.
Assume that you have an operating system that provides semaphores. Implement a message system. Write the procedures for sending and receiving messages.
admin
360
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
semaphore
descriptive
+
–
0
votes
0
answers
887
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 57 (Page No. 178 - 179)
Write a shell script that produces a file of sequential numbers by reading the last number in the file, adding $1$ to it, and then appending it to the file. Run one instance of the script in the background and one in ... region? Modify the script to prevent the race. (Hint: use ln file file.lock to lock the data file.)
Write a shell script that produces a file of sequential numbers by reading the last number in the file, adding $1$ to it, and then appending it to the file. Run one insta...
admin
196
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
descriptive
+
–
0
votes
0
answers
888
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 56 (Page No. 178)
The readers and writers problem can be formulated in several ways with regard to which category of processes can be started when. Carefully describe three different variations of the problem, each one favoring (or not ... reader or a writer becomes ready to access the database, and what happens when a process is finished.
The readers and writers problem can be formulated in several ways with regard to which category of processes can be started when. Carefully describe three different varia...
admin
304
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
process-synchronization
descriptive
+
–
0
votes
0
answers
889
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 55 (Page No. 178)
Consider the procedure put forks in Fig. $2-47$. Suppose that the variable $state[i]$ was set to THINKING after the two calls to test, rather than before. How would this change affect the solution?
Consider the procedure put forks in Fig. $2-47$. Suppose that the variable $state[i]$ was set to THINKING after the two calls to test, rather than before. How would this ...
admin
181
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
descriptive
+
–
0
votes
0
answers
890
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 54 (Page No. 178)
In the solution to the dining philosophers problem (Fig. $2-47$), why is the state variable set to HUNGRY in the procedure take_forks?
In the solution to the dining philosophers problem (Fig. $2-47$), why is the state variable set to HUNGRY in the procedure take_forks?
admin
191
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
dining-philosophers-problem
descriptive
+
–
0
votes
0
answers
891
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 53 (Page No. 178)
Consider a system in which it is desired to separate policy and mechanism for the scheduling of kernel threads. Propose a means of achieving this goal.
Consider a system in which it is desired to separate policy and mechanism for the scheduling of kernel threads. Propose a means of achieving this goal.
admin
593
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
process-scheduling
threads
descriptive
+
–
0
votes
1
answer
892
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...
admin
1.3k
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
process-scheduling
descriptive
+
–
1
votes
0
answers
893
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 51 (Page No. 178)
In the dining philosophers problem, let the following protocol be used: An even-numbered philosopher always picks up his left fork before picking up his right fork; an odd-numbered philosopher always picks up his right fork before picking up his left fork. Will this protocol guarantee deadlock-free operation?
In the dining philosophers problem, let the following protocol be used: An even-numbered philosopher always picks up his left fork before picking up his right fork; an od...
admin
548
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
deadlock-prevention-avoidance-detection
descriptive
+
–
1
votes
2
answers
894
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...
admin
2.8k
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
process-scheduling
descriptive
+
–
1
votes
1
answer
895
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...
admin
2.2k
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
process-scheduling
descriptive
+
–
0
votes
0
answers
896
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 48 (Page No. 178)
For the above problem, can another video stream be added and have the system still be schedulable?
For the above problem, can another video stream be added and have the system still be schedulable?
admin
309
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
process-scheduling
descriptive
+
–
0
votes
1
answer
897
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 47 (Page No. 178)
Consider a real-time system with two voice calls of periodicity $5$ msec each with CPU time per call of $1$ msec, and one video stream of periodicity $33$ ms with CPU time per call of $11$ msec. Is this system schedulable?
Consider a real-time system with two voice calls of periodicity $5$ msec each with CPU time per call of $1$ msec, and one video stream of periodicity $33$ ms with CPU tim...
admin
1.3k
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
process-scheduling
descriptive
+
–
1
votes
1
answer
898
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)?
admin
749
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
process-scheduling
descriptive
+
–
0
votes
0
answers
899
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 45 (Page No. 177 - 178)
Five batch jobs. $A$ through $E$, arrive at a computer center at almost the same time. They have estimated running times of $10, 6, 2, 4,$ and $8$ ... through $(d),$ assume that only one job at a time runs, until it finishes. All jobs are completely CPU bound.
Five batch jobs. $A$ through $E$, arrive at a computer center at almost the same time. They have estimated running times of $10, 6, 2, 4,$ and $8$ minutes. Their (externa...
admin
600
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
process-scheduling
descriptive
+
–
0
votes
1
answer
900
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...
admin
3.0k
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
process-scheduling
descriptive
+
–
Page:
« prev
1
...
25
26
27
28
29
30
31
32
33
34
35
...
91
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
