Practice Set 1 (Operating system)

JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.

If a project can be divided into multiple modules then what is the best way to write a program for the project

1 point

Write a single program

Write program(s) which can generate multiple processes to accomplish task of each module

Write a multi-threaded program to accomplish task of each module

Programming methodology does not matter. It all depends on hardware

Clear selection

Time-sharing operating system follows__________ scheduling technique

1 point

Preemptive

Non-preemptive

Shortest Job First

No deadlock

Clear selection

Race condition problem arises because

1 point

Multiple processes are running at the same time

Multiple processes wants to access the same resource

Multiple processes are in their entry section at the same time

Multiple processes were in their critical section at the same time

Clear selection

Busy-wait condition means

1 point

one process is waiting while the CPU is running another process

The CPU is busy in waiting for the process to get free from I/O

The CPU is free but the processes are in a deadlocked state

process is holding the CPU but is stuck in the entry-section

Clear selection

In the bounded-wait condition for synchronization of processes, the waiting is applicable to_____

1 point

CPU waiting for a process to be assigned

Process which in critical and wants to enter remainder section

Process which has requested to enter critical section

I/O waiting for a process to be assigned after its CPU burst

Clear selection

If you want the OS to be the first program to run when you power on your system then the OS should be stored in

1 point

Hard disk

RAM

ROM

Registers

Clear selection

To store files in any secondary storage device, the device must

1 point

Be Partitioned

Have a File System installed into it

Be compatible with all OS

Know all file extensions

Clear selection

Degree of multiprogramming is controlled by

1 point

Long term scheduler

Medium term scheduler

Short term scheduler

Dispatcher

Clear selection

____________ is responsible for assigning the task selected by ______________ to the CPU

1 point

Short term scheduler, dispatcher

Long term scheduler, dispatcher

Dispatcher, short term scheduler

Dispatcher, long term scheduler

Clear selection

Three process p1, P2 and P3 arrive at time zero. The total time spent by the process in the system is 10ms, 20ms, and 30ms respectively. They spent first 20% of their execution time in doing I/O and the rest 80% in CPU processing. What is the percentage utilization of CPU using FCFS scheduling algorithm?

1 point

96%

95%

98%

94%

Clear selection

Consider a uniprocessor system where new processes arrive at an average of five processes per minute and each process needs an average of 6 seconds of service time. What will be the CPU utilization ?

1 point

45%

50%

52%

53%

Clear selection

Which of the following statements is not true for UNIX Operating System ?

1 point

Major strength of UNIX Operating System is its open standards which enabled large number of organizations ranging from academicia to industries to participate in its development.

UNIX kernel uses modules with well specified interfaces and provides advantages like simplified testing and maintenance of kernel. It has better extensibility as the kernel is not monolithic.

UNIX is kernel based operating system with two main components viz. process management subsystem and file management subsystem.

All devices are represented as files which simplify the management of I/O devices and files. The directories structure used is directed acyclic graph.

Clear selection

Which of the following shell scripts will produce the output “my first script” ?

1 point

for i in my first script { echo –i $i}

for my first script; do echo –n; done

for i in my first script; do echo –i $i; done

for n in my first script; do echo –i $i; done

Clear selection

While terminating a process which of the following things will get terminate along with it

1 point

First thread of the process

First two threads

all the threads within the process

no thread

Clear selection

for(i=0; i<4; i++){ Fork()}The total number of child processes created will be;

1 point

Clear selection

CPU scheduling is the basis for

1 point

multiprocessor O.S.

large memory sizes O.S.

Multiprogramming O.S.

none of these

Clear selection

In the Many to One model, if a thread makes a blocking system call :

1 point

the entire process will be blocked

part of the process will stay blocked, with the rest running

the entire process will run

none of these

Clear selection

The kernel is ------- of user threads

1 point

part of

creator of

unaware of

aware of

Clear selection

Inter process communication is

1 point

required for all the processes

allows processes to synchronize actively

can not happen in the case of threads

none of these

Clear selection

A thread shares its resources (like data section and code section) with:

1 point

other process similar to one that the thread belongs to

other threads that belong to similar prcesses

other thread that belong to the same process.

all of these

Clear selection

Situations where two or more processes are reading or writing some shared data and the final results depends on the order of usage of the shared data, are called ________.

1 point

critical section

race conditions

mutual exclusion

deadlocks

Clear selection

1 point