CS604-Midterm
1 / 50
A solution to the critical section problem must satisfy the following requirements
2 / 50
The execution of critical sections must NOT be mutually exclusive
3 / 50
________________ is an integer variable accessible through wait and signal which are atomic operations.
4 / 50
__________ commands in Linux is used to copy file
5 / 50
Round Robin algorithm is similar to ____________ scheduling but preemption is added to switch between processes.
6 / 50
Files that start with a -------- in UNIX/Linux directory structure are known as hidden files .
7 / 50
The Shortest-Job-First Scheduling algorithm can be
8 / 50
Operating System provides services such as Managing Primary and Secondary Storage, Processes and Allowing user to manage his/her files and directories.
9 / 50
Bounded Buffer is a buffer of ____________ size
10 / 50
Starvation is infinite blocking caused due to unavailability of resources.
11 / 50
If the fork system call fails, it returns
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
All threads within a process share the ________ address space.
14 / 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.”
15 / 50
The Operating system is a layer of software between _________ and ___________.
16 / 50
The interval from the time of submission to the time of completion is the ______
17 / 50
The main characteristic of a Real time system is
18 / 50
__________ scheduler selects the process from the job pool and put them in main memory.
19 / 50
___________ algorithm is used in Deadlock avoidance.
20 / 50
___________ is a solution to the problem of indefinite blockage of low-priority processes.
21 / 50
You can display all of the signals supported by your system, along with their numbers, by using the -----------command
22 / 50
In Linux directory structure, there is ___________ root directory.
23 / 50
Operating system enables the user to use the Hardware Resources.
24 / 50
Preventing a condition of ________ to happen, deadlocks can be prevented to happen.
25 / 50
User Goal of OS is that It easy to use, reliable, safe and fast.
26 / 50
POSIX is a standard developed by ANSI
27 / 50
Managing Secondary Storage Involves all of the Following except
28 / 50
Which of the Following is not an Operating System.
29 / 50
30 / 50
____ is a virtual directory in Linux and Unix.
31 / 50
Batch programs are usually _________ programs.
32 / 50
___________ is used in real time operating systems.
33 / 50
-------- command gives a snapshot of the current processes.
34 / 50
________ scheduling algorithm is sometimes called shortest remaining time first scheduling algorithm.
35 / 50
The bottom-up view is that operating system is a resource manager who manages the hardware and software resources in the computer system.
36 / 50
Linux uses ___________ directory to store system configuration files.
37 / 50
In indirect inter process communication, a sender_____mention the name of the recipient.
38 / 50
The Home Directory for superuser in Linux and Unix is
39 / 50
Users are the People, machines or computers that uses the Hardware resources.
40 / 50
A pathname is the list of directories separated by _________.
41 / 50
Each process must first request permission to enter its critical section. The section of code implementing this request is called the _____
42 / 50
/opt is used for storage of large applications.
43 / 50
_______ is also called Swapper.
44 / 50
A ---------------- (or an exception) is a software-generated interrupt caused either by an error (division by zero or invalid memory access) or by a user request for an operating system service.
45 / 50
Mach, MacOS X Server, QNX, OS/2 and Windows NT are examples of OS Based on ______.
46 / 50
In indirect inter process communication, a sender ________ mention the name of the recipient.
47 / 50
_____________ is a preemptive scheduling algorithm.
48 / 50
__________ displays information about the top processes.
49 / 50
First _______ entries in Per Process File Descriptor Table are used as soon as the process is created.
50 / 50
A semaphore that cause Busy-Waiting is termed as .
Your score is
The average score is 36%
Restart quiz
