CS604-Midterm
1 / 50
A dashed line is used to represent a _________ in Resource Allocation Graph.
2 / 50
You can display all of the signals supported by your system, along with their numbers, by using the -----------command
3 / 50
copy file1 file2 is an example of ______ OS view.
4 / 50
_________buffer places no practical limit on the size of the buffer
5 / 50
If your processor does not have two slots empty in Per Process File Descriptor Table, then your _________ system call will fail.
6 / 50
Cooperating processes never share any data, code, memory or state.
7 / 50
All threads within a process share the ________ address space.
8 / 50
A time sharing system is
9 / 50
DOS is single user operating system.
10 / 50
You can display the contents (names of files and directories) of a directory in UNIX/Linux directory structure with the --------------- command.
11 / 50
The Shortest-Job-First Scheduling algorithm can be
12 / 50
The nice value helps in assigning ______ to a process.
13 / 50
Progress and Bounded Waiting are some of the characteristics to solve the critical section problems.
14 / 50
Which part of the computer system helps in managing the file and memory management system?
15 / 50
Preemptive ----------------scheduling is sometimes called shortestremaining-time-first scheduling.
16 / 50
A program in execution is called a _______________.
17 / 50
The basic purpose of ________________is to help the users to utilize the hardware resources for completing different tasks in a simplified manner
18 / 50
User mode can run the Privileged instructions.
19 / 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.
20 / 50
If a system is not in a safe state, there can be No deadlocks.
21 / 50
Physical memory is broken down into fixed-sized blocks, called----------- and Logical memory is divided into blocks of the same size, called -----------
22 / 50
The time it takes for the dispatcher to stop one process and start another running is known as the-----------.
23 / 50
A pathname is the list of directories separated by _________.
24 / 50
A semaphore that cause Busy-Waiting is termed as .
25 / 50
The number of processes completed per unit time is called ___________.
26 / 50
An absolute pathname starts with the root directory (/) and a relative pathname starts with your home directory.
27 / 50
The priority of a process can be changed using ___________ command.
28 / 50
This condition is known as ______________.
29 / 50
The process of switching from one process to another is called ---------------.
30 / 50
In Layered approach of OS, Lowest Layer is known as ________.
31 / 50
Swapper is also termed as Short term scheduler.
32 / 50
First _______ entries in Per Process File Descriptor Table are used as soon as the process is created.
33 / 50
Which register holds the smallest legal physical memory address for a process?
34 / 50
____ command gives a snapshot of the current processes.
35 / 50
The priorities of processes in the __________ group remain fixed.
36 / 50
The bottom layer in the layered approach of Operating System is-----------
37 / 50
_____________ determines How to do something.
38 / 50
command displays the contents of current working directory.
39 / 50
Linux Treats Devices as Files.
40 / 50
The performance of Round Robin algorithm does NOT depends heavily on the size of the time quantum.
41 / 50
In ________ communication the process which wants to communicate with the other process must explicitly name the recipient and the sender.
42 / 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.
43 / 50
Round Robin algorithm is similar to ____________ scheduling but preemption is added to switch between processes.
44 / 50
__________ scheduler selects the process from the job pool and put them in main memory.
45 / 50
POSIX is a standard developed by ANSI
46 / 50
The hardware mechanism that enables a device to notify CPU is called an -------------
47 / 50
You can terminate a foreground process by pressing --------------
48 / 50
Batch programs are usually _________ programs.
49 / 50
First-Come, First-Served (FCFS) is a --------------scheduling algorithm.
50 / 50
In ---------addressing, the recipient is not required to name the sender.
Your score is
The average score is 36%
Restart quiz
