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 2004
MCQ (Single Correct Answer)
+1
-0.3
Consider the following statements with respect to user-level threads and kernel-supported threads.
i) Context switch is faster with kernel- supported threads
ii) For user-level threads, a system call can block the entire process
iii) Kernel-supported threads can be scheduled independently
iv) Use-level threads are transparent to the kernel

Which of the above statements are true?

A
(ii), (iii) & (iv) only
B
(ii) & (iii) only
C
(i) & (iii) only
D
(i) & (ii) only
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
A CPU has two modes-privileged and non-privileged. In order to change the mode from privileged to non-privileged
A
A hardware interrupt is needed
B
A software interrupt is needed
C
A privileged instruction (which does not generate an interrupt) is needed.
D
A non-privileged instruction (which does not generate an interrupt) is needed.
4
GATE CSE 2001
MCQ (Single Correct Answer)
+1
-0.3
Consider a set of $$n$$ tasks with known runtimes $${r_1},{r_2},.....\,{r_n}\,\,$$ to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput?.
A
Round -Robin
B
Shortest -Job -First
C
Highest-Response-Ratio-Next
D
First -Come-First-Served
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