CS604-Midterm
1 / 50
Physical memory is broken down into fixed-sized blocks, called----------- and Logical memory is divided into blocks of the same size, called -----------
2 / 50
Preemptive ----------------scheduling is sometimes called shortestremaining-time-first scheduling.
3 / 50
In ---------addressing; the recipient is not required to name the sender.
4 / 50
If the fork system call fails, it returns
5 / 50
What do we name to an address that is loaded into the memory-address register of the memory?
6 / 50
The priorities of processes in the __________ group remain fixed.
7 / 50
Operating System provides services such as Managing Primary and Secondary Storage, Processes and Allowing user to manage his/her files and directories.
8 / 50
Time interval when the I/O Devices are accessed is known as --------.
9 / 50
__________ directory includes essential system boot files including the kernel image.
10 / 50
The time it takes for the dispatcher to stop one process and start another running is known as the-----------.
11 / 50
________________ is an integer variable accessible through wait and signal which are atomic operations.
12 / 50
Bounded Buffer is a buffer of ____________ size
13 / 50
Operating System is the Manager of Hardware Resources.
14 / 50
The bottom-up view is that operating system is a resource manager who manages the hardware and software resources in the computer system.
15 / 50
Database, Complier, Video games are examples of ________.
16 / 50
n-process critical section problem can be solved by using
17 / 50
The following requirement for solving critical section problem is known as ______. “There exists a bound on the number of times that other processes are allowed to enter their critical sections after a process has made a request to enter its critical section and before that request is granted.”
18 / 50
Operating system enables the user to use the Hardware Resources.
19 / 50
We can install and run multiple OS by using VMWare.
20 / 50
You can use the ---------command in UNIX to create a directory.
21 / 50
A major problem with priority scheduling algorithms is ______.
22 / 50
Hardware provide basic computing resource.
23 / 50
IPC provides a mechanism to allow processes to communicate and to synchronize their actions without sharing the same__________
24 / 50
Swapper is also termed as Short term scheduler.
25 / 50
___________ is a solution to the problem of indefinite blockage of low-priority processes.
26 / 50
__________ commands in Linux is used to copy file
27 / 50
Cache is non-volatile memory.
28 / 50
A parent process calling __________ system call will be suspended until children process terminates.
29 / 50
The procedure “The time at which the process finished working MINUS the arrival time of the process MINUS CPU burst for that process” will help calculate the _________.
30 / 50
First _______ entries in Per Process File Descriptor Table are used as soon as the process is created.
31 / 50
OS helps manages the following except
32 / 50
Cooperating processes never share any data, code, memory or state.
33 / 50
The process of switching from one process to another is called ---------------.
34 / 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.
35 / 50
The Shortest-Job-First Scheduling algorithm can be
36 / 50
In Unix/ Linux, by default the standard output file is attached to the ___________
37 / 50
The execution of critical sections must NOT be mutually exclusive
38 / 50
The hardware mechanism that enables a device to notify CPU is called an -------------
39 / 50
/opt is used for storage of large applications.
40 / 50
_____________ is the basis of queuing theory which is branch of mathematics used to analyze systems involving queues and servers.
41 / 50
The performance of Round Robin algorithm does NOT depends heavily on the size of the time quantum.
42 / 50
The -------------- system call suspends the calling process.
43 / 50
You can use the rm file1 command to __________ file1
44 / 50
rm and [r]mkdir commands are used to _____________ directory.
45 / 50
__________ integer shows the highest priority of a process in CPU scheduling
46 / 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.
47 / 50
________ determines What will be done.
48 / 50
Preventing a condition of ________ to happen, deadlocks can be prevented to happen.
49 / 50
A pathname is the list of directories separated by _________.
50 / 50
_____________ determines How to do something.
Your score is
The average score is 36%
Restart quiz
