CT049-3-1- Operating Systems & Computer Architecture Process Control

Process Control

SECTION A
Multiple Choice Questions

1. A process may be defined as:

a) A set of instructions to be executed by a computer
b) A program in execution
c) A piece of hardware that executes a set of instructions
d) The main procedure of a program

2. A starvation-free job scheduling policy guarantees that no job waits indefinitely for
service. Which of the following job-scheduling policies is starvation-free
a) Round-robin
b) Priority queuing
c) Shortest job first
d) Youngest job first
e) None of the above

SECTION B
Review Questions

1. Differentiate between preemptive and non-preemptive scheduling.

2. Consider a workload with 5 jobs that each compute for an identical amount of time, x,
and that perform no I/O. To minimize the average waiting time of the jobs, should a
FCFS scheduler or a RR scheduler be used?

3. Assume that job A is running on the CPU. Describe two circumstances in which a SJF
scheduler will keep job A running, but a STCF scheduler will pick a different job.

4. Explain the major differences between the members of each pair ;

 Process and Thread

 Multiprogramming and Multiprocessing

 Batch and Interactive

5. Consider the following set of processes that arrive at time 0 with the length of CPU-burst
time given in milliseconds (ms).

Process Burst Time (ms)

P1 6
P2 8
P3 7
P4 3

i. Draw Gant charts to illustrate the execution of these processes using the
following algorithm and find out the average waiting time for each of them.

Level 1 Asia Pacific University of Technology & Innovation Page 1 of 2

CT049-3-1- Operating Systems & Computer Architecture Process Control

a. First-Come-First-Served(FCFS),
b. Shortest-Job-First(SJF)

ii. What is the average waiting time if the processes arrive in the order P2,P3,P1,P4
using the FCFS?

6. What is the main purpose of an Operating System?

7. Differentiate between multiprogramming and time-sharing.

8. Describe the services provided by the OS.

9. With the aid of a diagram, describe the life-cycle of a process(Process State)

interrupt

Admitted Exit
New Ready Dispatch Running Terminated
process

I/O or Event
I/O or Event
Completion
Wait
Blocked

10. For each of the following transitions between process states indicate whether the
transition is possible or not possible?

Ready -- Running

Ready -- New
Blocked -- Ready
Ready -- Blocked
Locked -- Running

Level 1 Asia Pacific University of Technology & Innovation Page 2 of 2