CS604-Midterm
1 / 50
In deadlock detection and recovery algorithm, a deadlock exists in the system if and only if the wait for graph contains a _____________
2 / 50
The Home Directory for superuser in Linux and Unix is
3 / 50
In ---------addressing; the recipient is not required to name the sender.
4 / 50
Preventing a condition of ________ to happen, deadlocks can be prevented to happen.
5 / 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 _________.
6 / 50
The critical section problem can be solved by the following except
7 / 50
Binary semaphores are those that have only two values---------
8 / 50
The nice value helps in assigning ______ to a process.
9 / 50
Mkfifo() is a _______.
10 / 50
Operating System provides services such as Managing Primary and Secondary Storage, Processes and Allowing user to manage his/her files and directories.
11 / 50
copy file1 file2 is an example of ______ OS view.
12 / 50
Each process must first request permission to enter its critical section. The section of code implementing this request is called the _____
13 / 50
Banker‟s algorithm is used for ________________
14 / 50
In Unix/ Linux, by default the standard output file is attached to the ___________
15 / 50
DOS is single user operating system.
16 / 50
The time it takes for the dispatcher to stop one process and start another running is known as the-----------.
17 / 50
An absolute pathname starts with the root directory (/) and a relative pathname starts with your home directory.
18 / 50
If the system can allocate resources to each process in some order and still avoid a deadlock then it said to be in ______ state.
19 / 50
Linux is a version of _______ operating system.
20 / 50
________ determines What will be done.
21 / 50
------------has a hierarchical file system structure.
22 / 50
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.”
23 / 50
The -----------scheme is not applicable to a resource allocation system with multiple instances of each resource type.
24 / 50
___________ is a piece of code in a cooperating process in which the process may updates shared data (variable, file, database, etc.).
25 / 50
26 / 50
In Linux directory structure, there is ___________ root directory.
27 / 50
You can create a threads by using the pthread_create() call.
28 / 50
___________ is a solution to the problem of indefinite blockage of low-priority processes.
29 / 50
30 / 50
A 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 ________.
31 / 50
Mach, MacOS X Server, QNX, OS/2 and Windows NT are examples of OS Based on ______.
32 / 50
command displays the contents of current working directory.
33 / 50
Using _________system, we can create a new process in Linux.
34 / 50
Database, Complier, Video games are examples of ________.
35 / 50
IPC provides a mechanism to allow processes to communicate and to synchronize their actions without sharing the same__________
36 / 50
Starvation is infinite blocking caused due to unavailability of resources.
37 / 50
The correct command for compiling C program named program.c in Linux environment is
38 / 50
In indirect inter process communication, a sender ________ mention the name of the recipient.
39 / 50
The process of switching from one process to another is called ---------------.
40 / 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 ________.
41 / 50
What do we name to an address that is loaded into the memory-address register of the memory?
42 / 50
You can display the contents (names of files and directories) of a directory in UNIX/Linux directory structure with the --------------- command.
43 / 50
The following is NOT a classical problem of synchronization
44 / 50
The major advantage of multi-programming system is
45 / 50
POSIX is a standard developed by ANSI
46 / 50
A_______ is an integer variable that, apart from initialization is accessible only through two standard atomic operations: wait and signal.
47 / 50
Preemptive ----------------scheduling is sometimes called shortestremaining-time-first scheduling.
48 / 50
________ scheduling algorithm is sometimes called shortest remaining time first scheduling algorithm.
49 / 50
All threads within a process share the ________ address space.
50 / 50
The process of holding at least one resource and waiting to acquire additional resources that are currently being held by other processes is known as________.
Your score is
The average score is 36%
Restart quiz
