CS604-Midterm
1 / 50
_____________ is the basis of queuing theory which is branch of mathematics used to analyze systems involving queues and servers.
2 / 50
------------ register contains the size of the process
3 / 50
____ command display the status of a process.
4 / 50
The _______ are used for communication between related or unrelated processes on the same system or unrelated processes on different systems.
5 / 50
___________ is used in real time operating systems.
6 / 50
Swapper is also termed as Short term scheduler.
7 / 50
__________ directory includes essential system boot files including the kernel image.
8 / 50
The integer value of ________semaphores can range over an unrestricted integer domain.
9 / 50
The priority of a process can be changed using ___________ command.
10 / 50
___________ algorithm is used in Deadlock avoidance.
11 / 50
When a process opens its first file explicitly it will get descriptor number _________
12 / 50
If your processor does not have two slots empty in Per Process File Descriptor Table, then your _________ system call will fail.
13 / 50
_____________ is a preemptive scheduling algorithm.
14 / 50
OS helps manages the following except
15 / 50
Kernel is responsible for scheduling the user level threads.
16 / 50
__________ displays information about the top processes.
17 / 50
rm and [r]mkdir commands are used to _____________ directory.
18 / 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 _________.
19 / 50
__________ commands in Linux is used to copy file
20 / 50
Progress and Bounded Waiting are some of the characteristics to solve the critical section problems.
21 / 50
Shared libraries and kernel modules are stored in directory
22 / 50
Users are the People, machines or computers that uses the Hardware resources.
23 / 50
Which of the following is NOT a Hardware Resource.
24 / 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.”
25 / 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 ________.
26 / 50
I/O instructions are Privileged Instructions.
27 / 50
The execution of critical sections must NOT be mutually exclusive
28 / 50
The interval from the time of submission to the time of completion is the ______
29 / 50
I MB or 1 megabyte is equivalent to----
30 / 50
Batch programs are usually _________ programs.
31 / 50
Mkfifo() is a _______.
32 / 50
The priorities of processes in the __________ group remain fixed.
33 / 50
POSIX is a standard developed by ANSI
34 / 50
In ________addressing, the recipient is not required to name the sender.
35 / 50
The address generated by the CPU, after any indexing or other addressing-mode arithmetic, is called a --------address, and the address it gets translated to by the MMU is called a ---------address.
36 / 50
A semaphore that cause Busy-Waiting is termed as ___________.
37 / 50
The manual pages can be read in Linux using ____ command.
38 / 50
------------has a hierarchical file system structure.
39 / 50
Mach, MacOS X Server, QNX, OS/2 and Windows NT are examples of OS Based on ______.
40 / 50
You can use the rm file1 command to __________ file1
41 / 50
-------- command gives a snapshot of the current processes.
42 / 50
_____ system call is used to write to a file or FIFO or any other IPC channel.
43 / 50
A program in execution is called a _______________.
44 / 50
You can display all of the signals supported by your system, along with their numbers, by using the -----------command
45 / 50
The Home Directory for superuser in Linux and Unix is
46 / 50
The basic purpose of ________________is to help the users to utilize the hardware resources for completing different tasks in a simplified manner
47 / 50
The -----------scheme is not applicable to a resource allocation system with multiple instances of each resource type.
48 / 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.
49 / 50
Round Robin algorithm is similar to ____________ scheduling but preemption is added to switch between processes.
50 / 50
_________________ scheduling allows a process to move between queues.
Your score is
The average score is 36%
Restart quiz
