CS604-Midterm
1 / 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________.
2 / 50
The major advantage of multi-programming system is
3 / 50
------------has a hierarchical file system structure.
4 / 50
Progress and Bounded Waiting are some of the characteristics to solve the critical section problems.
5 / 50
__________ integer shows the highest priority of a process in CPU scheduling
6 / 50
What do we name to an address that is loaded into the memory-address register of the memory?
7 / 50
__________ scheduler selects the process from the job pool and put them in main memory.
8 / 50
In ________addressing, the recipient is not required to name the sender.
9 / 50
The critical section problem can be solved by the following except
10 / 50
A program in execution is called a _______________.
11 / 50
_________________ scheduling allows a process to move between queues.
12 / 50
Bounded Buffer is a buffer of ____________ size
13 / 50
You can use the rm file1 command to __________ file1
14 / 50
A process consists of __________
15 / 50
The integer value of ________semaphores can range over an unrestricted integer domain.
16 / 50
Files that start with a -------- in UNIX/Linux directory structure are known as hidden files .
17 / 50
_____________ is a preemptive scheduling algorithm.
18 / 50
Command-line interpreter is also called __________ in some operating systems.
19 / 50
IPC provides a mechanism to allow processes to communicate and to synchronize their actions without sharing the same__________
20 / 50
Round Robin algorithm is similar to ____________ scheduling but preemption is added to switch between processes.
21 / 50
The -------------- system call suspends the calling process.
22 / 50
A solution to the critical section problem must satisfy the following requirements
23 / 50
POSIX is a standard developed by ANSI
24 / 50
The Operating system is a layer of software between _________ and ___________.
25 / 50
In deadlock detection and recovery algorithm, a deadlock exists in the system if and only if the wait for graph contains a _____________
26 / 50
Each page is a power of -------- bytes long in paging scheme.
27 / 50
The returned code to the child process after successful fork system call execution is
28 / 50
The bottom layer in the layered approach of Operating System is-----------
29 / 50
A semaphore that cause Busy-Waiting is termed as .
30 / 50
In Unix/ Linux, by default the standard output file is attached to the ___________
31 / 50
Which register holds the smallest legal physical memory address for a process?
32 / 50
--------------command to resume the execution of a suspended job in the foreground
33 / 50
__________ displays information about the top processes.
34 / 50
The nice value helps in assigning ______ to a process.
35 / 50
This condition is known as ______________.
36 / 50
You can create a threads by using the pthread_create() call.
37 / 50
If your processor does not have two slots empty in Per Process File Descriptor Table, then your _________ system call will fail.
38 / 50
____ command gives a snapshot of the current processes.
39 / 50
An absolute pathname starts with the root directory (/) and a relative pathname starts with your home directory.
40 / 50
If a system is not in a safe state, there can be No deadlocks.
41 / 50
Binary semaphores are those that have only two values---------
42 / 50
A_______ is an integer variable that, apart from initialization is accessible only through two standard atomic operations: wait and signal.
43 / 50
The process id returned to the child process after successful fork system call execution is _____________.
44 / 50
Mach, MacOS X Server, QNX, OS/2 and Windows NT are examples of OS Based on ______.
45 / 50
_____________ is the basis of queuing theory which is branch of mathematics used to analyze systems involving queues and servers.
46 / 50
______scheduler selects the process from the job pool and put them in main memory.
47 / 50
-------- command gives a snapshot of the current processes.
48 / 50
________ scheduling algorithm is sometimes called shortest remaining time first scheduling algorithm.
49 / 50
The process of switching from one process to another is called ---------------.
50 / 50
When process opens its first file explicitly it will get descriptor number ______
Your score is
The average score is 36%
Restart quiz
