PREVIOUS NEXT
1
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
Which of the following is an example of spooled device?
A
The terminal used to enter the input data for the C program being executed.
B
An output device used to print the output of a number of jobs.
C
The secondary memory device in a virtual storage system.
D
The swapping area on a disk used by the swapper.
2
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
Consider $$n$$ processes sharing the $$CPU$$ in a round-robin fashion. Assuming that each process switch takes $$s$$ seconds, what must be the quantum size $$q$$ such that the overhead resulting from process switching is minimized but, at the same time each process is guaranteed to get its turn at the $$CPU$$ at least every $$t$$ seconds?
A
$$q \le {{t - ns} \over {n - 1}}$$
B
$$q \ge {{t - ns} \over {n - 1}}$$
C
$$q \le {{t - ns} \over {n + 1}}$$
D
$$q \ge {{t - ns} \over {n + 1}}$$
3
GATE CSE 1996
MCQ (Single Correct Answer)
+1
-0.3
The process state transition diagram in Figure is representative of GATE CSE 1996 Operating Systems - Process Concepts and Cpu Scheduling Question 71 English
A
a batch operating system
B
an operating system with a preemptive scheduler
C
an operating system with a non-preemptive scheduler
D
a uni-programmed operating system.
4
GATE CSE 1996
MCQ (Single Correct Answer)
+1
-0.3
Which of the following is an example of spooled device?
A
A line printer used to print the output of a number of jobs.
B
A terminal used to enter input data to a running program.
C
A secondary storage device in a virtual memory system.
D
A graphic display device.
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
Boolean Algebra K Maps Combinational Circuits Number Systems 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 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
Software Engineering
Compiler Design
Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization
Web Technologies
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
EXAM MAP

Browse past year questions by exam & subject

Joint Entrance Examination
JEE Main JEE Advanced MHT CET BITSAT COMEDK WB JEE KCET VITEEE AP EAPCET TS EAMCET IAT (IISER)
Medical
NEET AIIMS MHT CET (Biology)
Graduate Aptitude Test in Engineering
GATE CSE GATE ECE GATE EE GATE ME GATE CE GATE PI GATE IN GATE Data Science and Artificial Intelligence
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12