1
GATE CSE 2002
MCQ (Single Correct Answer)
+1
-0.3
Which of the following scheduling algorithms is non-preemptive?
2
GATE CSE 2001
MCQ (Single Correct Answer)
+1
-0.3
Where does the swap space reside?
3
GATE CSE 2001
MCQ (Single Correct Answer)
+1
-0.3
Suppose a processor does not have any stack pointer register. Which of the following statements is true?
4
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
wait (m[i]); wait (m(m[(i+1) mod 4]))0;
.......
release (m[i]); release (m[(i+1) mod 4]);
This could cause
Questions Asked from Synchronization and Concurrency (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages