Operating System-CPU Scheduling (GATE Computer Science): Questions 1 - 6 of 21

Get 1 year subscription: Access detailed explanations (illustrated with images and videos) to 913 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. View Sample Explanation or View Features.

Rs. 450.00 or

Question number: 1

» Operating System » CPU Scheduling

MCQ▾

Question

Fetch and decode cycle is not required in

Choices

Choice (4) Response

a.

indirect addressing

b.

direct addressing

c.

immediate addressing

d.

None of the above

Question number: 2

» Operating System » CPU Scheduling

MCQ▾

Question

When a process switches from the running state to the waiting state is called ________.

Choices

Choice (4) Response

a.

Round-Robin Scheduling

b.

Preemptive Scheduling

c.

Non- Preemptive Scheduling

d.

All of the above

Question number: 3

» Operating System » CPU Scheduling

MCQ▾

Question

What is another component involved in the CPU-scheduling function?

Choices

Choice (4) Response

a.

Component

b.

Dispatcher

c.

Displacement

d.

Question does not provide sufficient data or is vague

Question number: 4

» Operating System » CPU Scheduling

MCQ▾

Question

CPU scheduling is the basis of ________ operating systems.

Choices

Choice (4) Response

a.

Multiprogramming

b.

Multitasking

c.

Multiprocessing

d.

All of the above

Question number: 5

» Operating System » CPU Scheduling

MCQ▾

Question

When once the CPU has been allocated to a process then the process keeps the CPU until it releases the CPU either by terminating or by switching to the waiting state is a called________

Choices

Choice (4) Response

a.

Round-Robin Scheduling

b.

Preemptive Scheduling

c.

Non- Preemptive Scheduling

d.

Question does not provide sufficient data or is vague

Question number: 6

» Operating System » CPU Scheduling

MCQ▾

Question

A priority is associated with each process, and the CPU is allocated to the process with the highest priority is called ________.

Choices

Choice (4) Response

a.

first come first served

b.

Non- Preemptive Scheduling

c.

Priority scheduling algorithm

d.

All of the above

Sign In