1)

System Call Description

A. fork () 1) Send signal from one to another
B. kill () 2) Terminate the current process
C. exec () 3) Load the specified program into memory
D. Exit () 4) Create the child process

I. A-II, B-III, C-IV, D-I

II. A-III, B-I, C-IV, D-II
III. A-Iv, B-I, C-III, D-II
IV. A-IV, B-III, C-II, D-I

2)

PROCESS ARRIVAL TIME BURST TIME

P1 0 8
P2 1 4
P3 2 9

What is the avg waiting time for this process using shortest job first scheduling
algorithm.

I. 2.66
II. 4.66
III. 5.5
IV. 6

3. Whish of the statements with respect to the multi process system are true?

A) Multi process system is controlled by one operating system

B) In a Multi-processor system multiple computers are connected by means of
communicating lines
C) Multiprocessor system is classified as multiple instruction streams and multiple data
stream systems.
1) A only
2) A & B only
3) A & C only
4) B & C only
 5) Given CPU time slice of 2

Process Burst time Arrival Time

P1 3 0
P2 4 2
P3 5 5

Find the avg turnaround time and Avg waiting time.

I. 4, 0
II. 5.66, 1.66
III. 5.66, 4.66
IV. 7,2

6) Identify the circumstances under which preemptive CPU scheduling is used.

A. A process switches from Running state to ready state.
B. A process switches from waiting state to ready state.
C. A process completes its execution.
D. A process switches from Ready to Waiting state.

I. A & b only
II. A & d only
III. C & d only
IV. A, b, c only

7) Which of these inter – Process Communication model is used to exchange

message among co -operative processes?
I. Shared memory model
II. Message passing model.
III. Shared memory and message passing model.
IV. Queues

8) Which is true?
A. Windows Azure is a cloud-based operating system.
B. Google App Engine is an integrated aet of online services for consumers to
communicate and share with others.
C. Amazon cloud front is a web service for content delivery.
 I. A&B
II. A&C
III. B&C
IV. A, B, C

9) A virtual memory-based memory management algorithm partially swaps out a

process. This is an example of
I. short term scheduling
II. long term scheduling
III. medium term scheduling
IV. mutual exclusion

10) In Round Robin CPU scheduling, as the time quantum is increased, the average
turnaround time.
I. Increases
II. Decreases
III. Remains constant.
IV. Varies irregularly.

11) A process with total control over to the CPU selected by the short-term
scheduler is assigned by the module ________.
I. interrupt
II. scheduler
III. dispatcher
IV. dispatcher latency

12) under the category of_______ Round-robin scheduling falls:

I. Preemptive scheduling
II. Non-preemptive scheduling
III. All of the mentioned
IV. None of the mentioned

13) The difference between the time of completion and the time of arrival is
known as the
I. waiting time.
II. turnaround time
 III. response time
IV. throughput

14) In an operating system, the portion of the process scheduler that forward
processes is concerned with:
I. Running processes are assigning to blocked queue.
II. Ready processes are assigning to cpu.
III. Ready processes are assigning to the waiting queue.
IV. All of the mentioned

15) scheduling algorithms that work on complex:

I. uses few resources.
II. uses most resources.
III. are suitable for large computers.
IV. all of the mentioned

16) Which system call creates the new process?

I. fork
II. create
III. new
IV. none of the mentioned

17) The systems which allow only one process execution at a time, are called
__________
I. uniprogramming systems
II. uniprocessing systems
III. unitasking systems
IV. none of the mentioned

18) What is the ready state of a process?

I. when process is scheduled to run after some execution
II. when process is unable to run until some tasks has been completed
III. when process is using the CPU
IV. none of the mentioned

19) Which system call returns the process identifier of a terminated child?
I. wait
II. exit
III. fork
IV. get
20) What is inter-process communication?
I. Communication within the process
II. Communication between two processes
III. Communication between two threads
IV. Communication between two kernels

21) What is a long-term scheduler?

I. It selects which process has to be brought into the ready queue.
II. It selects which process has to be executed next and allocates CPU.
III. It selects which process to remove from memory by swapping.
IV. None of these

22) Which is the most optimal scheduling algorithm?

I. FCFS – First come First served.
II. SJF – Shortest Job First
III. RR – Round Robin
IV. Multiple-Level Queues Scheduling

23) The First come first serve algorithm is particularly troublesome for ____________
I. Time sharing systems.
II. Multiprogramming systems
III. Multiprocessor systems
IV. Multi-level system

24) What is ‘Aging’?

I. It can lead to some low priority process waiting indefinitely for the CPU.
II. Keeping track of what pages are currently residing in memory.
III. Low priority processes get jammed for an unspecified time.
IV. Increasing the priority of jobs to ensure termination in a finite time.

25) ________ is the time required by a sector to reach below read/write head.
I. Seek Time
II. Latency Time
III. Access time
IV. Time Quantum
26) With _____________ only one process can execute at a time; meanwhile all other
process are waiting for the processor. With ______________ more than one process can be
running simultaneously each on a different processor.
I. Multiprocessing, Multiprogramming
II. Multiprogramming, Uniprocessing
III. Multiprogramming, Multiprocessing
IV. Uniprogramming, Multiprocessing

27) what is long term scheduler?

I. It selects which process has to brough into ready queue.
II. It selects which process has to be executed next and allocate CPU.
III. It selects which process to remove memory by swapping.
IV. None of the above

28) In _______________ context switching will never take place because it doesn't allow
to switch the process until it is completed fully
I. Round robin
II. Preemptive SJF
III. Non-Preemptive SJF
IV. Preemptive priority

29) Consider the 3 processes in table

Process Arrival Time Execution

P1 0 5
P2 1 7
P3 3 4
30) Consider the following set of processes and the length of CPU burst time given
in milliseconds: Assume that processes being scheduled with Round-Robin
Scheduling Algorithm with time quantum 4 ms. The the waiting time for P4 is ..............
ms.

Process Burst time.

P1 5

P2 7

P3 6

P4 4

I. 0
II. 4
III. 12
IV. 6