CS604-Midterm
1 / 50
____ command display the status of a process.
2 / 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.
3 / 50
In ---------addressing, the recipient is not required to name the sender.
4 / 50
Which of the Following is not an Operating System.
5 / 50
A dashed line is used to represent a _________ in Resource Allocation Graph.
6 / 50
-------- command gives a snapshot of the current processes.
7 / 50
You can terminate a foreground process by pressing --------------
8 / 50
You can use the rm file1 command to __________ file1
9 / 50
First-Come, First-Served (FCFS) is a --------------scheduling algorithm.
10 / 50
_________buffer places no practical limit on the size of the buffer
11 / 50
The performance of Round Robin algorithm does NOT depends heavily on the size of the time quantum.
12 / 50
The critical section problem can be solved by the following except
13 / 50
Which of the following is correct definition for wait operation?
14 / 50
15 / 50
________ scheduling algorithm is sometimes called shortest remaining time first scheduling algorithm.
16 / 50
command displays the contents of current working directory.
17 / 50
_____________ is the basis of queuing theory which is branch of mathematics used to analyze systems involving queues and servers.
18 / 50
A parent process calling __________ system call will be suspended until children process terminates.
19 / 50
A pathname is the list of directories separated by _________.
20 / 50
If a system is not in a safe state, there can be No deadlocks.
21 / 50
The process of holding at least one resource and waiting to acquire additional resources that are currently being held by other processes is known as________.
22 / 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.
23 / 50
Command-line interpreter is also called __________ in some operating systems.
24 / 50
The process of switching from one process to another is called latency.
25 / 50
The bottom layer in the layered approach of Operating System is-----------
26 / 50
When a process opens its first file explicitly it will get descriptor number _________
27 / 50
--------------command to resume the execution of a suspended job in the foreground
28 / 50
The ________ requires that once a writer is ready, that writer performs its write as soon as possible , if a writer waiting to access the object, no new readers may start reading.
29 / 50
__________ displays information about the top processes.
30 / 50
Time interval when the I/O Devices are accessed is known as --------.
31 / 50
Users are the People, machines or computers that uses the Hardware resources.
32 / 50
A process is said to be in critical section if it executes code that manipulates shared data
33 / 50
The -----------scheme is not applicable to a resource allocation system with multiple instances of each resource type.
34 / 50
The Operating system is a layer of software between _________ and ___________.
35 / 50
________________ is an integer variable accessible through wait and signal which are atomic operations.
36 / 50
In ---------addressing; the recipient is not required to name the sender.
37 / 50
The creating process is called a--------------- process while the new processes are called the -------------- of that process
38 / 50
A time sharing system is
39 / 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.
40 / 50
Database, Complier, Video games are examples of ________.
41 / 50
In deadlock detection and recovery algorithm, a deadlock exists in the system if and only if the wait for graph contains a _____________
42 / 50
copy file1 file2 is an example of ______ OS view.
43 / 50
A semaphore that cause Busy-Waiting is termed as .
44 / 50
The process id returned to the child process after successful fork system call execution is _____________.
45 / 50
Operating System is the Manager of Hardware Resources.
46 / 50
Files that start with a -------- in UNIX/Linux directory structure are known as hidden files .
47 / 50
Managing Secondary Storage Involves all of the Following except
48 / 50
Cache is non-volatile memory.
49 / 50
In Resource Allocation Graph, A _______ Pi →Rj indicates that process Pi may request resource Rj at some time in the future.
50 / 50
Preventing a condition of ________ to happen, deadlocks can be prevented to happen.
Your score is
The average score is 36%
Restart quiz
