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
1
GATE CSE 1996
Subjective
+5
-0
A computer system uses the Banker’s Algorithm to deal with deadlocks. Its current state is shown in the tables below, where P0, P1, P2 are processes and R0, R1, R2 are resource types. GATE CSE 1996 Operating Systems - Deadlocks Question 11 English
(a) Show that the system can be in this state.
(b) What will the system do on a request by process P0 for one unit of resource type R1?
2
GATE CSE 1994
Subjective
+5
-0
Consider the resource allocation graph given in the figure. GATE CSE 1994 Operating Systems - Deadlocks Question 12 English
(a) Find if the system is in a deadlock state.
(b) Otherwise, find a safe sequence.
Questions Asked from Marks 5
GATE CSE 1996 (1) GATE CSE 1994 (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