CS604-Midterm
1 / 50
___________ is a solution to the problem of indefinite blockage of low-priority processes.
2 / 50
In ________ communication the process which wants to communicate with the other process must explicitly name the recipient and the sender.
3 / 50
Shared libraries and kernel modules are stored in directory
4 / 50
The time it takes for the dispatcher to stop one process and start another running is known as the-----------.
5 / 50
The major advantage of multi-programming system is
6 / 50
Mach, MacOS X Server, QNX, OS/2 and Windows NT are examples of OS Based on ______.
7 / 50
Which of the following is NOT a Hardware Resource.
8 / 50
The Operating system is a layer of software between _________ and ___________.
9 / 50
The performance of Round Robin algorithm does NOT depends heavily on the size of the time quantum.
10 / 50
The main characteristic of a Real time system is
11 / 50
The number of processes completed per unit time is called ___________.
12 / 50
The scheduling of ______ are done by the operating system.
13 / 50
/usr/X11R6 is used by the X Window System.
14 / 50
___________ algorithm is used in Deadlock avoidance.
15 / 50
--------------command to resume the execution of a suspended job in the foreground
16 / 50
The Shortest-Job-First Scheduling algorithm can be
17 / 50
The nice value helps in assigning ______ to a process.
18 / 50
In Layered Approach of OS, the Layer highest Layer is User Interface layer.
19 / 50
In Unix/ Linux, by default the standard input file is attached to the ___________
20 / 50
The correct command for compiling C program named program.c in Linux environment is
21 / 50
__________ scheduler selects the process from the job pool and put them in main memory.
22 / 50
In deadlock detection and recovery algorithm, a deadlock exists in the system if and only if the wait for graph contains a _____________
23 / 50
POSIX is a standard developed by ANSI
24 / 50
Round Robin algorithm is similar to ____________ scheduling but preemption is added to switch between processes.
25 / 50
A ---------------- (or an exception) is a software-generated interrupt caused either by an error (division by zero or invalid memory access) or by a user request for an operating system service.
26 / 50
You can create a threads by using the pthread_create() call.
27 / 50
A semaphore that cause Busy-Waiting is termed as .
28 / 50
The process id returned to the child process after successful fork system call execution is _____________.
29 / 50
First-Come, First-Served (FCFS) is a --------------scheduling algorithm.
30 / 50
I/O instructions are Privileged Instructions.
31 / 50
Files that start with a -------- in UNIX/Linux directory structure are known as hidden files .
32 / 50
OS helps manages the following except
33 / 50
DOS is single user operating system.
34 / 50
------------ register contains the size of the process
35 / 50
__________ displays information about the top processes.
36 / 50
In ________addressing, the recipient is not required to name the sender.
37 / 50
The process of switching from one process to another is called latency.
38 / 50
The execution of critical sections must NOT be mutually exclusive
39 / 50
If your processor does not have two slots empty in Per Process File Descriptor Table, then your _________ system call will fail.
40 / 50
Utilities used for system administration (halt, ifconfig, fdisk, etc.) are stored in _____________ directory.
41 / 50
Which part of the computer system helps in managing the file and memory management system?
42 / 50
The hardware mechanism that enables a device to notify CPU is called an -------------
43 / 50
A process is said to be in critical section if it executes code that manipulates shared data
44 / 50
Taking the CPU from one process and giving the CPU to another process is termed as
45 / 50
All threads within a process share the ________ address space.
46 / 50
Using _________system, we can create a new process in Linux.
47 / 50
When a process opens its first file explicitly it will get descriptor number _________
48 / 50
Which of the following is correct definition for wait operation?
49 / 50
Physical memory is broken down into fixed-sized blocks, called----------- and Logical memory is divided into blocks of the same size, called -----------
50 / 50
Cooperating processes never share any data, code, memory or state.
Your score is
The average score is 36%
Restart quiz
