CS604-Midterm
1 / 50
Banker‟s algorithm is used for ________________
2 / 50
Shared libraries and kernel modules are stored in directory
3 / 50
In Unix/ Linux, by default the standard output file is attached to the ___________
4 / 50
A parent process calling __________ system call will be suspended until children process terminates.
5 / 50
POSIX is a standard developed by ANSI
6 / 50
In ________addressing, the recipient is not required to name the sender.
7 / 50
In Resource Allocation Graph, A _______ Pi →Rj indicates that process Pi may request resource Rj at some time in the future.
8 / 50
A major problem with priority scheduling algorithms is ______.
9 / 50
In indirect inter process communication, a sender ________ mention the name of the recipient.
10 / 50
You can create a threads by using the pthread_create() call.
11 / 50
____ command display the status of a process.
12 / 50
In Layered Approach of OS, the Layer highest Layer is User Interface layer.
13 / 50
The time it takes for the dispatcher to stop one process and start another running is known as the-----------.
14 / 50
A pathname is the list of directories separated by _________.
15 / 50
The Shortest-Job-First Scheduling algorithm can be
16 / 50
n-process critical section problem can be solved by using
17 / 50
In ________ communication the process which wants to communicate with the other process must explicitly name the recipient and the sender.
18 / 50
Which of the Following is not an Operating System.
19 / 50
You can terminate a foreground process by pressing --------------
20 / 50
The -----------scheme is not applicable to a resource allocation system with multiple instances of each resource type.
21 / 50
All threads within a process share the ________ address space.
22 / 50
Command-line interpreter is also called __________ in some operating systems.
23 / 50
____ is a virtual directory in Linux and Unix.
24 / 50
Kernel is responsible for scheduling the user level threads.
25 / 50
The process of switching from one process to another is called ---------------.
26 / 50
A semaphore that cause Busy-Waiting is termed as ___________.
27 / 50
_____________ is the basis of queuing theory which is branch of mathematics used to analyze systems involving queues and servers.
28 / 50
___________ is a piece of code in a cooperating process in which the process may updates shared data (variable, file, database, etc.).
29 / 50
If the system can allocate resources to each process in some order and still avoid a deadlock then it said to be in ______ state.
30 / 50
_____________ is a preemptive scheduling algorithm.
31 / 50
The interval from the time of submission to the time of completion is the ______
32 / 50
__________ displays information about the top processes.
33 / 50
Operating system enables the user to use the Hardware Resources.
34 / 50
The number of processes completed per unit time is called ___________.
35 / 50
You can use the ---------command in UNIX to create a directory.
36 / 50
Mkfifo() is a _______.
37 / 50
The nice value helps in assigning ______ to a process.
38 / 50
__________ scheduler selects the process from the job pool and put them in main memory.
39 / 50
I MB or 1 megabyte is equivalent to----
40 / 50
Which of the following is correct definition for wait operation?
41 / 50
The major advantage of multi-programming system is
42 / 50
Preemptive ----------------scheduling is sometimes called shortestremaining-time-first scheduling.
43 / 50
The integer value of ________semaphores can range over an unrestricted integer domain.
44 / 50
The bottom layer in the layered approach of Operating System is-----------
45 / 50
User Goal of OS is that It easy to use, reliable, safe and fast.
46 / 50
An absolute pathname starts with the root directory (/) and a relative pathname starts with your home directory.
47 / 50
Preventing a condition of ________ to happen, deadlocks can be prevented to happen.
48 / 50
Linux uses ___________ directory to store system configuration files.
49 / 50
In deadlock detection and recovery algorithm, a deadlock exists in the system if and only if the wait for graph contains a _____________
50 / 50
Which of the following is NOT a Hardware Resource.
Your score is
The average score is 36%
Restart quiz
