GATE 2014
A system contains three programs and each requires three tape units for its operation. The minimum number of tape units Which the system must have such that deadlocks never arise is _____________.
Showing posts with label GATE BANKERS ALGORITHM. Show all posts
Showing posts with label GATE BANKERS ALGORITHM. Show all posts
GATE 2015 DEADLOCK BANKERS ALGO PYQ
GATE 2015
A system has 6 identical resources and N processes competing for them. Each process can request atmost 2 resources. Which one of the following values of N could lead to a deadlock?
(a) 1
(b) 2
(c) 3
(d) 4
GATE 2017 Bankers algorithm Dead lock PYQ
GATE 2017
A system shares 9 tape drives. The current allocation and maximum requirement of tape drives for three processes are shown below:
|
Process |
Current Allocation |
Maximum Requirement |
|
P1 |
3 |
7 |
|
P2 |
1 |
6 |
|
P3 |
3 |
5 |
Which of the following best describes current state of the system?
(a) Safe, Deadlocked
(b) Safe, Not Deadlocked
(c) Not Safe, Deadlocked
(d) Not Safe, Not Deadlocked
More subjects to read
- Cloud Computing
- Theory of Computation
- Computer Organization and Architecture
- Data Structure
- R Notes
- Software Engineering
- DBMS
- Operating Systems
- Linux
- Discrete Structure
- Computer Network
- Management Information System
- Advanced Computer Architecture
- Information Storage Management
- Network and Web Security
- Distributed System
- PHP Notes
- Web Engineering
- Python Programming
- Java Notes
- Compiler Design
- Principles of Programming Languages