CS604-Midterm
1 / 50
Cache is non-volatile memory.
2 / 50
In Unix/ Linux, by default the standard input file is attached to the ___________
3 / 50
Preemptive ----------------scheduling is sometimes called shortestremaining-time-first scheduling.
4 / 50
____ command display the status of a process.
5 / 50
A_____ is an abstract key for accessing a file.
6 / 50
Round Robin algorithm is similar to ____________ scheduling but preemption is added to switch between processes.
7 / 50
The bottom-up view is that operating system is a resource manager who manages the hardware and software resources in the computer system.
8 / 50
_________buffer places no practical limit on the size of the buffer
9 / 50
Bounded Buffer is a buffer of ____________ size
10 / 50
An operating system is a control program that manages the execution of user programs to prevent errors and improper use of a computer.
11 / 50
The priorities of processes in the __________ group remain fixed.
12 / 50
The bottom layer in the layered approach of Operating System is-----------
13 / 50
The _______ are used for communication between related or unrelated processes on the same system or unrelated processes on different systems.
14 / 50
_________________ scheduling allows a process to move between queues.
15 / 50
In ________ communication the process which wants to communicate with the other process must explicitly name the recipient and the sender.
16 / 50
_________ command to resume the execution of a suspended job in the foreground
17 / 50
In Resource Allocation Graph, A _______ Pi →Rj indicates that process Pi may request resource Rj at some time in the future.
18 / 50
Physical memory is broken down into fixed-sized blocks, called----------- and Logical memory is divided into blocks of the same size, called -----------
19 / 50
In indirect inter process communication, a sender_____mention the name of the recipient.
20 / 50
I/O instructions are Privileged Instructions.
21 / 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 _________.
22 / 50
Time interval when the I/O Devices are accessed is known as --------.
23 / 50
Kernel is responsible for scheduling the user level threads.
24 / 50
________ scheduling algorithm is sometimes called shortest remaining time first scheduling algorithm.
25 / 50
IPC provides a mechanism to allow processes to communicate and to synchronize their actions without sharing the same__________
26 / 50
OS helps manages the following except
27 / 50
The manual pages can be read in Linux using ____ command.
28 / 50
What do we name to an address that is loaded into the memory-address register of the memory?
29 / 50
The returned code to the child process after successful fork system call execution is
30 / 50
I MB or 1 megabyte is equivalent to----
31 / 50
n-process critical section problem can be solved by using
32 / 50
_____ system call is used to write to a file or FIFO or any other IPC channel.
33 / 50
___________ algorithm is used in Deadlock avoidance.
34 / 50
Operating System provides services such as Managing Primary and Secondary Storage, Processes and Allowing user to manage his/her files and directories.
35 / 50
If a system is not in a safe state, there can be No deadlocks.
36 / 50
__________ scheduler selects the process from the job pool and put them in main memory.
37 / 50
In deadlock detection and recovery algorithm, a deadlock exists in the system if and only if the wait for graph contains a _____________
38 / 50
The main characteristic of a Real time system is
39 / 50
___________ is used in real time operating systems.
40 / 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.
41 / 50
Operating system enables the user to use the Hardware Resources.
42 / 50
Starvation is infinite blocking caused due to unavailability of resources.
43 / 50
You can use the rm file1 command to __________ file1
44 / 50
rm and [r]mkdir commands are used to _____________ directory.
45 / 50
If the fork system call fails, it returns
46 / 50
_____________ is the basis of queuing theory which is branch of mathematics used to analyze systems involving queues and servers.
47 / 50
48 / 50
Mach, MacOS X Server, QNX, OS/2 and Windows NT are examples of OS Based on ______.
49 / 50
Binary semaphores are those that have only two values---------
50 / 50
If your processor does not have two slots empty in Per Process File Descriptor Table, then your _________ system call will fail.
Your score is
The average score is 36%
Restart quiz
