CS604-Midterm
1 / 50
This condition is known as ______________.
2 / 50
In Unix/ Linux, by default the standard output file is attached to the ___________
3 / 50
________ scheduling algorithm is sometimes called shortest remaining time first scheduling algorithm.
4 / 50
Files that start with a -------- in UNIX/Linux directory structure are known as hidden files .
5 / 50
The process id returned to the child process after successful fork system call execution is _____________.
6 / 50
The integer value of ________semaphores can range over an unrestricted integer domain.
7 / 50
When process opens its first file explicitly it will get descriptor number ______
8 / 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.
9 / 50
The execution of critical sections must NOT be mutually exclusive
10 / 50
Using _________system, we can create a new process in Linux.
11 / 50
A solution to the critical section problem must satisfy the following requirements
12 / 50
_______ is also called Swapper.
13 / 50
__________ displays information about the top processes.
14 / 50
You can create a threads by using the pthread_create() call.
15 / 50
________________ is an integer variable accessible through wait and signal which are atomic operations.
16 / 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 ________.
17 / 50
What do we name to an address that is loaded into the memory-address register of the memory?
18 / 50
Progress and Bounded Waiting are some of the characteristics to solve the critical section problems.
19 / 50
A major problem with priority scheduling algorithms is ______.
20 / 50
A time sharing system is
21 / 50
The hardware mechanism that enables a device to notify CPU is called an -------------
22 / 50
In Resource Allocation Graph, A _______ Pi →Rj indicates that process Pi may request resource Rj at some time in the future.
23 / 50
n-process critical section problem can be solved by using
24 / 50
Current working directory can be accessed using --------- Command.
25 / 50
The basic purpose of ________________is to help the users to utilize the hardware resources for completing different tasks in a simplified manner
26 / 50
User mode can run the Privileged instructions.
27 / 50
_____ system call is used to write to a file or FIFO or any other IPC channel.
28 / 50
/opt is used for storage of large applications.
29 / 50
In Unix/ Linux, by default the standard input file is attached to the ___________
30 / 50
The main characteristic of a Real time system is
31 / 50
_________ command to resume the execution of a suspended job in the foreground
32 / 50
Which of the following is NOT a Hardware Resource.
33 / 50
Mach, MacOS X Server, QNX, OS/2 and Windows NT are examples of OS Based on ______.
34 / 50
In ________ communication the process which wants to communicate with the other process must explicitly name the recipient and the sender.
35 / 50
Starvation is infinite blocking caused due to unavailability of resources.
36 / 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________.
37 / 50
Time interval when the I/O Devices are accessed is known as --------.
38 / 50
In ________addressing, the recipient is not required to name the sender.
39 / 50
The bottom layer in the layered approach of Operating System is-----------
40 / 50
Shared libraries and kernel modules are stored in directory
41 / 50
Preventing a condition of ________ to happen, deadlocks can be prevented to happen.
42 / 50
-------- command gives a snapshot of the current processes.
43 / 50
___________ is a piece of code in a cooperating process in which the process may updates shared data (variable, file, database, etc.).
44 / 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.”
45 / 50
_____________ is a preemptive scheduling algorithm.
46 / 50
The manual pages can be read in Linux using ____ command.
47 / 50
__________ integer shows the highest priority of a process in CPU scheduling
48 / 50
Batch programs are usually _________ programs.
49 / 50
The returned code to the child process after successful fork system call execution is
50 / 50
The bottom-up view is that operating system is a resource manager who manages the hardware and software resources in the computer system.
Your score is
The average score is 36%
Restart quiz
