A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. In round robin CPU scheduling as time quantum is increased the average turn around time
a. increases
b. decreases
c. remains constant
d. varies irregularly
Answer:varies irregularly
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions:

Which of the following memory allocation scheme suffers from external fragmentation ?
Consider a system with seven processes A through G and six resources R through W.
Resource ownership is as follows:

process A holds R and wants T
process B holds nothing but wants T
process C holds nothing but wants S
process D holds U and wants S & T
process E holds T and wants V
process F holds W and wants S
process G holds V and wants U

Is the system deadlocked ? If yes, ............. processes are deadlocked.
Simplest way of deadlock recovery is
IC 80287 is:
Which of the following is the correct value returned to the operating system upon the successful completion of a program?
Match the following

(a) Disk scheduling                 (1) Round robin
(b) Batch processing               (2) Scan
(c) Time sharing                       (3) LIFO
(d) Interrupt processing          (4) FIFO
In a demand paging memory system, page table is held in registers. The time taken to service a page fault is 8 m.sec. If an empty frame is available or if the replaced page is not modified, and it takes 20 m.sec., if the replaced page is modified. What is the average access time to service a page fault assuming that the page to be replaced is modified 70% of the time?
....................is one of pre-emptive scheduling algorithm.
Page making process from main memory to disk is called
Consider a virtual page reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1. Suppose a demand paged virtual memory system running on a computer system such that the main memory has 3 page frames. Then ................. page replacement algorithm has minimum number of page faults.
Get it on Google Play

GATE CSE Resources

Questions from Previous year GATE question papers

UGC NET Computer science Resources

UGC NET Previous year questions and practice sets

NET General Paper 1

UGC NET Previous year questions and practice sets

GATE CSE Online Test

Attempt a small test to analyze your preparation level. This GATE exam includes questions from previous year GATE papers.

UGC NET practice Test

Practice test for UGC NET Computer Science Paper. The questions asked in this NET practice paper are from various previous year papers.