GATE CSE 2002 | Synchronization and Concurrency Question 20 | Operating Systems

PREVIOUS NEXT

GATE CSE 2002

MCQ (Single Correct Answer)

-0.3

Which of the following scheduling algorithms is non-preemptive?

Round Robin

First-In-First-Out

Multilevel Queue Scheduling

Multilevel Queue Scheduling with feedback

GATE CSE 2001

MCQ (Single Correct Answer)

-0.3

Suppose a processor does not have any stack pointer register. Which of the following statements is true?

It cannot have subroutine call instruction

It can have subroutine call instruction, but no nested subroutine calls

Nested subroutine calls are possible, but interrupts are not

All sequences of subroutine call and also interrupts are possible

GATE CSE 2001

MCQ (Single Correct Answer)

-0.3

Where does the swap space reside?

RAM

Disk

ROM

On-chip cache

GATE CSE 2000

MCQ (Single Correct Answer)

-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

Thrashing

Deadlock

Starvation, but not the deadlock

None of the above

PREVIOUS NEXT

GATE CSE Subjects

Discrete Mathematics

Graph Theory Set Theory & Algebra Combinatorics Mathematical Logic Probability Linear Algebra Calculus

Programming Languages

Basic of Programming Language Function and Recursion Pointer and Structure in C

Theory of Computation

Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine Undecidability

Operating Systems

Process Concepts and Cpu Scheduling Synchronization and Concurrency Deadlocks Memory Management File System IO and Protection

Digital Logic

K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits

Computer Organization

Computer Arithmetic Memory Interfacing Pipelining Machine Instructions and Addressing Modes Alu Data Path and Control Unit IO Interface Secondary Memory

Database Management System

Structured Query Language Transactions and Concurrency Functional Dependencies and Normalization Relational Algebra File Structures and Indexing Er Diagrams

Data Structures

Trees Hashing Arrays Linked List Graphs Stacks and Queues

Computer Networks

Concepts of Layering Lan Technologies and Wi-Fi Data Link Layer and Switching Network Layer Routing Algorithm TCP UDP Sockets and Congestion Control Application Layer Protocol Network Security

Algorithms

Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method Dynamic Programming P and NP Concepts

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Software Engineering

Web Technologies

General Aptitude

Verbal Ability Numerical Ability