GATE CSE 2002 | Process Concepts and Cpu Scheduling Question 52 | 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

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?.

Round -Robin

Shortest -Job -First

Highest-Response-Ratio-Next

First -Come-First-Served

GATE CSE 2001

MCQ (Single Correct Answer)

-0.3

A processor needs software interrupt to

Test the interrupt system of the processor

Implement co-routines

Obtain system services which need execution of privileged instructions

Return from subroutine

GATE CSE 2001

MCQ (Single Correct Answer)

-0.3

A CPU has two modes-privileged and non-privileged. In order to change the mode from privileged to non-privileged

A hardware interrupt is needed

A software interrupt is needed

A privileged instruction (which does not generate an interrupt) is needed.

A non-privileged instruction (which does not generate an interrupt) is needed.

PREVIOUS NEXT

GATE CSE Subjects

Browse all chapters by subject

Theory of Computation

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

Operating Systems

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

Algorithms

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

Digital Logic

Sequential Circuits Boolean Algebra K Maps Combinational Circuits Number Systems

Database Management System

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

Data Structures

Arrays Stacks and Queues Linked List Trees Graphs Hashing

Computer Networks

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

Software Engineering

Compiler Design

Syntax Directed Translation Parsing Lexical Analysis Code Generation and Optimization

Web Technologies

General Aptitude

Verbal Ability Logical Reasoning Numerical Ability

Discrete Mathematics

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

Programming Languages

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

Computer Organization

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