CS604-Midterm
1 / 50
________________ is an integer variable accessible through wait and signal which are atomic operations.
2 / 50
A semaphore that cause Busy-Waiting is termed as ___________.
3 / 50
Database, Complier, Video games are examples of ________.
4 / 50
Progress and Bounded Waiting are some of the characteristics to solve the critical section problems.
5 / 50
Round Robin algorithm is similar to ____________ scheduling but preemption is added to switch between processes.
6 / 50
The integer value of ________semaphores can range over an unrestricted integer domain.
7 / 50
__________ displays information about the top processes.
8 / 50
If your processor does not have two slots empty in Per Process File Descriptor Table, then your _________ system call will fail.
9 / 50
-------- command gives a snapshot of the current processes.
10 / 50
The nice value helps in assigning ______ to a process.
11 / 50
In Unix/ Linux, by default the standard input file is attached to the ___________
12 / 50
First-Come, First-Served (FCFS) is a --------------scheduling algorithm.
13 / 50
The main characteristic of a Real time system is
14 / 50
------------has a hierarchical file system structure.
15 / 50
Swapper is also termed as Short term scheduler.
16 / 50
The Purpose of Operating System is to generate Executable Programs and to _______ them.
17 / 50
Mkfifo() is a _______.
18 / 50
copy file1 file2 is an example of ______ OS view.
19 / 50
The scheduling of ______ are done by the operating system.
20 / 50
Preemptive ----------------scheduling is sometimes called shortestremaining-time-first scheduling.
21 / 50
Managing Secondary Storage Involves all of the Following except
22 / 50
Time interval when the I/O Devices are accessed is known as --------.
23 / 50
A process is said to be in critical section if it executes code that manipulates shared data
24 / 50
The Operating system is a layer of software between _________ and ___________.
25 / 50
In indirect inter process communication, a sender_____mention the name of the recipient.
26 / 50
__________ integer shows the highest priority of a process in CPU scheduling
27 / 50
The time it takes for the dispatcher to stop one process and start another running is known as the-----------.
28 / 50
Cache is non-volatile memory.
29 / 50
Mach, MacOS X Server, QNX, OS/2 and Windows NT are examples of OS Based on ______.
30 / 50
In Layered Approach of OS, the Layer highest Layer is User Interface layer.
31 / 50
The Top-down view is that it is a program that acts as an intermediary between a user of a computer and the computer hardware, and makes the computer system convenient to use.
32 / 50
The number of processes completed per unit time is called ___________.
33 / 50
The bottom layer in the layered approach of Operating System is-----------
34 / 50
Command-line interpreter is also called __________ in some operating systems.
35 / 50
The basic purpose of ________________is to help the users to utilize the hardware resources for completing different tasks in a simplified manner
36 / 50
In Resource Allocation Graph, A _______ Pi →Rj indicates that process Pi may request resource Rj at some time in the future.
37 / 50
The execution of critical sections must NOT be mutually exclusive
38 / 50
A program in execution is called a _______________.
39 / 50
Using _________system, we can create a new process in Linux.
40 / 50
41 / 50
Batch programs are usually _________ programs.
42 / 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.
43 / 50
A Process „A‟ that has finished working but its parent process has also finished its execution. In this state the process „A‟ will be called as _____ process.
44 / 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 _________.
45 / 50
What do we name to an address that is loaded into the memory-address register of the memory?
46 / 50
If the fork system call fails, it returns
47 / 50
When a process opens its first file explicitly it will get descriptor number _________
48 / 50
In ---------addressing; the recipient is not required to name the sender.
49 / 50
Which register holds the smallest legal physical memory address for a process?
50 / 50
_____ system call is used to write to a file or FIFO or any other IPC channel.
Your score is
The average score is 36%
Restart quiz
