CS604-Midterm
1 / 50
Preemptive ----------------scheduling is sometimes called shortestremaining-time-first scheduling.
2 / 50
__________ scheduler selects the process from the job pool and put them in main memory.
3 / 50
In Resource Allocation Graph, A _______ Pi →Rj indicates that process Pi may request resource Rj at some time in the future.
4 / 50
A semaphore that cause Busy-Waiting is termed as .
5 / 50
Binary semaphores are those that have only two values---------
6 / 50
/usr/X11R6 is used by the X Window System.
7 / 50
__________ directory includes essential system boot files including the kernel image.
8 / 50
A major problem with priority scheduling algorithms is ______.
9 / 50
The creating process is called a--------------- process while the new processes are called the -------------- of that process
10 / 50
_____ system call is used to write to a file or FIFO or any other IPC channel.
11 / 50
The main characteristic of a Real time system is
12 / 50
First _______ entries in Per Process File Descriptor Table are used as soon as the process is created.
13 / 50
Progress and Bounded Waiting are some of the characteristics to solve the critical section problems.
14 / 50
In Unix/ Linux, by default the standard output file is attached to the ___________
15 / 50
When process opens its first file explicitly it will get descriptor number ______
16 / 50
You can use the ---------command in UNIX to create a directory.
17 / 50
A dashed line is used to represent a _________ in Resource Allocation Graph.
18 / 50
Kernel is responsible for scheduling the user level threads.
19 / 50
Linux is a version of _______ operating system.
20 / 50
You can display the contents (names of files and directories) of a directory in UNIX/Linux directory structure with the --------------- command.
21 / 50
A semaphore that cause Busy-Waiting is termed as ___________.
22 / 50
Shared libraries and kernel modules are stored in directory
23 / 50
A program in execution is called a _______________.
24 / 50
______scheduler selects the process from the job pool and put them in main memory.
25 / 50
The priorities of processes in the __________ group remain fixed.
26 / 50
User mode can run the Privileged instructions.
27 / 50
_____________ is the basis of queuing theory which is branch of mathematics used to analyze systems involving queues and servers.
28 / 50
Using _________system, we can create a new process in Linux.
29 / 50
In ________ communication the process which wants to communicate with the other process must explicitly name the recipient and the sender.
30 / 50
Physical memory is broken down into fixed-sized blocks, called----------- and Logical memory is divided into blocks of the same size, called -----------
31 / 50
I/O instructions are Privileged Instructions.
32 / 50
The _______ are used for communication between related or unrelated processes on the same system or unrelated processes on different systems.
33 / 50
The Purpose of Operating System is to generate Executable Programs and to _______ them.
34 / 50
Cooperating processes never share any data, code, memory or state.
35 / 50
_________ command to resume the execution of a suspended job in the foreground
36 / 50
The time it takes for the dispatcher to stop one process and start another running is known as the-----------.
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
The bottom-up view is that operating system is a resource manager who manages the hardware and software resources in the computer system.
39 / 50
Hardware provide basic computing resource.
40 / 50
Mach, MacOS X Server, QNX, OS/2 and Windows NT are examples of OS Based on ______.
41 / 50
What do we name to an address that is loaded into the memory-address register of the memory?
42 / 50
Bounded Buffer is a buffer of ____________ size
43 / 50
------------ register contains the size of the process
44 / 50
The bottom layer in the layered approach of Operating System is-----------
45 / 50
The major advantage of multi-programming system is
46 / 50
Time interval when the I/O Devices are accessed is known as --------.
47 / 50
The Shortest-Job-First Scheduling algorithm can be
48 / 50
49 / 50
Linux uses ___________ directory to store system configuration files.
50 / 50
____ command gives a snapshot of the current processes.
Your score is
The average score is 36%
Restart quiz
