CS604-Midterm
1 / 50
IPC provides a mechanism to allow processes to communicate and to synchronize their actions without sharing the same__________
2 / 50
A_____ is an abstract key for accessing a file.
3 / 50
Which register holds the smallest legal physical memory address for a process?
4 / 50
/usr/X11R6 is used by the X Window System.
5 / 50
A pathname is the list of directories separated by _________.
6 / 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.
7 / 50
___________ is a solution to the problem of indefinite blockage of low-priority processes.
8 / 50
Linux uses ___________ directory to store system configuration files.
9 / 50
DOS is single user operating system.
10 / 50
The -----------scheme is not applicable to a resource allocation system with multiple instances of each resource type.
11 / 50
The interval from the time of submission to the time of completion is the ______
12 / 50
The time it takes for the dispatcher to stop one process and start another running is known as the-----------.
13 / 50
The critical section problem can be solved by the following except
14 / 50
Physical memory is broken down into fixed-sized blocks, called----------- and Logical memory is divided into blocks of the same size, called -----------
15 / 50
The hardware mechanism that enables a device to notify CPU is called an -------------
16 / 50
--------------command to resume the execution of a suspended job in the foreground
17 / 50
In ________ communication the process which wants to communicate with the other process must explicitly name the recipient and the sender.
18 / 50
__________ integer shows the highest priority of a process in CPU scheduling
19 / 50
In ---------addressing; the recipient is not required to name the sender.
20 / 50
Each process must first request permission to enter its critical section. The section of code implementing this request is called the _____
21 / 50
___________ is a piece of code in a cooperating process in which the process may updates shared data (variable, file, database, etc.).
22 / 50
A Process „A‟ that has finished working but its parent process has also finished its execution. In this state the process „A‟ will be called as _____ process.
23 / 50
Mkfifo() is a _______.
24 / 50
All threads within a process share the ________ address space.
25 / 50
Preventing a condition of ________ to happen, deadlocks can be prevented to happen.
26 / 50
The creating process is called a--------------- process while the new processes are called the -------------- of that process
27 / 50
POSIX is a standard developed by ANSI
28 / 50
Files that start with a -------- in UNIX/Linux directory structure are known as hidden files .
29 / 50
The _______ are used for communication between related or unrelated processes on the same system or unrelated processes on different systems.
30 / 50
___________ is used in real time operating systems.
31 / 50
The bottom layer in the layered approach of Operating System is-----------
32 / 50
In ---------addressing, the recipient is not required to name the sender.
33 / 50
Linux is a version of _______ operating system.
34 / 50
_____________ determines How to do something.
35 / 50
Progress and Bounded Waiting are some of the characteristics to solve the critical section problems.
36 / 50
n-process critical section problem can be solved by using
37 / 50
I MB or 1 megabyte is equivalent to----
38 / 50
Cooperating processes never share any data, code, memory or state.
39 / 50
Operating System is the Manager of Hardware Resources.
40 / 50
In Linux directory structure, there is ___________ root directory.
41 / 50
Command-line interpreter is also called __________ in some operating systems.
42 / 50
Current working directory can be accessed using --------- Command.
43 / 50
__________ scheduler selects the process from the job pool and put them in main memory.
44 / 50
You can terminate a foreground process by pressing --------------
45 / 50
Users are the People, machines or computers that uses the Hardware resources.
46 / 50
______scheduler selects the process from the job pool and put them in main memory.
47 / 50
________ scheduling algorithm is sometimes called shortest remaining time first scheduling algorithm.
48 / 50
Cache is non-volatile memory.
49 / 50
First-Come, First-Served (FCFS) is a --------------scheduling algorithm.
50 / 50
You can display the contents (names of files and directories) of a directory in UNIX/Linux directory structure with the --------------- command.
Your score is
The average score is 36%
Restart quiz
