Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged tanenbaum
144
views
0
answers
1
votes
Andrew S. Tanenbaum (MOS) Edition 5 Exercise 3 Question 16 (Page No. 252)
The 32-bit Linux kernel supports a maximum of 32768 processes in the process table, and the kernel is allocated 1,073,741,824 (1 GiB) of the virtual ... allocated to each process at a minimum, with the maximum number of processes running?
sofigenr
144
views
sofigenr
asked
Apr 18
Operating System
tanenbaum
operating-system
memory-management
virtual-memory
+
–
607
views
1
answers
0
votes
ANDREW S. TANENBAUM, chapter 5
How many packets will be generated if you apply the simple flooding technique on the network in the above diagram fig-1 to make sure that each of the nodes receives at least one copy of the packet?
irfan_cse
607
views
irfan_cse
asked
Mar 30, 2023
Computer Networks
tanenbaum
computer-networks
+
–
765
views
1
answers
2
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 44 (Page No. 470)
In certain countries, when two people meet they bow to each other. The protocol is that one of them bows first and stays down until the other one bows. If ... time, they will both stay bowed forever. Write a program that does not deadlock.
admin
765
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
842
views
0
answers
0
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 43 (Page No. 470)
Write a program that detects if there is a deadlock in the system by using a resource allocation graph. Your program should read from a file the ... , the program should print out the identities of all processes that are deadlocked.
admin
842
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
resource-allocation
descriptive
+
–
356
views
0
answers
0
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 42 (Page No. 470)
Write a program to implement the deadlock detection algorithm with multiple resources of each type. Your program should read from a file the following inputs ... program should print out the identities of all processes that are deadlocked.
admin
356
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
449
views
0
answers
0
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 41 (Page No. 470)
Program a simulation of the banker’s algorithm. Your program should cycle through each of the bank clients asking for a request and evaluating whether it is safe or unsafe. Output a log of requests and decisions to a file.
admin
449
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
bankers-algorithm
descriptive
+
–
355
views
0
answers
0
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 40 (Page No. 469)
Repeat the previous problem, but now avoid starvation. When a baboon that wants to cross to the east arrives at the rope and finds baboons crossing to the west ... are allowed to start until at least one baboon has crossed the other way.
admin
355
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
starvation
descriptive
+
–
605
views
0
answers
0
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 39 (Page No. 469)
A student majoring in anthropology and minoring in computer science has embarked on a research project to see if African baboons can be taught about ... series of eastward-moving baboons holding up the westward-moving baboons indefinitely.
admin
605
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
semaphore
descriptive
+
–
714
views
0
answers
0
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 38 (Page No. 469)
Cinderella and the Prince are getting divorced. To divide their property, they have agreed on the following algorithm. Every morning, each one may send ... negotiating. Why? Is deadlock possible? Is starvation possible? Discuss your answer.
admin
714
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
264
views
0
answers
0
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 37 (Page No. 469)
A program contains an error in the order of cooperation and competition mechanisms, resulting in a consumer process locking a mutex (mutual exclusion ... resource deadlock or a communication deadlock? Suggest methods for its control.
admin
264
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
252
views
0
answers
0
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 36 (Page No. 468 - 469)
Local Area Networks utilize a media access method called CSMA/CD, in which stations sharing a bus can sense the medium and detect transmissions as well as ... you suggest a solution to this anomaly?Can starvation occur with this scenario?
admin
252
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
218
views
0
answers
0
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 35 (Page No. 468)
Assume two processes are issuing a seek command to reposition the mechanism to access the disk and enable a read command. Each process is interrupted before ... or a livelock? What methods would you recommend to handle the anomaly?
admin
218
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
520
views
1
answers
0
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 34 (Page No. 468)
Explain the differences between deadlock, livelock, and starvation.
admin
520
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
265
views
0
answers
0
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 33 (Page No. 468)
Main memory units are preempted in swapping and virtual memory systems. The processor is preempted in time-sharing environments. Do you think that these ... handle resource deadlock or for other purposes? How high is their overhead?
admin
265
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
380
views
0
answers
0
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 32 (Page No. 468)
A computer science student assigned to work on deadlocks thinks of the following brilliant way to eliminate deadlocks. When a process requests a resource, it ... were the professor, what grade would you give this proposal and why?
admin
380
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
deadlock-prevention-avoidance-detection
descriptive
+
–
795
views
2
answers
0
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 31 (Page No. 468)
One way to prevent deadlocks is to eliminate the hold-and-wait condition. In the text it was proposed that before asking for a new resource, a process ... of the existing ones to competing processes. Propose an improvement to this scheme.
admin
795
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
609
views
1
answers
0
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 30 (Page No. 468)
In an electronic funds transfer system, there are hundreds of identical processes that work as follows. Each process reads an input line specifying an amount of ... and then release it immediately if the other is locked are not allowed.)
admin
609
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
854
views
1
answers
0
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 29 (Page No. 468)
A distributed system using mailboxes has two $IPC$ primitives, send and receive. The latter primitive specifies a process to receive from and blocks if ... need to communicate frequently about other matters. Is deadlock possible? Discuss.
admin
854
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
616
views
1
answers
0
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 28 (Page No. 468)
Two processes, $A$ and $B,$ each need three records, $1, 2,$ and $3,$ in a database. If $A$ ... each process can request them. What fraction of all the combinations is guaranteed to be deadlock free?
admin
616
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
374
views
0
answers
2
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 27 (Page No. 467)
One way to eliminate circular wait is to have rule saying that a process is entitled only to a single resource at any moment. Give an example to show that this restriction is unacceptable in many cases.
admin
374
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
2.3k
views
2
answers
1
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 26 (Page No. 467)
A system has four processes and five allocatable resources. The current allocation and maximum needs are as follows:What is the smallest value of x for which this is a safe state?
admin
2.3k
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
1.3k
views
1
answers
0
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 25 (Page No. 467)
The banker's algorithm is being run in a system with $m$ resource classes and $n$ processes. In the limit of large $m$ and $n,$ the number of operations that must be performed to ... to $m^{a} n^{b}.$ What are the values of $a$ and $b?$
admin
1.3k
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
636
views
0
answers
0
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 24 (Page No. 467)
Suppose that process $A$ in Fig. 6-12 requests the last tape drive. Does this action lead to a deadlock?
admin
636
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
1.8k
views
1
answers
0
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 23 (Page No. 467)
Consider the previous problem again, but now with $p$ processes each needing a maximum of $m$ resources and a total of $r$ resources available. What condition must hold to make the system deadlock free?
admin
1.8k
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
3.6k
views
1
answers
0
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 22 (Page No. 467)
A system has two processes and three identical resources. Each process needs a maximum of two resources. Is deadlock possible? Explain your answer.
admin
3.6k
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
959
views
1
answers
0
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 21 (Page No. 467)
Take a careful look at Fig. 6-11(b). If $D$ asks for one more unit, does this lead to a safe state or an unsafe one? What if the request came from $C$ instead of $D?$
admin
959
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
1.2k
views
1
answers
4
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 20 (Page No. 467)
Can a system be in a state that is neither deadlocked nor safe? If so, give an example. If not, prove that all states are either deadlocked or safe.
admin
1.2k
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
272
views
0
answers
0
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 19 (Page No. 467)
In theory, resource trajectory graphs could be used to avoid deadlocks. By clever scheduling, the operating system could avoid unsafe regions. Is there a practical way of actually doing this?
admin
272
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
389
views
0
answers
0
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 18 (Page No. 467)
Can the resource trajectory scheme of Fig. 6-8 also be used to illustrate the problem of deadlocks with three processes and three resources? If so, how can this be done? If not, why not?
admin
389
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
249
views
0
answers
0
votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 17 (Page No. 467)
All the trajectories in Fig. 6-8 are horizontal or vertical. Can you envision any circumstances in which diagonal trajectories are also possible?
admin
249
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
Page:
1
2
3
4
5
6
...
16
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register