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 time sharing system is
3 / 50
A parent process calling __________ system call will be suspended until children process terminates.
4 / 50
The returned code to the child process after successful fork system call execution is
5 / 50
In indirect inter process communication, a sender ________ mention the name of the recipient.
6 / 50
OS helps manages the following except
7 / 50
------------ register contains the size of the process
8 / 50
n-process critical section problem can be solved by using
9 / 50
The performance of Round Robin algorithm does NOT depends heavily on the size of the time quantum.
10 / 50
In ________ communication the process which wants to communicate with the other process must explicitly name the recipient and the sender.
11 / 50
I/O instructions are Privileged Instructions.
12 / 50
POSIX is a standard developed by ANSI
13 / 50
Hardware provide basic computing resource.
14 / 50
The priorities of processes in the __________ group remain fixed.
15 / 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 ________.
16 / 50
First-Come, First-Served (FCFS) is a --------------scheduling algorithm.
17 / 50
__________ scheduler selects the process from the job pool and put them in main memory.
18 / 50
We can install and run multiple OS by using VMWare.
19 / 50
In deadlock detection and recovery algorithm, a deadlock exists in the system if and only if the wait for graph contains a _____________
20 / 50
--------------command to resume the execution of a suspended job in the foreground
21 / 50
Swapper is also termed as Short term scheduler.
22 / 50
You can use the ---------command in UNIX to create a directory.
23 / 50
Command-line interpreter is also called __________ in some operating systems.
24 / 50
Banker‟s algorithm is used for ________________
25 / 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________.
26 / 50
_______ is also called Swapper.
27 / 50
If a system is not in a safe state, there can be No deadlocks.
28 / 50
The number of processes completed per unit time is called ___________.
29 / 50
A program in execution is called a _______________.
30 / 50
Which register holds the smallest legal physical memory address for a process?
31 / 50
__________ directory includes essential system boot files including the kernel image.
32 / 50
A process is said to be in critical section if it executes code that manipulates shared data
33 / 50
I MB or 1 megabyte is equivalent to----
34 / 50
What do we name to an address that is loaded into the memory-address register of the memory?
35 / 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.
36 / 50
_____________ is the basis of queuing theory which is branch of mathematics used to analyze systems involving queues and servers.
37 / 50
copy file1 file2 is an example of ______ OS view.
38 / 50
The -----------scheme is not applicable to a resource allocation system with multiple instances of each resource type.
39 / 50
The bottom-up view is that operating system is a resource manager who manages the hardware and software resources in the computer system.
40 / 50
Database, Complier, Video games are examples of ________.
41 / 50
Using _________system, we can create a new process in Linux.
42 / 50
Files that start with a -------- in UNIX/Linux directory structure are known as hidden files .
43 / 50
_____ system call is used to write to a file or FIFO or any other IPC channel.
44 / 50
The execution of critical sections must NOT be mutually exclusive
45 / 50
Preemptive ----------------scheduling is sometimes called shortestremaining-time-first scheduling.
46 / 50
A pathname is the list of directories separated by _________.
47 / 50
command displays the contents of current working directory.
48 / 50
A major problem with priority scheduling algorithms is ______.
49 / 50
If your processor does not have two slots empty in Per Process File Descriptor Table, then your _________ system call will fail.
50 / 50
The nice value helps in assigning ______ to a process.
Your score is
The average score is 36%
Restart quiz
