CS604-Midterm
1 / 50
_____________ is a preemptive scheduling algorithm.
2 / 50
The condition where a set of blocked processes each holding a resource and waiting to acquire a resource held by another process in the set, is termed as ________.
3 / 50
The main characteristic of a Real time system is
4 / 50
The address generated by the CPU, after any indexing or other addressing-mode arithmetic, is called a --------address, and the address it gets translated to by the MMU is called a ---------address.
5 / 50
copy file1 file2 is an example of ______ OS view.
6 / 50
Taking the CPU from one process and giving the CPU to another process is termed as
7 / 50
Starvation is infinite blocking caused due to unavailability of resources.
8 / 50
-------- command gives a snapshot of the current processes.
9 / 50
The performance of Round Robin algorithm does NOT depends heavily on the size of the time quantum.
10 / 50
The priority of a process can be changed using ___________ command.
11 / 50
In Layered Approach of OS, the Layer highest Layer is User Interface layer.
12 / 50
____ is a virtual directory in Linux and Unix.
13 / 50
Managing Secondary Storage Involves all of the Following except
14 / 50
A dashed line is used to represent a _________ in Resource Allocation Graph.
15 / 50
/usr/X11R6 is used by the X Window System.
16 / 50
In indirect inter process communication, a sender_____mention the name of the recipient.
17 / 50
A system call________
18 / 50
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 _________.
19 / 50
Time interval when the I/O Devices are accessed is known as --------.
20 / 50
_____________ determines How to do something.
21 / 50
------------ register contains the size of the process
22 / 50
You can use the ---------command in UNIX to create a directory.
23 / 50
A major problem with priority scheduling algorithms is ______.
24 / 50
If the fork system call fails, it returns
25 / 50
In ---------addressing, the recipient is not required to name the sender.
26 / 50
Mkfifo() is a _______.
27 / 50
Files that start with a -------- in UNIX/Linux directory structure are known as hidden files .
28 / 50
When process opens its first file explicitly it will get descriptor number ______
29 / 50
A process consists of __________
30 / 50
When a process opens its first file explicitly it will get descriptor number _________
31 / 50
IPC provides a mechanism to allow processes to communicate and to synchronize their actions without sharing the same__________
32 / 50
------------has a hierarchical file system structure.
33 / 50
Shared libraries and kernel modules are stored in directory
34 / 50
Which of the following is correct definition for wait operation?
35 / 50
Batch programs are usually _________ programs.
36 / 50
Preventing a condition of ________ to happen, deadlocks can be prevented to happen.
37 / 50
I/O instructions are Privileged Instructions.
38 / 50
We can install and run multiple OS by using VMWare.
39 / 50
Banker‟s algorithm is used for ________________
40 / 50
___________ is a piece of code in a cooperating process in which the process may updates shared data (variable, file, database, etc.).
41 / 50
_________ command to resume the execution of a suspended job in the foreground
42 / 50
43 / 50
POSIX is a standard developed by ANSI
44 / 50
_____ system call is used to write to a file or FIFO or any other IPC channel.
45 / 50
In Unix/ Linux, by default the standard input file is attached to the ___________
46 / 50
A solution to the critical section problem must satisfy the following requirements
47 / 50
First _______ entries in Per Process File Descriptor Table are used as soon as the process is created.
48 / 50
__________ displays information about the top processes.
49 / 50
The Operating system is a layer of software between _________ and ___________.
50 / 50
First-Come, First-Served (FCFS) is a --------------scheduling algorithm.
Your score is
The average score is 36%
Restart quiz
