CS604-Midterm
1 / 50
The priorities of processes in the __________ group remain fixed.
2 / 50
In ---------addressing; the recipient is not required to name the sender.
3 / 50
First _______ entries in Per Process File Descriptor Table are used as soon as the process is created.
4 / 50
What do we name to an address that is loaded into the memory-address register of the memory?
5 / 50
_____________ determines How to do something.
6 / 50
Kernel is responsible for scheduling the user level threads.
7 / 50
________ determines What will be done.
8 / 50
In indirect inter process communication, a sender ________ mention the name of the recipient.
9 / 50
A_______ is an integer variable that, apart from initialization is accessible only through two standard atomic operations: wait and signal.
10 / 50
Hardware provide basic computing resource.
11 / 50
Using _________system, we can create a new process in Linux.
12 / 50
The process of switching from one process to another is called ---------------.
13 / 50
Which register holds the smallest legal physical memory address for a process?
14 / 50
In Linux directory structure, there is ___________ root directory.
15 / 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.
16 / 50
The main characteristic of a Real time system is
17 / 50
-------- command gives a snapshot of the current processes.
18 / 50
Cache is non-volatile memory.
19 / 50
________________ is an integer variable accessible through wait and signal which are atomic operations.
20 / 50
An absolute pathname starts with the root directory (/) and a relative pathname starts with your home directory.
21 / 50
Starvation is infinite blocking caused due to unavailability of resources.
22 / 50
_________ command to resume the execution of a suspended job in the foreground
23 / 50
You can display the contents (names of files and directories) of a directory in UNIX/Linux directory structure with the --------------- command.
24 / 50
___________ algorithm is used in Deadlock avoidance.
25 / 50
A Process 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.
26 / 50
Operating System provides services such as Managing Primary and Secondary Storage, Processes and Allowing user to manage his/her files and directories.
27 / 50
Preemptive ----------------scheduling is sometimes called shortestremaining-time-first scheduling.
28 / 50
The number of processes completed per unit time is called ___________.
29 / 50
The manual pages can be read in Linux using ____ command.
30 / 50
Operating System is the Manager of Hardware Resources.
31 / 50
Linux uses ___________ directory to store system configuration files.
32 / 50
The interval from the time of submission to the time of completion is the ______
33 / 50
In Layered approach of OS, Lowest Layer is known as ________.
34 / 50
Mkfifo() is a _______.
35 / 50
In ________ communication the process which wants to communicate with the other process must explicitly name the recipient and the sender.
36 / 50
__________ scheduler selects the process from the job pool and put them in main memory.
37 / 50
The integer value of ________semaphores can range over an unrestricted integer domain.
38 / 50
A solution to the critical section problem must satisfy the following requirements
39 / 50
You can use the rm file1 command to __________ file1
40 / 50
If a system is not in a safe state, there can be No deadlocks.
41 / 50
The performance of Round Robin algorithm does NOT depends heavily on the size of the time quantum.
42 / 50
command displays the contents of current working directory.
43 / 50
A major problem with priority scheduling algorithms is ______.
44 / 50
____ command gives a snapshot of the current processes.
45 / 50
I MB or 1 megabyte is equivalent to----
46 / 50
The nice value helps in assigning ______ to a process.
47 / 50
The process of switching from one process to another is called latency.
48 / 50
DOS is single user operating system.
49 / 50
Cooperating processes never share any data, code, memory or state.
50 / 50
The bottom layer in the layered approach of Operating System is-----------
Your score is
The average score is 36%
Restart quiz