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 2010
MCQ (Single Correct Answer)
+1
-0.3
Consider the methods used by processes P1 and P2 for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables S1 and S2 are randomly assigned.

GATE CSE 2010 Operating Systems - Synchronization and Concurrency Question 31 English
Which of the following statement describes the properties achieved?
A
Mutual exclusion but not progress
B
Progress but not mutual exclusion
C
Neither mutual exclusion nor progress
D
Both mutual exclusion and progress
2
GATE CSE 2002
MCQ (Single Correct Answer)
+1
-0.3
Which of the following scheduling algorithms is non-preemptive?
A
Round Robin
B
First-In-First-Out
C
Multilevel Queue Scheduling
D
Multilevel Queue Scheduling with feedback
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?
A
It cannot have subroutine call instruction
B
It can have subroutine call instruction, but no nested subroutine calls
C
Nested subroutine calls are possible, but interrupts are not
D
All sequences of subroutine call and also interrupts are possible
4
GATE CSE 2001
MCQ (Single Correct Answer)
+1
-0.3
Where does the swap space reside?
A
RAM
B
Disk
C
ROM
D
On-chip cache
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