CS604-Midterm
1 / 50
In ---------addressing; the recipient is not required to name the sender.
2 / 50
__________ integer shows the highest priority of a process in CPU scheduling
3 / 50
___________ algorithm is used in Deadlock avoidance.
4 / 50
__________ commands in Linux is used to copy file
5 / 50
If your processor does not have two slots empty in Per Process File Descriptor Table, then your _________ system call will fail.
6 / 50
A time sharing system is
7 / 50
This condition is known as ______________.
8 / 50
Utilities used for system administration (halt, ifconfig, fdisk, etc.) are stored in _____________ directory.
9 / 50
_____________ is the basis of queuing theory which is branch of mathematics used to analyze systems involving queues and servers.
10 / 50
In ---------addressing, the recipient is not required to name the sender.
11 / 50
The scheduling of ______ are done by the operating system.
12 / 50
Preventing a condition of ________ to happen, deadlocks can be prevented to happen.
13 / 50
A solution to the critical section problem must satisfy the following requirements
14 / 50
Mkfifo() is a _______.
15 / 50
If a system is not in a safe state, there can be No deadlocks.
16 / 50
In Unix/ Linux, by default the standard output file is attached to the ___________
17 / 50
Database, Complier, Video games are examples of ________.
18 / 50
In Layered approach of OS, Lowest Layer is known as ________.
19 / 50
____ command display the status of a process.
20 / 50
The hardware mechanism that enables a device to notify CPU is called an -------------
21 / 50
Progress and Bounded Waiting are some of the characteristics to solve the critical section problems.
22 / 50
A semaphore that cause Busy-Waiting is termed as ___________.
23 / 50
Round Robin algorithm is similar to ____________ scheduling but preemption is added to switch between processes.
24 / 50
The critical section problem can be solved by the following except
25 / 50
A system call________
26 / 50
The manual pages can be read in Linux using ____ command.
27 / 50
Managing Secondary Storage Involves all of the Following except
28 / 50
The creating process is called a--------------- process while the new processes are called the -------------- of that process
29 / 50
Users are the People, machines or computers that uses the Hardware resources.
30 / 50
/usr/X11R6 is used by the X Window System.
31 / 50
____ is a virtual directory in Linux and Unix.
32 / 50
All threads within a process share the ________ address space.
33 / 50
_______ is also called Swapper.
34 / 50
The number of processes completed per unit time is called ___________.
35 / 50
If the fork system call fails, it returns
36 / 50
Each page is a power of -------- bytes long in paging scheme.
37 / 50
Kernel is responsible for scheduling the user level threads.
38 / 50
In deadlock detection and recovery algorithm, a deadlock exists in the system if and only if the wait for graph contains a _____________
39 / 50
_________buffer places no practical limit on the size of the buffer
40 / 50
Hardware provide basic computing resource.
41 / 50
User Goal of OS is that It easy to use, reliable, safe and fast.
42 / 50
The time it takes for the dispatcher to stop one process and start another running is known as the-----------.
43 / 50
The performance of Round Robin algorithm does NOT depends heavily on the size of the time quantum.
44 / 50
________ determines What will be done.
45 / 50
You can terminate a foreground process by pressing --------------
46 / 50
The execution of critical sections must NOT be mutually exclusive
47 / 50
The priority of a process can be changed using ___________ command.
48 / 50
The Home Directory for superuser in Linux and Unix is
49 / 50
The priorities of processes in the __________ group remain fixed.
50 / 50
command displays the contents of current working directory.
Your score is
The average score is 36%
Restart quiz
