ExamSIDE
Questions (Powered by ExamGOAL)
Operating Systems
Process Concepts and Cpu Scheduling
Marks 1Marks 2
Synchronization and Concurrency
Marks 1Marks 2
Deadlocks
Marks 1Marks 2Marks 5
Memory Management
Marks 1Marks 2Marks 5
File System IO and Protection
Marks 1Marks 2Marks 5
Previous Next
1
GATE CSE 2005
MCQ (Single Correct Answer)
+2
-0.6
Suppose n processes, P1,......., Pn share m identical resource units, which can be reserved and released one at a time. The maximum resource requirement of process Pi is Si, where Si > 0. Which one of the following is a sufficient condition for ensuring that deadlock does not occur?
A
$$\forall i,{s_i} < m$$
B
$$\forall i,{s_i} < n$$
C
$$\sum\limits_{i = 1}^n {{s_i}} < \left( {m + n} \right)$$
D
$$\sum\limits_{i = 1}^n {{s_i}} < \left( {m \times n} \right)$$
2
GATE CSE 2000
MCQ (Single Correct Answer)
+2
-0.6
Which of the following is NOT a valid deadlock prevention scheme?
A
Release all resources before requesting a new resource
B
Number the resources uniquely and never request a lower numbered resource than the last one requested.
C
Never request a resource after releasing any resource
D
Request and all required resources be allocated before execution.
3
GATE CSE 1997
MCQ (Single Correct Answer)
+2
-0.6
An operating system contains 3 user processes each requiring 2 units of resource R.The minimum number of units of R such that no deadlocks will ever arise is
A
3
B
5
C
4
D
6
4
GATE CSE 1993
MCQ (Single Correct Answer)
+2
-0.6
Consider a system having m resources of the same type. These resources are shared by 3 processes A, B and C, which have peak demands of 3, 4 and 6 respectively. For what value of m deadlock will not occur?
A
7
B
9
C
10
D
13
Previous Next
Questions Asked from Marks 2
GATE CSE 2025 Set 2 (1) GATE CSE 2024 Set 2 (1) GATE CSE 2021 Set 1 (1) GATE CSE 2019 (1) GATE CSE 2018 (1) GATE CSE 2016 Set 2 (1) GATE CSE 2015 Set 3 (1) GATE CSE 2014 Set 2 (1) GATE CSE 2014 Set 1 (1) GATE CSE 2010 (1) GATE CSE 2009 (1) GATE CSE 2008 (1) GATE CSE 2007 (1) GATE CSE 2006 (1) GATE CSE 2005 (1) GATE CSE 2000 (1) GATE CSE 1997 (1) GATE CSE 1993 (1) GATE CSE 1992 (1)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization