CS604-Midterm
1 / 50
command displays the contents of current working directory.
2 / 50
____ is a virtual directory in Linux and Unix.
3 / 50
_____________ determines How to do something.
4 / 50
Taking the CPU from one process and giving the CPU to another process is termed as
5 / 50
User Goal of OS is that It easy to use, reliable, safe and fast.
6 / 50
-------- command gives a snapshot of the current processes.
7 / 50
I MB or 1 megabyte is equivalent to----
8 / 50
Swapper is also termed as Short term scheduler.
9 / 50
__________ directory includes essential system boot files including the kernel image.
10 / 50
A major problem with priority scheduling algorithms is ______.
11 / 50
The execution of critical sections must NOT be mutually exclusive
12 / 50
When a process opens its first file explicitly it will get descriptor number _________
13 / 50
/usr/X11R6 is used by the X Window System.
14 / 50
In ________ communication the process which wants to communicate with the other process must explicitly name the recipient and the sender.
15 / 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________.
16 / 50
The manual pages can be read in Linux using ____ command.
17 / 50
OS helps manages the following except
18 / 50
Each process must first request permission to enter its critical section. The section of code implementing this request is called the _____
19 / 50
The Purpose of Operating System is to generate Executable Programs and to _______ them.
20 / 50
Round Robin algorithm is similar to ____________ scheduling but preemption is added to switch between processes.
21 / 50
Which register holds the smallest legal physical memory address for a process?
22 / 50
Utilities used for system administration (halt, ifconfig, fdisk, etc.) are stored in _____________ directory.
23 / 50
A pathname is the list of directories separated by _________.
24 / 50
The performance of Round Robin algorithm does NOT depends heavily on the size of the time quantum.
25 / 50
I/O instructions are Privileged Instructions.
26 / 50
Command-line interpreter is also called __________ in some operating systems.
27 / 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.
28 / 50
Shared libraries and kernel modules are stored in directory
29 / 50
In Layered Approach of OS, the Layer highest Layer is User Interface layer.
30 / 50
--------------command to resume the execution of a suspended job in the foreground
31 / 50
A program in execution is called a _______________.
32 / 50
_________________ scheduling allows a process to move between queues.
33 / 50
What do we name to an address that is loaded into the memory-address register of the memory?
34 / 50
The integer value of ________semaphores can range over an unrestricted integer domain.
35 / 50
The critical section problem can be solved by the following except
36 / 50
------------ register contains the size of the process
37 / 50
/opt is used for storage of large applications.
38 / 50
The creating process is called a--------------- process while the new processes are called the -------------- of that process
39 / 50
------------has a hierarchical file system structure.
40 / 50
copy file1 file2 is an example of ______ OS view.
41 / 50
_______ is also called Swapper.
42 / 50
The hardware mechanism that enables a device to notify CPU is called an -------------
43 / 50
__________ scheduler selects the process from the job pool and put them in main memory.
44 / 50
Cache is non-volatile memory.
45 / 50
___________ is a solution to the problem of indefinite blockage of low-priority processes.
46 / 50
The interval from the time of submission to the time of completion is the ______
47 / 50
The bottom layer in the layered approach of Operating System is-----------
48 / 50
First-Come, First-Served (FCFS) is a --------------scheduling algorithm.
49 / 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.”
50 / 50
___________ is used in real time operating systems.
Your score is
The average score is 36%
Restart quiz
