CS604-Midterm
1 / 50
A time sharing system is
2 / 50
The time it takes for the dispatcher to stop one process and start another running is known as the-----------.
3 / 50
A dashed line is used to represent a _________ in Resource Allocation Graph.
4 / 50
A_______ is an integer variable that, apart from initialization is accessible only through two standard atomic operations: wait and signal.
5 / 50
____ is a virtual directory in Linux and Unix.
6 / 50
In deadlock detection and recovery algorithm, a deadlock exists in the system if and only if the wait for graph contains a _____________
7 / 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 ________.
8 / 50
The Operating system is a layer of software between _________ and ___________.
9 / 50
I/O instructions are Privileged Instructions.
10 / 50
Which of the Following is not an Operating System.
11 / 50
_________________ scheduling allows a process to move between queues.
12 / 50
Hardware provide basic computing resource.
13 / 50
In Layered Approach of OS, the Layer highest Layer is User Interface layer.
14 / 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________.
15 / 50
Swapper is also termed as Short term scheduler.
16 / 50
________________ is an integer variable accessible through wait and signal which are atomic operations.
17 / 50
__________ integer shows the highest priority of a process in CPU scheduling
18 / 50
The correct command for compiling C program named program.c in Linux environment is
19 / 50
___________ is a piece of code in a cooperating process in which the process may updates shared data (variable, file, database, etc.).
20 / 50
The 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 ________.
21 / 50
The bottom-up view is that operating system is a resource manager who manages the hardware and software resources in the computer system.
22 / 50
User mode can run the Privileged instructions.
23 / 50
Progress and Bounded Waiting are some of the characteristics to solve the critical section problems.
24 / 50
The manual pages can be read in Linux using ____ command.
25 / 50
Banker‟s algorithm is used for ________________
26 / 50
Bounded Buffer is a buffer of ____________ size
27 / 50
The main characteristic of a Real time system is
28 / 50
The process id returned to the child process after successful fork system call execution is _____________.
29 / 50
Preemptive ----------------scheduling is sometimes called shortestremaining-time-first scheduling.
30 / 50
________ determines What will be done.
31 / 50
________ scheduling algorithm is sometimes called shortest remaining time first scheduling algorithm.
32 / 50
Each process must first request permission to enter its critical section. The section of code implementing this request is called the _____
33 / 50
The priorities of processes in the __________ group remain fixed.
34 / 50
In Unix/ Linux, by default the standard output file is attached to the ___________
35 / 50
Mach, MacOS X Server, QNX, OS/2 and Windows NT are examples of OS Based on ______.
36 / 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.”
37 / 50
An absolute pathname starts with the root directory (/) and a relative pathname starts with your home directory.
38 / 50
Cache is non-volatile memory.
39 / 50
The execution of critical sections must NOT be mutually exclusive
40 / 50
User Goal of OS is that It easy to use, reliable, safe and fast.
41 / 50
Operating System provides services such as Managing Primary and Secondary Storage, Processes and Allowing user to manage his/her files and directories.
42 / 50
If your processor does not have two slots empty in Per Process File Descriptor Table, then your _________ system call will fail.
43 / 50
Which part of the computer system helps in managing the file and memory management system?
44 / 50
IPC provides a mechanism to allow processes to communicate and to synchronize their actions without sharing the same__________
45 / 50
___________ is a solution to the problem of indefinite blockage of low-priority processes.
46 / 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 _________.
47 / 50
You can display the contents (names of files and directories) of a directory in UNIX/Linux directory structure with the --------------- command.
48 / 50
An operating system is a control program that manages the execution of user programs to prevent errors and improper use of a computer.
49 / 50
The Shortest-Job-First Scheduling algorithm can be
50 / 50
In indirect inter process communication, a sender_____mention the name of the recipient.
Your score is
The average score is 36%
Restart quiz
