The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register
|
I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 41 (Page No. 470)
0
votes
11
views
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.
tanenbaum
operating-system
deadlock
deadlock-prevention-avoidance-detection
bankers-algorithm
descriptive
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
54.8k
points)
|
11
views
answer
comment
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Prev. Qn. in Sub.
Next Qn. in Sub. →
← Prev.
Next →
Related questions
0
votes
1
answer
1
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 34 (Page No. 468)
Explain the differences between deadlock, livelock, and starvation.
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
54.8k
points)
|
19
views
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
deadlock
descriptive
0
votes
0
answers
2
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 preemption methods were developed to handle resource deadlock or for other purposes? How high is their overhead?
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
54.8k
points)
|
3
views
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
deadlock
descriptive
0
votes
0
answers
3
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 must first release whatever resources it already holds ( ... new resource but lose some of the existing ones to competing processes. Propose an improvement to this scheme.
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
54.8k
points)
|
5
views
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
deadlock
descriptive
0
votes
0
answers
4
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 money, the account to be credited, and the account to be ... , solutions that lock one account and then release it immediately if the other is locked are not allowed.)
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
54.8k
points)
|
8
views
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
deadlock
descriptive
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
TIFR and JEST exam
All categories
General Aptitude
1.9k
Engineering Mathematics
7.5k
Digital Logic
2.9k
Programming and DS
4.9k
Algorithms
4.3k
Theory of Computation
6.2k
Compiler Design
2.1k
Operating System
4.5k
Databases
4.1k
CO and Architecture
3.4k
Computer Networks
4.1k
Non GATE
1.5k
Others
1.5k
Admissions
595
Exam Queries
576
Tier 1 Placement Questions
23
Job Queries
72
Projects
17
Follow @csegate
Recent Blog Comments
i also don't have any pdf, actually, I added the...
i don't have , if you have upload it
@mohan123 Do you have all standard book...
bro can be upload all standard book questions in...
it'll take 3-4 days but for most purpose you can...
50,648
questions
56,422
answers
195,195
comments
99,836
users