Operating Systems
Process Concepts and Cpu Scheduling
Marks 1Marks 2
Synchronization and Concurrency
Marks 1Marks 2
Memory Management
Marks 1Marks 2Marks 5
File System IO and Protection
Marks 1Marks 2Marks 5
1
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
2
GATE CSE 1992
MCQ (Single Correct Answer)
+2
-0.6
A computer system has 6 tape drives, with n process completing for them. Each process may need 3 tape drives. The maximum value of n for which the system is guaranteed to be deadlock free is:
A
2
B
3
C
4
D
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