CS604-Midterm
1 / 50
The _______ are used for communication between related or unrelated processes on the same system or unrelated processes on different systems.
2 / 50
A_____ is an abstract key for accessing a file.
3 / 50
Using _________system, we can create a new process in Linux.
4 / 50
In Layered Approach of OS, the Layer highest Layer is User Interface layer.
5 / 50
Operating System provides services such as Managing Primary and Secondary Storage, Processes and Allowing user to manage his/her files and directories.
6 / 50
--------------command to resume the execution of a suspended job in the foreground
7 / 50
The performance of Round Robin algorithm does NOT depends heavily on the size of the time quantum.
8 / 50
____ command display the status of a process.
9 / 50
Progress and Bounded Waiting are some of the characteristics to solve the critical section problems.
10 / 50
The nice value helps in assigning ______ to a process.
11 / 50
Managing Secondary Storage Involves all of the Following except
12 / 50
The scheduling of ______ are done by the operating system.
13 / 50
In ________ communication the process which wants to communicate with the other process must explicitly name the recipient and the sender.
14 / 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.
15 / 50
If your processor does not have two slots empty in Per Process File Descriptor Table, then your _________ system call will fail.
16 / 50
The interval from the time of submission to the time of completion is the ______
17 / 50
The number of processes completed per unit time is called ___________.
18 / 50
The Shortest-Job-First Scheduling algorithm can be
19 / 50
A solution to the critical section problem must satisfy the following requirements
20 / 50
A system call________
21 / 50
The main characteristic of a Real time system is
22 / 50
Shared libraries and kernel modules are stored in directory
23 / 50
A semaphore that cause Busy-Waiting is termed as ___________.
24 / 50
The time it takes for the dispatcher to stop one process and start another running is known as the-----------.
25 / 50
All threads within a process share the ________ address space.
26 / 50
The priority of a process can be changed using ___________ command.
27 / 50
command displays the contents of current working directory.
28 / 50
Utilities used for system administration (halt, ifconfig, fdisk, etc.) are stored in _____________ directory.
29 / 50
A Process that has finished working, as well as its parent process has also finished its execution. In this state the process A will be called as _________ process.
30 / 50
------------ register contains the size of the process
31 / 50
If a system is not in a safe state, there can be No deadlocks.
32 / 50
__________ integer shows the highest priority of a process in CPU scheduling
33 / 50
Which of the following is correct definition for wait operation?
34 / 50
The creating process is called a--------------- process while the new processes are called the -------------- of that process
35 / 50
The major advantage of multi-programming system is
36 / 50
A program in execution is called a _______________.
37 / 50
The Purpose of Operating System is to generate Executable Programs and to _______ them.
38 / 50
The process of switching from one process to another is called latency.
39 / 50
_________________ scheduling allows a process to move between queues.
40 / 50
If the fork system call fails, it returns
41 / 50
A process is said to be in critical section if it executes code that manipulates shared data
42 / 50
_________ command to resume the execution of a suspended job in the foreground
43 / 50
Bounded Buffer is a buffer of ____________ size
44 / 50
In indirect inter process communication, a sender_____mention the name of the recipient.
45 / 50
In ________addressing, the recipient is not required to name the sender.
46 / 50
The -------------- system call suspends the calling process.
47 / 50
_____ system call is used to write to a file or FIFO or any other IPC channel.
48 / 50
A_______ is an integer variable that, apart from initialization is accessible only through two standard atomic operations: wait and signal.
49 / 50
A time sharing system is
50 / 50
_____________ is a preemptive scheduling algorithm.
Your score is
The average score is 36%
Restart quiz
