CS604-Midterm
1 / 50
Database, Complier, Video games are examples of ________.
2 / 50
Hardware provide basic computing resource.
3 / 50
_____________ determines How to do something.
4 / 50
A semaphore that cause Busy-Waiting is termed as ___________.
5 / 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 ________.
6 / 50
An operating system is a control program that manages the execution of user programs to prevent errors and improper use of a computer.
7 / 50
In Resource Allocation Graph, A _______ Pi →Rj indicates that process Pi may request resource Rj at some time in the future.
8 / 50
_______ is also called Swapper.
9 / 50
The Purpose of Operating System is to generate Executable Programs and to _______ them.
10 / 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.
11 / 50
The correct command for compiling C program named program.c in Linux environment is
12 / 50
The priorities of processes in the __________ group remain fixed.
13 / 50
A time sharing system is
14 / 50
In Linux directory structure, there is ___________ root directory.
15 / 50
Operating system enables the user to use the Hardware Resources.
16 / 50
If a system is not in a safe state, there can be No deadlocks.
17 / 50
___________ is a piece of code in a cooperating process in which the process may updates shared data (variable, file, database, etc.).
18 / 50
In Unix/ Linux, by default the standard output file is attached to the ___________
19 / 50
The main characteristic of a Real time system is
20 / 50
The performance of Round Robin algorithm does NOT depends heavily on the size of the time quantum.
21 / 50
Preventing a condition of ________ to happen, deadlocks can be prevented to happen.
22 / 50
/usr/X11R6 is used by the X Window System.
23 / 50
_________________ scheduling allows a process to move between queues.
24 / 50
The hardware mechanism that enables a device to notify CPU is called an -------------
25 / 50
A program in execution is called a _______________.
26 / 50
Linux Treats Devices as Files.
27 / 50
The nice value helps in assigning ______ to a process.
28 / 50
A_______ is an integer variable that, apart from initialization is accessible only through two standard atomic operations: wait and signal.
29 / 50
Command-line interpreter is also called __________ in some operating systems.
30 / 50
The critical section problem can be solved by the following except
31 / 50
Linux uses ___________ directory to store system configuration files.
32 / 50
Bounded Buffer is a buffer of ____________ size
33 / 50
A semaphore that cause Busy-Waiting is termed as .
34 / 50
When a process opens its first file explicitly it will get descriptor number _________
35 / 50
The Operating system is a layer of software between _________ and ___________.
36 / 50
The ________ requires that once a writer is ready, that writer performs its write as soon as possible , if a writer waiting to access the object, no new readers may start reading.
37 / 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.
38 / 50
The integer value of ________semaphores can range over an unrestricted integer domain.
39 / 50
In ---------addressing; the recipient is not required to name the sender.
40 / 50
________ determines What will be done.
41 / 50
I MB or 1 megabyte is equivalent to----
42 / 50
The time it takes for the dispatcher to stop one process and start another running is known as the-----------.
43 / 50
Managing Secondary Storage Involves all of the Following except
44 / 50
You can terminate a foreground process by pressing --------------
45 / 50
Which of the following is correct definition for wait operation?
46 / 50
copy file1 file2 is an example of ______ OS view.
47 / 50
You can use the ---------command in UNIX to create a directory.
48 / 50
The execution of critical sections must NOT be mutually exclusive
49 / 50
In deadlock detection and recovery algorithm, a deadlock exists in the system if and only if the wait for graph contains a _____________
50 / 50
Your score is
The average score is 36%
Restart quiz
