Assignment 3 – Operating System Fundamentals

1. A program becomes a process when

a. The program is stored on a disk as an executable
b. The executable file of the program is loaded onto the memory
c. The process replaces the program which was stored on the disk
d. None of the above
Ans: (b)
A program becomes a process when the program which was stored as an executable on the
disk is loaded onto the memory for execution.

2. Program is _____ quantity and process is _____ quantity.

a. active, passive
b. passive, active
c. passive, passive
d. active, active
Ans: (b)
Program is passive and is stored on disk as an executable file. Process is a program in
execution and thus is an active quantity.

3. A process structure may contain

a. Heap, a memory that is dynamically allocated during process runtime
b. Process stack, containing temporary data
c. Data section, containing the global variables
d. All of the above
Ans: (d)

4. When the process is waiting to be assigned to a processor, the process state is called
a. New state
b. Running state
c. Waiting state
d. Ready state
Ans: (d)
In ready state, the process waits to be assigned to a processor. In waiting state, the process
waits for some event to occur. New state creates a process while running state executes
instructions.
 5. A process control block (PCB) contains information associated with each process.
Match the following information column with relevant process column.

i) Memory management information p) priorities

ii) I/O status information q) memory allocated to process
iii) Accounting information r) list of open files
iv) CPU scheduling information s) clock time elapsed since start

a. i-q, ii-r, iii-s, iv-p

b. i-r, ii-q, iii-p, iv-s
c. i-q, ii-r, iii-p, iv-s
d. i-r, ii-q, iii-s, iv-p
Ans: (a)

6. A process does NOT give up the CPU under which of the following condition?
a. After a specified amount of time has elapsed on the timer
b. On I/O request
c. When the stack memory is full
d. None of the above
Ans: (c)
A process gives up the CPU only under two conditions. Either on I/O request or when a
specified time has elapsed on the timer.

7. The set of processes waiting for an I/O device is classified as

a. Job queue
b. Device queue
c. Ready queue
d. None of the above
Ans: (c)

8. The degree of multiprogramming is controlled by

a. Long term scheduler
b. Short term scheduler
c. Not any scheduler but the process itself
d. None of the above
Ans: (a)
Long term scheduler is invoked infrequently and selects which process is to be brought into
the ready queue. It controls the degree of multiprogramming.

9. I/O bound process spends more time doing I/O than computation with ____ CPU
bursts while CPU bound process spends more time doing computation with ____
CPU bursts.
a. many short, many short
b. few very long, few very long
c. many short, few very long
d. few very long, many short
Ans: (c)

10. Consider the following process tree.

The process ID (pid) = 8415 will wait for which of the following process(es) to
terminate?
a. pid=8416
b. pid=9268 & pid = 9204
c. pid = 1
d. pid = 8416, pid = 9268 & pid = 9204
Ans: (d)
A parent must wait for all the children to be terminated first. pid=8415 has the children
process with pid of 8416, 9268 & 9205. Therefore, pid=8415 will wait for these 3 processes
to be terminated first.