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 Next
1
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
2
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
3
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
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
A
Thrashing
B
Deadlock
C
Starvation, but not the deadlock
D
None of the above
Previous Next
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