CSC 205 First

Semester Test
2024/2025 Academic Session

[email protected] Switch accounts

Draft saved

* Indicates required question

Email *

[email protected]
:
 Selects which statement is TRUE 1 point

according to GATE 2010.

I. starvation may be caused by

shortest remaining time first
scheduling.

II. starvation may be caused by

preemptive scheduling.

III. in terms of response time, Round

Robin is better than FCFS.

I and III only

I only

II and III only

I, II and III

Clear selection

Scheduling is done so as to 1 point

____________

keep the CPU more idle

none of the above

decrease CPU utilization

increase CPU utilization

Clear selection
:
 Example of a synchronization tool is - 1 point

---------------

semaphore

thread

socket

pipe

Clear selection

Which scheduling algorithm tend to 1 point

minimize the process waiting time?

FCFS

LJF

Earliest Deadline Served

SJF

Clear selection
:
 Which is the most suitable for a real- 1 point

time sharing processing?

Pre-emptive

FCFS

Random Scheduling

Round Robin

Clear selection

The turnaround time for short jobs 1 point

during multiprogramming is usually

Shortened and that for long jobs is
slightly ___________

shortened

lengthened

widened

unchanged

Clear selection
:
 The measure of work done by the CPU 1 point

per unit time is called ------------------

throughput

CPU utilization

turn around time

response time

Clear selection

Round Robin scheduling algorithm is 1 point

most suitable for?

Hybrid processing

Hard RTOS

Batch processing OS

Time sharing OS

Clear selection
:
 How can deadlock be avoided? 1 point

resource allocation must be done at once

there must be a fixed number of resources

to allocate

all deadlock process must be aborted

inversion technique can be used

Clear selection

Consider the following set of 1 point

processes and the length of burst

time;
Process ID CPU Burst Priority
P1 10 3
P2 1 1 (H)
P3 2 4
P4 1 5 (L)
P5 5 2
What is the average waiting time if the
priority scheduling algorithm is been
implemented?

7.2ms

8.2ms

5.2ms

10.0ms

Clear selection
:
 The measure of time from the 1 point

submission of a request until the first

response is called -------------

response time

waiting time

throughput

turn around time

Clear selection

Process execution consists of a cycle 1 point

of --------

Ready and execution state

Execution and I/O wait

I/O wait and termination

Ready and termination

Clear selection

Name *

Anyasi Boluwatife Anthony

:
 Consider the following set of 1 point

processes
Process ID CPU Burst Arrival
time
P1 5 0
P2 7 2
P3 3 3
If the policy of RR with CPU quantum
of 2 time units is been implemented,
what is the average waiting time?

6ms

5ms

3ms

4ms

Clear selection

At the ready queue when a process 1 point

arrives in priority scheduling

algorithm, the priority of this process
is compared with the priority of --------
----

currently running process

initial process

all processes

parent process

Clear selection
:
 The process scheduler that selects 1 point

processes from the queue and load

them into the memory for execution is
------------

average term

short term

medium term

long term

Clear selection

Consider the following set of 1 point

processes
Process ID CPU Burst Arrival
time
P1 5 0
P2 7 2
P3 3 3
If the policy of RR with CPU quantum
of 2 time units is been implemented,
what is the average turn around time?

15ms

10ms

11ms

19ms

Clear selection
:
 Time quantum is implemented in 1 point

which of the following?

multilevel queue scheduling algorithm

priority scheduling algorithm

shortest job scheduling algorithm

round-robin scheduling algorithm

Clear selection

Consider the following set of 1 point

processes
Process ID CPU Burst Arrival
time
P1 5 0
P2 7 2
P3 3 3
If the policy of FCFS is been
implemented, what is the average
waiting time?

7.23ms

6.34ms

5.67ms

5.00ms

Clear selection
:
 Matric number *

230591045

The problem of indefinite blockage of 1 point

low priority jobs in the priority

scheduling algorithm can be resolved
using -----------------

Swapping

Dirty bit

Compact block

Aging

Clear selection

One of the disadvantages of the 1 point

priority scheduling algorithm is that?

it schedules in a very complex manner

it can lead to some low priority process

waiting

its scheduling takes up a lot of time

none of the above

Clear selection

Submit Clear form

:
 Never submit passwords through Google Forms.

This content is neither created nor endorsed by Google. - Terms

of Service - Privacy Policy

Does this form look suspicious? Report

Forms
: