Best of Luck:

__________ integer shows the highest priority of a process in CPU scheduling.

1. small
2. Large

The process of switching from one process to another is called latency.

1. True
2. False

Batch programs are usually __________ programs.

1. interactive
2. Non-interactive
3. Fore ground
4. Preemptive

___________ is used in real time operating systems.

1. Non-preemptive scheduling
2. Preemptive scheduling
3. Dispatching scheduling
4. FCFS scheduling

The procedure “The time at which the process finished working MINUS the arrival time of
the process MINUS CPU burst for that process” will help calculate the _________.
 1. Non-preemptive Shortest Job First scheduling
2. Preemptive Shortest Job First scheduling.
3. FCFS
4. RR Scheduling

The priorities of processes in the __________ group remain fixed.

1. Kernel
2. User

First _______ entries in Per Process File Descriptor Table are used as soon as the process is
created.

 1
 2
 3
 4

_____________ is a preemptive scheduling algorithm.

1. First Come First Serve

2. Shortest Job First
3. Round Robin
4. None of these

_______________ scheduling algorithm can be preemptive or non-preemptive.

1. First Come First Serve

2. Shortest Job First
 3. Round Robin
4. Priority

Cooperating processes never share any data, code, memory or state.

1. True
2. False

When process opens its first file explicitly it will get descriptor number _________

 1
 2
 3
 4

Taking the CPU from one process and giving the CPU to another process is termed as

1. Context switching
2. Dispatching
3. Swapping
4. Tracking

The correct command for compiling C program named program.c in Linux environment is

1. gcc program.c –o FirstPrgram

2. gcc –o FirstProgram program.c
3. gcc –z FirstProgram program.c
4. gcc program.c –m FirstPrgram

All Threads within a process share the _________ address space.

Select correct option:

Same

Different

The scheduling of _____________ are done by the operating system.

Select correct option:

Kernel threads

User level threads

Both Kernel and User Level thread

None of the give option

Kernel threads are supported directly by the operating system. The kernel performs the
scheduling, creation, and management in —— Command displays the status of a process.

Select correct option:

ls

ps

gcc

cat

In Unix/ Linux, by default the standard output file is attached to the ___________

Select correct option:

1. File
2. Screen
 3. Printer
4. Scanner

The priority of a process can be changed using __________ command.

Select correct option:

1. nice
2. cmd
3. cat
4. grep

———displays information about the top processes.

Select correct option:

ls

cs

top

cd

___________ is the basis of queuing theory which is branch of mathematics used to analyze
systems involving queues and servers.

1. Little’s Formula
2. Deterministic Modeling
3. Queuing Theory
4. Queuing analysis
The process id returned to the child process after successful fork system call execution is
______.

 0
 1
 2
 3

The nice value helps in assigning ______ to a process.

Select correct option:

Priority

Weight

Time

Scheduling

Round Robin algorithm is similar to _____________ scheduling but preemption is added to

switch between processes.

Select correct option:

Shortest Job First

Shortest Remaining Time First

First Come First Serve

None of these

Question # 5 of 10 ( Start time: 12:05:08 PM ) Total Marks: 1

The scheduling of _____________ are done by the operating system.

Select correct option:

Kernel threads

User level threads

Both Kernel and User Level thread

None of the give option

In Unix/ Linux, by default the standard input file is attached to the ___________

Select correct option:

Mouse

Keyboard

Light pen
Joystick

A major problem with priority scheduling algorithms is _________________.

Select correct option:

Deadlock

Aging

Starvation

None of these

A solution to the critical section problem must satisfy the following three requirements: Mutual
Exclusion

Progress

Bounded Waiting

Question # 9 of 10 ( Start time: 12:06:28 PM ) Total Marks: 1

________ scheduling algorithm is sometimes called shortest remaining time first scheduling
algorithm.

Select correct option:

Non-preemptive SJF
Priority Scheduling

Preemptive Shortest Job First

FCFS

In Unix/ Linux, by default the standard output file is attached to the ___________

Select correct option:

1. File
2. Screen
3. Printer
4. Scanner

When process opens its first file explicitly it will get descriptor number _________

 1
 2
 3
 4

Round Robin algorithm is most suitable for __________.

Time sharing system

Real time systems and batch systems

Running Batch programs

Expert system
If your processor does not have two slots empty in Per Process File Descriptor Table, then your
_________ system call will fail.

1. Pipe
2. Read
3. Write
4. Open

POSIX is a standard developed by ___________

Select correct option:

1. ANSI
2. IEEE
3. ISO
4. ACM

___________ is a solution to the problem of indefinite blockage of low-priority processes.

1. Starvation
2. Deadlock
3. Aging
4. None of the these

_____ system call is used to write to a file or FIFO or any other IPC channel.

1. read
2. write
3. open
4. fork
_________________ scheduling allows a process to move between queues.

1. Round Robin
2. First Come First Serve
3. Multilevel Feedback Queue
4. Shortest Remaining Time First

Question1 ( Marks: 1 ) – Please choose one

The hardware mechanism that enables a device to notify CPU is called an ————-

► Interrupt

► Signal

► Trap

► Process

Question2 ( Marks: 1 ) – Please choose one

You can display the contents (names of files and directories) of a directory in UNIX/Linux
directory structure with the ————— command.

►ll

►s

► ls

► none of the given options

Question3 ( Marks: 1 ) – Please choose one

The ————– system call suspends the calling process.

► fork

► wait

► exec

► exit

Question4 ( Marks: 1 ) – Please choose one

In ———addressing, the recipient is not required to name the sender.

► Symmetric

► Asymmetric

► Both symmetric and asymmetric

► None of the given options

Question5 ( Marks: 1 ) – Please choose one

——– command gives a snapshot of the current processes.

► ps

► top

► who

► ls
Question6 ( Marks: 1 ) – Please choose one

————–command to resume the execution of a suspended job in the foreground

► fg

► bg

► jobs

► kill

Question7 ( Marks: 1 ) – Please choose one

You can use the ————- command to display the status of suspended and background
processes

► fg

► bg

► jobs

► kill

Question8 ( Marks: 1 ) – Please choose one

You can terminate a foreground process by pressing ————–

► <Ctrl-A>

► <Ctrl-C>

► <Ctrl-Z>

► None of the given options

Question9 ( Marks: 1 ) – Please choose one

A time sharing system is

► Multi tasking

► Interactive

► All of these

► Multi user

Question10 ( Marks: 1 ) – Please choose one

The main characteristic of a Real time system is

► Efficiency

► Large Virtual Memory

► Large secondary storage device

► Usability

Question11 ( Marks: 1 ) – Please choose one

Shared libraries and kernel modules are stored in directory► /bin

► /dev

► /boot

► /lib
Question12 ( Marks: 1 ) – Please choose one

scheduler selects the process from the job pool and put them in main memory.

► Long term

► Short term

► Medium term

► Swapper

Question13 ( Marks: 1 ) – Please choose one

In indirect inter process communication, a sender mention the name of the recipient.

► do

► do not

Question14 ( Marks: 1 ) – Please choose one

A is an integer variable that, apart from initialization is accessible only through

two standard atomic operations: wait and signal.

► Semaphore

► Monitor

► Critical region

► Critical section

Question15 ( Marks: 1 ) – Please choose one

A semaphore that cause Busy-Waiting is termed as .

► Spinlock

► Monitor

► Critical region

► Critical section

Question16 ( Marks: 1 ) – Please choose one

The execution of critical sections must NOT be mutually exclusive

► True

► False

Question17 ( Marks: 1 ) – Please choose one

The performance of Round Robin algorithm does NOT depends heavily on the size of the time
quantum.

► True

► False

Question18 ( Marks: 1 ) – Please choose one

The following requirement for solving critical section problem is known as _. “There exists
a bound on the number of times that other processes are allowed to enter their critical sections
after a process has made a request to enter its critical section and before that request is granted.”
► Progress

► Bounded Waiting

► Mutual Exclusion

► Critical Region

Question19 ( Marks: 1 ) – Please choose one

The critical section problem can be solved by the following except

► Software based solution

► Firmware based solution

► Operating system based solution

► Hardware based solution

Question20 ( Marks: 1 ) – Please choose one

_ is also called Swapper.

► Swap space

► Medium term scheduler

► Short term scheduler

► Long term scheduler

Question1 ( Marks: 1 ) – Please choose one

I MB or 1 megabyte is equivalent to—-
1024 bytes

10242 bytes (may be this)

10243 bytes

1000000 bytes

Question2 ( Marks: 1 ) – Please choose one

The bottom layer in the layered approach of Operating System is———–

Hardware

User interface

Hardware

Kernel

None of the given options

Question3 ( Marks: 1 ) – Please choose one

————has a hierarchical file system structure.

DOS

Windows

UNIX

None of the given options

Question4 ( Marks: 1 ) – Please choose one

You can use the ———command in UNIX to create a directory.

rmdir

mkdir

cp

gcc

Question5 ( Marks: 1 ) – Please choose one

Files that start with a ——– in UNIX/Linux directory structure are known as hidden files .

. (dot)

# ( hash )

/ (slash)

~ (tilt)

Question6 ( Marks: 1 ) – Please choose one

The creating process is called a————— process while the new processes are called the
————– of that process

None of the given options

Children, parent
Parent, children

Zombie, single

Question7 ( Marks: 1 ) – Please choose one

————buffer places no practical limit on the size of the buffer

Bounded

Unbounded

Both Unbounded & bounded

Bounded

Unbounded

None of the given options

Question8 ( Marks: 1 ) – Please choose one

The ———— are used for communication between related or unrelated

processes on the same system or unrelated processes on different systems.

Pipes

BSD Sockets

Named pipe (FIFO)

None of the given options

Question9 ( Marks: 1 ) – Please choose one

A —————is an abstract key for accessing a file.

File descriptor

Input Redirection

Output Redirection

FIFO

Question10 ( Marks: 1 ) – Please choose one

——– command gives a snapshot of the current processes.

ps

top

who

ls

Question11 ( Marks: 1 ) – Please choose one

You can display all of the signals supported by your system, along with their numbers, by using
the ———–command
<Ctrl-A>

fg

jobs
kill -l

Question12 ( Marks: 1 ) – Please choose one

The time it takes for the dispatcher to stop one process and start another running is known as the
———–.

Dispatch latency

Scheduling

Context switching

None of the given options

Question13 ( Marks: 1 ) – Please choose one

First-Come, First-Served (FCFS) is a ————–scheduling algorithm.

preemptive

non-preemptive

both preemptive and non- preemptive none of the given options

Question14 ( Marks: 1 ) – Please choose one

The Shortest-Job-First Scheduling algorithm can be

Preemptive only

non-preemptive only

preemptive or non-preemptive.
None of the given options

Question15 ( Marks: 1 ) – Please choose one

Preemptive —————-scheduling is sometimes called shortestremaining-time-first scheduling.

First-Come-First-Served (FCFS)

Round-Robin

Sorted Job First (SJF)

Priority

Question16 ( Marks: 1 ) – Please choose one

The basic purpose of ________________is to help the users to utilize the hardware

resources for completing different tasks in a simplified manner

Operating system

Application software
All Software

All of the given

Question17 ( Marks: 1 ) – Please choose one

OS helps manages the following except

Application software

Bus speed of the system

Memory

Virtual memory

Question18 ( Marks: 1 ) – Please choose one

__________ scheduler selects the process from the job pool and put them in main

memory.

Long term

Short term

Medium term

Swapper

Question19 ( Marks: 1 ) – Please choose one

A parent process calling __________ system call will be suspended until children process

terminates.

wait

fork

exit

exec

Question20 ( Marks: 1 ) – Please choose one

n-process critical section problem can be solved by using

The bakery algorithm

Deterministing modeling

Analytic evaluation

None of above

1. Linux OS can support multiple users at a time

a) True
b) False
2. The Operating system is a layer of software between _________ and ___________.
a) hardware, software application
b) Kernel, hardware
c) Dos, Windows
d) Windows, Kernel
3. The major advantage of multi-programming system is
a) More than one jobs can be processed at a given time
b) CPU utilization can be increased
c) Jobs can be completed quickly
d) All of the options are correct

4. The main characteristic of a Real time system is

a) Efficiency
b) Large Virtual Memory
c) Large secondary storage device
d) Usability

5. Command-line interpreter is also called __________ in some operating systems.

a) Kernel
b) Shell
c) Signal
d) API

6. I/O instructions are Privileged Instructions.

a) True
b) False

7. In Linux directory structure, there is ___________ root directory.

a) 1
b) 2
c) 3
d) 4

8. Utilities used for system administration (halt, ifconfig, fdisk, etc.) are stored in
_____________ directory.
a) /dev
b) /boot
c) /lib
d) /sbin

9. rm and rmkdir commands are used to _____________ directory.

a) Create
b) Move
c) Remove
d) Modify

10. You can use the mv file1 file2 command to move ______________
a) file1 to file2.
b) file 2 to file 1
c) this command will not work for moving files
d) None of the option is correct.
e) Both option a and b are correct

11. Taking the CPU from one process and giving the CPU to another process is termed as
a) Context Switching
b) Dispatching
c) Swapping
d) Tracking

12. ___________ scheduler is also called Swapper.

a) Long term
b) Short term
c) Medium term
d) Swap space

13. A Process A that has finished working, as well as its parent process has also finished its
execution. In this state the process A will be called as _________ process.
a) Child
b) Thread
c) Zombie
d) Fork

14. Bounded Buffer is a buffer of ____________ size

a) variable
b) fixed

15. In ________ communication the process which wants to communicate with the other process
must explicitly name the recipient and the sender.
a) Direct
b) Indirect
c) Automatic
d) Self

16. In indirect inter process communication, a sender ________ mention the name of the
recipient.
a) does
b) does not

17. The returned code to the child process

after successful fork system call execution is
a) 1
b) 2
c) 3
d) 0
18. If the fork system call fails, it returns
a) 1
b) -1
c) 2
d) 0

19. When a process opens its first file explicitly it will get descriptor number _________
a) 1
b) 2
c) 3
d) 4

20. In Unix/ Linux, by default the standard input file is attached to the ___________
a) Mouse
b) Keyboard
c) Light pen
d) Joystick

Question

The hardware mechanism that enables a device to notify CPU is called an ————-

► Interrupt

► Signal

► Trap

► Process

Question

You can display the contents (names of files and directories) of a directory in UNIX/Linux
directory structure with the ————— command.
►ll

►s

► ls

► none of the given options

Question

The ————– system call suspends the calling process.

► Fork

► Wait

► Exec

► Exit

Question

In ———addressing, the recipient is not required to name the sender.

► Symmetric

► Asymmetric

► Both symmetric and asymmetric

► None of the given options

Question
——– command gives a snapshot of the current processes.

► ps

► top

► who

► ls

Question

————–command to resume the execution of a suspended job in the foreground

► fg

► bg

► jobs

► kill

Question

You can use the ————- command to display the status of suspended and background
processes

► fg

► bg

► jobs

► kill
Question

You can terminate a foreground process by pressing ————–

► <Ctrl-A>

► <Ctrl-C>

► <Ctrl-Z>

► None of the given options

Question

A time sharing system is

► Multi tasking

► Interactive

► All of these

► Multi user

Question

The main characteristic of a Real time system is

► Efficiency

► Large Virtual Memory

► Large secondary storage device

► Usability
Question

Shared libraries and kernel modules are stored in directory

/bin

► /dev

► /boot

► /lib

Question

———— scheduler selects the process from the job pool and put them in main memory.

► Long term

► Short term

► Medium term

► Swapper

Question

In indirect inter process communication, a sender mention the name of the recipient.

► do

► do not
Question

A ————— is an integer variable that, apart from initialization is accessible only through
two standard atomic operations: wait and signal.

► Semaphore

► Monitor

► Critical region

► Critical section

Question

A semaphore that cause Busy-Waiting is termed as——– .

► Spinlock

► Monitor

► Critical region

► Critical section

Question

The execution of critical sections must NOT be mutually exclusive

► True

► False
Question

The performance of Round Robin algorithm does NOT depends heavily on the size of the time
quantum.

► True

► False

Question

The following requirement for solving critical section problem is known as —–_. “There exists a
bound on the number of times that other processes are allowed to enter their critical sections after
a process has made a request to enter its critical section and before that request is granted.”

► Progress

► Bounded Waiting

► Mutual Exclusion

► Critical Region

Question

The critical section problem can not be solved by the following except

► Software based solution

► Firmware based solution

► Operating system based solution

► Hardware based solution

Question

——–_ is also called Swapper.

► Swap space

► Medium term scheduler

► Short term scheduler

► Long term scheduler

Question
I MB or 1 megabyte is equivalent to—-

1024 bytes

10242 bytes (may be this)

10243 bytes

1000000 bytes

Question

The bottom layer in the layered approach of Operating System is———–

Hardware

User interface

Hardware
Kernel

None of the given options

Question

————has a hierarchical file system structure.

DOS

Windows

UNIX

None of the given options

Question

You can use the ———command in UNIX to create a directory.

rmdir

mkdir

cp

gcc

Question

Files that start with a ——– in UNIX/Linux directory structure are known as hidden files .
. (dot)

# ( hash )

/ (slash)

~ (tilt)

Question

The creating process is called a————— process while the new processes are called the
————– of that process

None of the given options

Children, parent

Parent, children

Zombie, single

Question

————buffer places no practical limit on the size of the buffer

Bounded

Unbounded

Both Unbounded & bounded

None of the given options

Question

The ———— are used for communication between related or unrelated

processes on the same system or unrelated processes on different systems.

Pipes

BSD Sockets

Named pipe (FIFO)

None of the given options

Question

A —————is an abstract key for accessing a file.

File descriptor

Input Redirection

Output Redirection

FIFO

Question

——– command gives a snapshot of the current processes.

ps

top

who

ls

Question

You can display all of the signals supported by your system, along with their numbers, by using
the ———–command

<Ctrl-A>

fg

jobs
kill -l

Question

The time it takes for the dispatcher to stop one process and start another running is known as the
———–.

Dispatch latency

Scheduling

Context switching

None of the given options

Question
First-Come, First-Served (FCFS) is a ————–scheduling algorithm.

preemptive

non-preemptive

both preemptive and non- preemptive none of the given options

Question

The Shortest-Job-First Scheduling algorithm can be

Preemptive only

non-preemptive only

preemptive or non-preemptive.
None of the given options

Question

Preemptive —————-scheduling is sometimes called shortest remaining-time-first

scheduling.

First-Come-First-Served (FCFS)

Round-Robin

Sorted Job First (SJF)

Priority

Question
The basic purpose of ________________is to help the users to utilize the hardware

resources for completing different tasks in a simplified manner

Operating system

Application software

All Software

All of the given

Question

OS helps manages the following except

Application software

Bus speed of the system

Memory

Virtual memory

Question

__________ scheduler selects the process from the job pool and put them in main

memory.

Long term

Short term
Medium term

Swapper

Question

A parent process calling __________ system call will be suspended until children process

terminates.

wait

fork

exit

exec

Question

n-process critical section problem can be solved by using

The bakery algorithm

Deterministing modeling

Analytic evaluation

None of above

Linux OS can support multiple users at a time

a) True
b) False
The Operating system is a layer of software between _________ and ___________.

a) hardware, software application

b) Kernel, hardware
c) Dos, Windows
d) Windows, Kernel

The major advantage of multi-programming system is

a) More than one jobs can be processed at a given time

b) CPU utilization can be increased
c) Jobs can be completed quickly
d) All of the options are correct

The main characteristic of a Real time system is

a) Efficiency
b) Large Virtual Memory
c) Large secondary storage device
d) Usability

Command-line interpreter is also called __________ in some operating systems.

a) Kernel
b) Shell
c) Signal
d) API

I/O instructions are Privileged Instructions.

a) True
b) False

In Linux directory structure, there is ___________ root directory.

a) 1
b) 2
c) 3
d) 4
Utilities used for system administration (halt, ifconfig, fdisk, etc.) are stored in _____________
directory.

a) /dev
b) /boot
c) /lib
d) /sbin

rm and rmkdir commands are used to _____________ directory.

a) Create
b) Move
c) Remove
d) Modify

You can use the mv file1 file2 command to move ______________

a) file1 to file2.
b) file 2 to file 1
c) this command will not work for moving files
d) None of the option is correct.
e) Both option a and b are correct

Taking the CPU from one process and giving the CPU to another process is termed as

a) Context Switching
b) Dispatching
c) Swapping
d) Tracking

___________ scheduler is also called Swapper.

a) Long term
b) Short term
c) Medium term
d) Swap space

A Process A that has finished working, as well as its parent process has also finished its
execution. In this state the process A will be called as _________ process.
a) Child
b) Thread
c) Zombie
d) Fork

Bounded Buffer is a buffer of ____________ size

a) variable
b) fixed

15. In ________ communication the process which wants to communicate with the other process
must explicitly name the recipient and the sender.
a) Direct
b) Indirect
c) Automatic
d) Self

16. In indirect inter process communication, a sender ________ mention the name of the
recipient.
a) does
b) does not

Question # 1 of 10 ( Start time: 06:17:33 PM ) Total Marks: 1

Linux uses ___________ directory to store system configuration files.
Select correct option:
/bin
/dev
/boot
/etc

Question # 2 of 10 ( Start time: 06:18:01 PM ) Total Marks: 1

OS helps manages the following except
Select correct option:
Application software
Memory
Virtual memory
Bus speed of the system

Question # 3 of 10 ( Start time: 06:18:09 PM ) Total Marks: 1

Linux OS can support multiple users at a time
Select correct option:
True
False
Question # 4 of 10 ( Start time: 06:18:17 PM ) Total Marks: 1
__________ directory includes essential system boot files including the kernel image.
Select correct option:
/bin
 /boot
/dev
/etc
Question # 5 of 10 ( Start time: 06:19:17 PM ) Total Marks: 1
_______ command displays the contents of current working directory.
Select correct option:
ls
cs
mv
cp
Question # 6 of 10 ( Start time: 06:20:29 PM ) Total Marks: 1
In Linux directory structure, there is ___________ root directory.
Select correct option:
1
2
3
4
Question # 7 of 10 ( Start time: 06:20:37 PM ) Total Marks: 1
You can use the rm file1 command to __________ file1.
Select correct option:
retrieve
remove
make
modify

Question # 8 of 10 ( Start time: 06:20:54 PM ) Total Marks: 1

Shared libraries and kernel modules are stored in _____________ directory.
Select correct option:
/bin
/dev
/boot
/lib
Question # 9 of 10 ( Start time: 06:21:25 PM ) Total Marks: 1
Linux is only single user operating system
Select correct option:
True
False

Question # 10 of 10 ( Start time: 06:21:35 PM ) Total Marks: 1

____________ command is used to change the directory.
Select correct option:
ls
cp
cd
mv
Question # 1 of 10 ( Start time: 05:04:51 PM ) Total Marks: 1
The major advantage of multi-programming system is
Select correct option:

More than one jobs can be processed at a given time

CPU utilization can be increases
Jobs can be completed quickly
All of the options are correct

Question # 2 of 10 ( Start time: 05:06:16 PM ) Total Marks: 1

The basic purpose of ________________is to help the users to utilize the hardware resources for
completing different tasks in a simplified manner.
Select correct option:

Operating system
Application software
All Software
All of the given

Question # 4 of 10 ( Start time: 05:08:22 PM ) Total Marks: 1

Linux uses ___________ directory to store system configuration files.
Select correct option:

/bin
/dev
/boot
/etc

Question # 5 of 10 ( Start time: 05:09:05 PM ) Total Marks: 1

You can use the rm file1 command to __________ file1.
Select correct option:
retrieve
remove
make

Question # 6 of 10 ( Start time: 05:09:41 PM ) Total Marks: 1

DOS is a single user operating system.
Select correct option:

True
False
Question # 7 of 10 ( Start time: 05:10:58 PM ) Total Marks: 1
A time sharing system is
Select correct option:

Multi user
Multi tasking
Interactive
All of these

Question # 9 of 10 ( Start time: 05:13:20 PM ) Total Marks: 1

A program in execution is called a _______________.
Select correct option:

Command
Process
Software
Compiler

Question # 10 of 10 ( Start time: 05:14:24 PM ) Total Marks: 1

____________ command is used to change the directory.
Select correct option:

ls
cp
cd
mv

Question # 1 of 10 ( Start time: 06:17:33 PM ) Total Marks: 1

Linux uses ___________ directory to store system configuration files.
Select correct option:
/bin
/dev
/boot
/etc

Question # 2 of 10 ( Start time: 06:18:01 PM ) Total Marks: 1

OS helps manages the following except
Select correct option:
Application software
Memory
Virtual memory
Bus speed of the system
CS604 – Operating System – Question1 ( M a r k s: 1 ) .
Linux is a version of _______ operating system.
Select correct option:

► OS/2
► Windows
► Unix
► None of the above

CS604 – Operating System – Question2 ( M a r k s: 1 ) .

Current working directory can be accessed using ——— Command.
Select correct option:

►. (dot)
► # ( hash )
► / (slash)
► ~ (tilt)

CS604 – Operating System – Question3 ( M a r k s: 1 ) .

Mkfifo() is a _______.
Select correct option:

► System Call
► Command
► Directory
► None of Above

CS604 – Operating System – Question4 ( M a r k s: 1 ) .

——– command gives a snapshot of the current processes.
Select correct option:

► ps
► top
► who
► ls

CS604 – Operating System – Question5 ( M a r k s: 1 ) .

Time interval when the I/O Devices are accessed is known as ——–.
Select correct option:

► CPU Burst
► IO Burst
► Time Slice
► None of Above

CS604 – Operating System – Question6 ( M a r k s: 1 ) .

The process of switching from one process to another is called —————.
Select correct option:

► context switching
► scheduling
► quantum period
► latency

CS604 – Operating System – Question7 ( M a r k s: 1 ) .

__________ directory includes essential system boot files including the kernel image.
Select correct option:

► /bin
► /boot
► /dev
► /etc

CS604 – Operating System – Question8 ( M a r k s: 1 ) .

________ scheduling algorithm is sometimes called shortest remaining time first scheduling
algorithm.
Select correct option:

► Non-preemptive SJF
► Priority Scheduling
► Preemptive Shortest Job First
► FCFS

CS604 – Operating System – Question9 ( M a r k s: 1 ) .

A semaphore that cause Busy-Waiting is termed as ___________.
Select correct option:

► Spinlock
► Monitor
► Critical region
► Critical section

CS604 – Operating System – Question10 ( M a r k s: 1 ) .

Progress and Bounded Waiting are some of the characteristics to solve the critical section
problems.
Select correct option:
► True
► False

CS604 – Operating System – Question11 ( M a r k s: 1 ) .

In ———addressing, the recipient is not required to name the sender.
Select correct option:

► Symmetric
► Asymmetric
► Both symmetric and asymmetric
► None of the given options

CS604 – Operating System – Question12 ( M a r k s: 1 ) .

The execution of critical sections must NOT be mutually exclusive
Select correct option:

► True
► False

CS604 – Operating System – Question13 ( M a r k s: 1 ) .

A program in execution is called a _______________.
Select correct option:

► Command
► Process
► Software
► Compiler

CS604 – Operating System – Question14 ( M a r k s: 1 ) .

The critical section problem can be solved by the following except

► Software based solution

► Firmware based solution
► Operating system based solution
► Hardware based solution

CS604 – Operating System – Question15 ( M a r k s: 1 ) .

The bottom layer in the layered approach of Operating System is———–
Select correct option:

► User interface
► Hardware
► Kernel
► None of the given options
CS604 – Operating System – Question16 ( M a r k s: 1 ) .
The manual pages can be read in Linux using ____ command.
Select correct option:

► man
► wan
► desc
► help

All Threads within a process share the _________ address space.

Select correct option:

Same

Different

he scheduling of _____________ are done by the operating system.

Select correct option:

Kernel threads

User level threads

Both Kernel and User Level thread

None of the give option

Kernel threads are supported directly by the operating system. The kernel performs the
scheduling, creation, and management in —— command display the status of a process.

Select correct option:

ls
ps

gcc

cat

First _______ entries in Per Process File Descriptor Table are used as soon as the process is
created.

Select correct option:

In Unix/ Linux, by default the standard output file is attached to the ___________

Select correct option:

File

Screen

Printer

Scanner

The priority of a process can be changed using __________ command.

Select correct option:

nice

cmd

cat

grep

The procedure �The time at which the process finished working MINUS the arrival time of the
process MINUS CPU burst for that process� will help calculate the _________.

Select correct option:

Non-preemptive Shortest Job First scheduling.

Preemptive Shortest Job First scheduling.

FCFS

RR Scheduling

_____________ is a preemptive scheduling algorithm.

Select correct option:

First Come First Serve

Shortest Job First

Round Robin

None of these

———displays information about the top processes.

Select correct option:

ls

cs

top

cd

___________ is the basis of queuing theory which is branch of mathematics used to analyze
systems involving queues and servers.

Select correct option:

Little�s Formula

Deterministic Modeling

Queuing Theory

Queuing analysis

The priorities of processes in the __________ group remain fixed.

Select correct option:

Kernel

User

First _______ entries in Per Process File Descriptor Table are used as soon as the process is
created.

Select correct option:

1

The nice value helps in assigning ______ to a process.

Select correct option:

Priority

Weight

Time

Scheduling

Round Robin algorithm is similar to _____________ scheduling but preemption is added to

switch between processes.

Select correct option:

Shortest Job First

Shortest Remaining Time First

First Come First Serve

None of these

The scheduling of _____________ are done by the operating system.

Select correct option:

Kernel threads

User level threads

Both Kernel and User Level thread

None of the give option

The scheduling of _____________ are done by the operating system.

Select correct option:

Kernel threads

User level threads

Both Kernel and User Level thread

None of the give option

In Unix/ Linux, by default the standard input file is attached to the ___________

Select correct option:

Mouse

Keyboard

Light pen

Joystick

A major problem with priority scheduling algorithms is _________________.

Select correct option:

Deadlock

Aging

Starvation

None of these

_______ scheduling algorithm is sometimes called shortest remaining time first scheduling
algorithm.

Select correct option:

Non-preemptive SJF

Priority Scheduling

Preemptive Shortest Job First

FCFS

___________ is the basis of queuing theory which is branch of mathematics used to analyze
systems involving queues and servers.

Select correct option:

Little�s Formula

Deterministic Modeling

