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
1
GATE CSE 2000
MCQ (Single Correct Answer)
+1
-0.3
Let m[0] ..m[4] be mutexes (binary semaphores) and P[0] ...P[4] be processes. Suppose each process P[i] executes the following:

wait (m[i]); wait (m(m[(i+1) mod 4]))0;
.......
release (m[i]); release (m[(i+1) mod 4]);

This could cause
A
Thrashing
B
Deadlock
C
Starvation, but not the deadlock
D
None of the above
2
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
When the result of a computation depends on the speed of the processes involved there is said to be
A
Cycle stealing
B
Race condition
C
A time clock
D
A deadlock
3
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
A counting semaphore was initialized to 10. Then 6 P (wait) operations and 4 V (signal) operations were completed on this semaphore. The resulting value of the semaphore
A
0
B
8
C
10
D
12
4
GATE CSE 1996
MCQ (Single Correct Answer)
+1
-0.3
A critical section is a program segment
A
Which should run in certain specified amount of time
B
Which avoids deadlocks
C
Where shared resources are accessed
D
Which must be enclosed by a pair of semaphore operations, P and V
Previous
Questions Asked from Marks 1
GATE CSE 2024 Set 1 (1) GATE CSE 2019 (1) GATE CSE 2015 Set 1 (2) GATE CSE 2013 (1) GATE CSE 2010 (1) GATE CSE 2002 (1) GATE CSE 2001 (2) GATE CSE 2000 (1) GATE CSE 1998 (2) GATE CSE 1996 (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