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

PREVIOUS NEXT

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

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

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 File System IO and Protection Deadlocks Memory Management

Algorithms

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

Digital Logic

Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits

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

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Verbal Ability Numerical 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