CS604-Midterm
1 / 50
OS helps manages the following except
2 / 50
Time interval when the I/O Devices are accessed is known as --------.
3 / 50
The bottom layer in the layered approach of Operating System is-----------
4 / 50
Physical memory is broken down into fixed-sized blocks, called----------- and Logical memory is divided into blocks of the same size, called -----------
5 / 50
__________ commands in Linux is used to copy file
6 / 50
command displays the contents of current working directory.
7 / 50
In Layered Approach of OS, the Layer highest Layer is User Interface layer.
8 / 50
The priorities of processes in the __________ group remain fixed.
9 / 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.
10 / 50
A semaphore that cause Busy-Waiting is termed as ___________.
11 / 50
Banker‟s algorithm is used for ________________
12 / 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 _________.
13 / 50
A Process that has finished working, as well as its parent process has also finished its execution. In this state the process A will be called as _________ process.
14 / 50
__________ displays information about the top processes.
15 / 50
A solution to the critical section problem must satisfy the following requirements
16 / 50
A pathname is the list of directories separated by _________.
17 / 50
A parent process calling __________ system call will be suspended until children process terminates.
18 / 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.
19 / 50
____ is a virtual directory in Linux and Unix.
20 / 50
A program in execution is called a _______________.
21 / 50
Which of the Following is not an Operating System.
22 / 50
This condition is known as ______________.
23 / 50
User Goal of OS is that It easy to use, reliable, safe and fast.
24 / 50
___________ is used in real time operating systems.
25 / 50
The time it takes for the dispatcher to stop one process and start another running is known as the-----------.
26 / 50
Managing Secondary Storage Involves all of the Following except
27 / 50
Batch programs are usually _________ programs.
28 / 50
__________ scheduler selects the process from the job pool and put them in main memory.
29 / 50
First-Come, First-Served (FCFS) is a --------------scheduling algorithm.
30 / 50
The critical section problem can be solved by the following except
31 / 50
In indirect inter process communication, a sender_____mention the name of the recipient.
32 / 50
Database, Complier, Video games are examples of ________.
33 / 50
_______ is also called Swapper.
34 / 50
________________ is an integer variable accessible through wait and signal which are atomic operations.
35 / 50
I/O instructions are Privileged Instructions.
36 / 50
Each page is a power of -------- bytes long in paging scheme.
37 / 50
______scheduler selects the process from the job pool and put them in main memory.
38 / 50
First _______ entries in Per Process File Descriptor Table are used as soon as the process is created.
39 / 50
_____________ is the basis of queuing theory which is branch of mathematics used to analyze systems involving queues and servers.
40 / 50
The -------------- system call suspends the calling process.
41 / 50
In Resource Allocation Graph, A _______ Pi →Rj indicates that process Pi may request resource Rj at some time in the future.
42 / 50
In Unix/ Linux, by default the standard output file is attached to the ___________
43 / 50
Which of the following is correct definition for wait operation?
44 / 50
n-process critical section problem can be solved by using
45 / 50
The performance of Round Robin algorithm does NOT depends heavily on the size of the time quantum.
46 / 50
___________ is a solution to the problem of indefinite blockage of low-priority processes.
47 / 50
Linux is a version of _______ operating system.
48 / 50
The manual pages can be read in Linux using ____ command.
49 / 50
________ scheduling algorithm is sometimes called shortest remaining time first scheduling algorithm.
50 / 50
The integer value of ________semaphores can range over an unrestricted integer domain.
Your score is
The average score is 36%
Restart quiz
