GATE CSE 2001 | Process Concepts and Cpu Scheduling Question 48 | Operating Systems

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

GATE CSE 1999

MCQ (Single Correct Answer)

-0.3

System calls are usually invoked by using:

A software interrupt

Polling

An indirect jump

A privileged instruction

GATE CSE 1998

MCQ (Single Correct Answer)

-0.3

Which of the following is an example of spooled device?

The terminal used to enter the input data for the C program being executed.

An output device used to print the output of a number of jobs.

The secondary memory device in a virtual storage system.

The swapping area on a disk used by the swapper.

PREVIOUS NEXT

GATE CSE Subjects

Theory of Computation

Undecidability Finite Automata and Regular Language Push Down Automata and Context Free Language 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

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

Digital Logic

K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits

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

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

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Numerical Ability Logical Reasoning Verbal Ability

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

Computer Organization

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