CS604-Midterm
1 / 50
Round Robin algorithm is similar to ____________ scheduling but preemption is added to switch between processes.
2 / 50
The -----------scheme is not applicable to a resource allocation system with multiple instances of each resource type.
3 / 50
The execution of critical sections must NOT be mutually exclusive
4 / 50
The bottom-up view is that operating system is a resource manager who manages the hardware and software resources in the computer system.
5 / 50
A semaphore that cause Busy-Waiting is termed as ___________.
6 / 50
User mode can run the Privileged instructions.
7 / 50
The process id returned to the child process after successful fork system call execution is _____________.
8 / 50
Which of the Following is not an Operating System.
9 / 50
When process opens its first file explicitly it will get descriptor number ______
10 / 50
_________buffer places no practical limit on the size of the buffer
11 / 50
Each page is a power of -------- bytes long in paging scheme.
12 / 50
Starvation is infinite blocking caused due to unavailability of resources.
13 / 50
___________ is used in real time operating systems.
14 / 50
First _______ entries in Per Process File Descriptor Table are used as soon as the process is created.
15 / 50
A semaphore that cause Busy-Waiting is termed as .
16 / 50
The time it takes for the dispatcher to stop one process and start another running is known as the-----------.
17 / 50
If the fork system call fails, it returns
18 / 50
Preventing a condition of ________ to happen, deadlocks can be prevented to happen.
19 / 50
The performance of Round Robin algorithm does NOT depends heavily on the size of the time quantum.
20 / 50
Managing Secondary Storage Involves all of the Following except
21 / 50
Which of the following is correct definition for wait operation?
22 / 50
In Resource Allocation Graph, A _______ Pi →Rj indicates that process Pi may request resource Rj at some time in the future.
23 / 50
__________ commands in Linux is used to copy file
24 / 50
The number of processes completed per unit time is called ___________.
25 / 50
In Linux directory structure, there is ___________ root directory.
26 / 50
-------- command gives a snapshot of the current processes.
27 / 50
A dashed line is used to represent a _________ in Resource Allocation Graph.
28 / 50
The scheduling of ______ are done by the operating system.
29 / 50
Time interval when the I/O Devices are accessed is known as --------.
30 / 50
In ---------addressing, the recipient is not required to name the sender.
31 / 50
The hardware mechanism that enables a device to notify CPU is called an -------------
32 / 50
------------has a hierarchical file system structure.
33 / 50
A program in execution is called a _______________.
34 / 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.
35 / 50
In Unix/ Linux, by default the standard input file is attached to the ___________
36 / 50
--------------command to resume the execution of a suspended job in the foreground
37 / 50
All threads within a process share the ________ address space.
38 / 50
_______ is also called Swapper.
39 / 50
------------ register contains the size of the process
40 / 50
A_____ is an abstract key for accessing a file.
41 / 50
__________ scheduler selects the process from the job pool and put them in main memory.
42 / 50
______scheduler selects the process from the job pool and put them in main memory.
43 / 50
Swapper is also termed as Short term scheduler.
44 / 50
The priorities of processes in the __________ group remain fixed.
45 / 50
Database, Complier, Video games are examples of ________.
46 / 50
________ determines What will be done.
47 / 50
_____ system call is used to write to a file or FIFO or any other IPC channel.
48 / 50
A major problem with priority scheduling algorithms is ______.
49 / 50
Bounded Buffer is a buffer of ____________ size
50 / 50
You can create a threads by using the pthread_create() call.
Your score is
The average score is 36%
Restart quiz