Queuing Theory

Queuing analysis
In Unix/ Linux, by default the standard output file is attached to the ___________

Select correct option:

File

Screen

Printer

Scanner

When process opens its first file explicitly it will get descriptor number _________

Round Robin algorithm is most suitable for __________.

Time sharing system

Real time systems and batch systems

Running Batch programs

Expert system

If your processor does not have two slots empty in Per Process File Descriptor Table, then your
_________ system call will fail.

Pipe

Read

Write

Open

_______________ scheduling algorithm can be preemptive or non-preemptive.

First Come First Serve

Shortest Job First

Round Robin

Priority

POSIX is a standard developed by ___________

Select correct option:

ANSI

IEEE

ISO

ACM
___________ is a solution to the problem of indefinite blockage of low-priority processes.

Starvation

Deadlock

Aging

None of the these

_____ system call is used to write to a file or FIFO or any other IPC channel.

read

write

open

fork

CS604 Mid Term Papers Collection:-

List and define the different metrics by which might evaluate a scheduler (List at least 4). 5
marks
2. Write brief the multilevel feedback queue scheduling. 5 marks
3. Assumption made while formulating a solution to the critical section problem. 2 marks
4. There are many commands. Write the method through which these commands can
communicate with each other. 3 marks
5. Write Difference between SJF and Shortest Remaining Time First Scheduling algorithm. 3
marks
6. Write formula for calculating waiting time in preemptive Shortest Job First Algorithm. 2
marks
7. Define race condition and how prevent this condition. 2 marks

CS604 – Operating System – Question17 ( M a r k s: 2 )

What is Convoy Effect?
Ans: Convoy effect is the result of mechanism in which some one has to follow an order like the
movement of a convoy. In FCFS, a process whether shorter or smaller has to follow a queue to
be assigned to a CPU. T
CS604 – Operating System – Question18 ( M a r k s: 2 )
What are the common data structures in Bakery Algorithm?
Ans: The common data structures are:

boolean choosing [n];

int number[n];
CS604 – Operating System – Question19 ( M a r k s: 2 )
How a pipe can be created?
Ans: The pipe() system call creates a pipe and returns two file descriptors, one for

reading and second for writing. The files associated with these

file descriptors are streams and are both opened for reading and writing. Naturally, to use

such a channel properly, one needs to form some kind of protocol in which data is sent

over the pipe.

CS604 – Operating System – Question20 ( M a r k s: 3 )

Define Progress and Bounded Waiting.
Ans: 2. Progress

If no process is executing in its critical section and some processes wish to enter their

critical sections, then only those processes that are not executing in their remainder
section can participate in the decision on which will enter its critical section next, and

this selection cannot be postponed indefinitely.

3. Bounded Waiting

There exists a bound on the number of times that other processes are allowed to enter

their critical sections after a process has made a request to enter its critical section and

before that request is granted.

CS604 – Operating System – Question21 ( M a r k s: 3 )
What is Starvation and how it occures
Ans: A major problem with priority- scheduling algorithms is indefinite blocking (or

starvation). A process that is ready to run but lacking the CPU can be considered

blocked-waiting for the CPU.

CS604 – Operating System – Question22 ( M a r k s: 5 )

What are the advantages of Round Robin Scheduling Algorithm?

CS604 – Operating System – Question23 ( M a r k s: 5 )

Analyze the following algorithm to solve the critical section problem and explain whether it
satisfies the Mutual Exclusion Characteristic

Flag[i] = True;
Turn = j;
do{
while(Flag[j] = True && turn==j);
critical section
Flag[i] = False;
remainder section
} While(1)
Ans: To prove mutual exclusion, note that Pi enters its critical section only if either

flag[j]=false or turn=i. Also, if both processes were executing in their critical sections at

the same time, then flag[0]= = flag[1]= = true. These two observations suggest that P0 and

P1 could not have found both conditions in the while statement true at the same time,

since the value of ‘turn’ can either be 0 or 1. Hence only one process say P0 must have

successfully exited the while statement. Hence mutual exclusion is preserved.

1. Write data structures for bakery algorithm? (2 marks)

2. Which command is used for suspending a foreground process? (2 marks)
3. Which command is used to resume the execution of a suspended job in the background?
(3 marks)
4. Define race condition? (3 marks)
5. How to implement RR scheduling? (5 marks)
6. Highlight critical sections of this code? (5 marks)

do
{
while (TestAndSet(lock)) ;
Critical section
lock=false;
Remainder section
} while(1);