1
GATE CSE 1995
MCQ (Single Correct Answer)
+1
-0.3
Which scheduling policy is most suitable for a time-shared operating systems?
A
Shortest Job First
B
Round Robin
C
First come First serve
D
Elevator
2
GATE CSE 1995
MCQ (Single Correct Answer)
+2
-0.6
The sequence $$.........$$ is an optimal non-preemptive scheduling sequence for the following jobs which leaves the $$CPU$$ idle for $$..........$$ Unit (s) of time GATE CSE 1995 Operating Systems - Process Concepts and Cpu Scheduling Question 26 English
A
$$\left\{ {3,2,1} \right\},1$$
B
$$\left\{ {2,1,3} \right\},0$$
C
$$\left\{ {3,2,1} \right\},0$$
D
$$\left\{ {1,2,3} \right\},5$$
3
GATE CSE 1995
MCQ (Single Correct Answer)
+1
-0.3
In a paged segmented scheme of memory management, the segment table itself must have a page table because:
A
The segment table is often too large to fit in one page.
B
Each segment is spread over a number of pages
C
Segment tables point to page table and not to the physical locations of the segment.
D
The processor’s description base register points to a page table.
4
GATE CSE 1995
MCQ (Single Correct Answer)
+1
-0.3
The principle of locality justifies the use of
A
Interrupts
B
DMA
C
Polling
D
Cache Memory
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12