wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

Module 2 Process management

Total questions: 30

Worksheet time: 15mins

Name
Class
Date
1.
Allocating time on the processor to individual processes is known as...
a)
CPU Scheduling
b)
CPU Timing
c)
CPU Clocking
d)
CPU Sorting
2.

The system call to create a child process is called

a)

get a child

b)

wait child

c)

create child

d)

fork a child

3.

A program in execution is called a --------------

a)

process

b)

command

c)

software

d)

direction

4.

Which is not in the PCB

a)

Process state

b)

resources needed

c)

program counter

d)

processor size

5.

Which is not a process state?

a)

waiting

b)

terminated

c)

blocked

d)

redirected

6.

Preemption means

a)

process can be paused by system

b)

process cannot be halted once execution begins

7.

An example of a potential deadlock situation is

a)

a two way path

b)

a two way bridge

c)

a single lane bridge

8.

FCFS is operates similar to a

a)

stack

b)

sorting algorithm

c)

circle

d)

queue

9.

SJF is short for

a)

Shortest Job First

b)

Software Job First

c)

System Job First

d)

Shortest Job Final

10.

Round Robin is also known as

a)

Merry go round

b)

circle drive

c)

time slicing

d)

time sharing

11.

Which of the following is not an example of an OS for Smart phone?

a)

UNIX

b)

IOS

c)

Windows Phone 7

d)

Android

12.

An Operating System is a program that helps the user to communicate between the software and ___________

a)

Memory

b)

Hardware

13.

Software is a series of ____________ that tells a computer what tasks to perform and how to perform them.

a)

data

b)

information

c)

instructions

d)

utility

14.
Which of the following operating systems can you freely modify if you choose?
a)
OS X
b)
iOS
c)
BlackBerry
d)
Linux
15.

________________programs that control or maintain the operations of the computer and its devices.

a)

Application software

b)

System Software

c)

Utility program

16.

What is inter-process communication

a)

Communication within the process

b)

Communication between two processes

c)

Communication between two threads

d)

None of the above

17.

The address of the next instruction to be executed by the current process is provided by

a)

CPU registers

b)

Program Counter

c)

Stack

d)

Pipe

18.

Which of the following condition is required for a deadlock to be possible?

a)

mutual exclusion

b)

Circular wait

c)

no preemption

d)

all of the mentioned

19.

A system is in the safe state if ____________

a)

the system can allocate resources to each process in some order and still avoid a deadlock

b)

there exist a safe sequence

20.

For an effective operating system, when to check for deadlock?

a)

every time a resource request is made

b)

at fixed time intervals

c)

Both a and b

21.

What is Turnaround time?

a)

the total waiting time for a process to finish execution

b)

the total time from the completion till the submission of a process

22.

What is Response time?

a)

the total time taken from the submission time till the completion time

b)

the total time taken from the submission time till the first response is produced

23.

Round robin scheduling falls under the category of ____________

a)

Non-preemptive scheduling

b)

Preemptive scheduling

24.

Which of the following is not a condition for deadlock?

a)

Mutual exclusion

b)

Hold and wait

c)

Preemption

d)

Circular wait

25.

Banker's algorithm is used?

a)

To prevent deadlock

b)

To deadlock recovery

c)

To solve the deadlock

d)

None of these

26.

A thread is a

a)

utility program

b)

Light weight process

c)

interrupt

27.

Multithreaded processes share code and data

a)

True

b)

False

28.

............................ in OS is a situation where multiple processes compete.

a)

Interrupt

b)

Deadlock

c)

Race Condition

29.

A single thread of control allows the process to perform .......

a)

Only one task at a time

b)

Two tasks at a time

c)

Multiple tasks at a time

d)

All of the above

30.

What is a medium term scheduler

a)

It selects which process has to be brought into the ready queue

b)

It selects which process has to be executed next and allocates CPU

c)

It selects which process to remove from memory by swapping

d)

None of the above