CS604-Midterm
1 / 50
IPC provides a mechanism to allow processes to communicate and to synchronize their actions without sharing the same__________
2 / 50
Utilities used for system administration (halt, ifconfig, fdisk, etc.) are stored in _____________ directory.
3 / 50
The -------------- system call suspends the calling process.
4 / 50
The process of switching from one process to another is called ---------------.
5 / 50
The interval from the time of submission to the time of completion is the ______
6 / 50
The manual pages can be read in Linux using ____ command.
7 / 50
User Goal of OS is that It easy to use, reliable, safe and fast.
8 / 50
___________ is a piece of code in a cooperating process in which the process may updates shared data (variable, file, database, etc.).
9 / 50
A_____ is an abstract key for accessing a file.
10 / 50
If a system is not in a safe state, there can be No deadlocks.
11 / 50
/usr/X11R6 is used by the X Window System.
12 / 50
Which register holds the smallest legal physical memory address for a process?
13 / 50
Starvation is infinite blocking caused due to unavailability of resources.
14 / 50
We can install and run multiple OS by using VMWare.
15 / 50
You can display all of the signals supported by your system, along with their numbers, by using the -----------command
16 / 50
___________ is a solution to the problem of indefinite blockage of low-priority processes.
17 / 50
If the fork system call fails, it returns
18 / 50
The scheduling of ______ are done by the operating system.
19 / 50
_____________ is the basis of queuing theory which is branch of mathematics used to analyze systems involving queues and servers.
20 / 50
The _______ are used for communication between related or unrelated processes on the same system or unrelated processes on different systems.
21 / 50
A process is said to be in critical section if it executes code that manipulates shared data
22 / 50
In Unix/ Linux, by default the standard input file is attached to the ___________
23 / 50
In deadlock detection and recovery algorithm, a deadlock exists in the system if and only if the wait for graph contains a _____________
24 / 50
/opt is used for storage of large applications.
25 / 50
Round Robin algorithm is similar to ____________ scheduling but preemption is added to switch between processes.
26 / 50
A semaphore that cause Busy-Waiting is termed as ___________.
27 / 50
Time interval when the I/O Devices are accessed is known as --------.
28 / 50
Shared libraries and kernel modules are stored in directory
29 / 50
All threads within a process share the ________ address space.
30 / 50
__________ displays information about the top processes.
31 / 50
The Purpose of Operating System is to generate Executable Programs and to _______ them.
32 / 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.
33 / 50
command displays the contents of current working directory.
34 / 50
__________ commands in Linux is used to copy file
35 / 50
Linux is a version of _______ operating system.
36 / 50
A process consists of __________
37 / 50
The process of holding at least one resource and waiting to acquire additional resources that are currently being held by other processes is known as________.
38 / 50
The hardware mechanism that enables a device to notify CPU is called an -------------
39 / 50
You can use the ------------- command to display the status of suspended and background processes
40 / 50
A solution to the critical section problem must satisfy the following requirements
41 / 50
A time sharing system is
42 / 50
In ---------addressing, the recipient is not required to name the sender.
43 / 50
______scheduler selects the process from the job pool and put them in main memory.
44 / 50
copy file1 file2 is an example of ______ OS view.
45 / 50
________ determines What will be done.
46 / 50
___________ algorithm is used in Deadlock avoidance.
47 / 50
------------ register contains the size of the process
48 / 50
The execution of critical sections must NOT be mutually exclusive
49 / 50
The performance of Round Robin algorithm does NOT depends heavily on the size of the time quantum.
50 / 50
Which of the following is correct definition for wait operation?
Your score is
The average score is 36%
Restart quiz
