CS604-Midterm
1 / 50
A solution to the critical section problem must satisfy the following requirements
2 / 50
The condition where a set of blocked processes each holding a resource and waiting to acquire a resource held by another process in the set, is termed as ________.
3 / 50
The time it takes for the dispatcher to stop one process and start another running is known as the-----------.
4 / 50
Starvation is infinite blocking caused due to unavailability of resources.
5 / 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.”
6 / 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.
7 / 50
The process of switching from one process to another is called ---------------.
8 / 50
___________ algorithm is used in Deadlock avoidance.
9 / 50
Progress and Bounded Waiting are some of the characteristics to solve the critical section problems.
10 / 50
You can display the contents (names of files and directories) of a directory in UNIX/Linux directory structure with the --------------- command.
11 / 50
------------ register contains the size of the process
12 / 50
In Unix/ Linux, by default the standard input file is attached to the ___________
13 / 50
____ command gives a snapshot of the current processes.
14 / 50
I MB or 1 megabyte is equivalent to----
15 / 50
Managing Secondary Storage Involves all of the Following except
16 / 50
You can use the rm file1 command to __________ file1
17 / 50
You can terminate a foreground process by pressing --------------
18 / 50
The process id returned to the child process after successful fork system call execution is _____________.
19 / 50
__________ directory includes essential system boot files including the kernel image.
20 / 50
Batch programs are usually _________ programs.
21 / 50
Kernel is responsible for scheduling the user level threads.
22 / 50
If a system is not in a safe state, there can be No deadlocks.
23 / 50
Linux Treats Devices as Files.
24 / 50
The creating process is called a--------------- process while the new processes are called the -------------- of that process
25 / 50
A semaphore that cause Busy-Waiting is termed as ___________.
26 / 50
A parent process calling __________ system call will be suspended until children process terminates.
27 / 50
The nice value helps in assigning ______ to a process.
28 / 50
___________ is a piece of code in a cooperating process in which the process may updates shared data (variable, file, database, etc.).
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
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.
31 / 50
First _______ entries in Per Process File Descriptor Table are used as soon as the process is created.
32 / 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________.
33 / 50
All threads within a process share the ________ address space.
34 / 50
__________ scheduler selects the process from the job pool and put them in main memory.
35 / 50
Cache is non-volatile memory.
36 / 50
Using _________system, we can create a new process in Linux.
37 / 50
The Purpose of Operating System is to generate Executable Programs and to _______ them.
38 / 50
The basic purpose of ________________is to help the users to utilize the hardware resources for completing different tasks in a simplified manner
39 / 50
Banker‟s algorithm is used for ________________
40 / 50
The execution of critical sections must NOT be mutually exclusive
41 / 50
In Layered approach of OS, Lowest Layer is known as ________.
42 / 50
-------- command gives a snapshot of the current processes.
43 / 50
Which of the following is NOT a Hardware Resource.
44 / 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.
45 / 50
A pathname is the list of directories separated by _________.
46 / 50
The main characteristic of a Real time system is
47 / 50
In Layered Approach of OS, the Layer highest Layer is User Interface layer.
48 / 50
Binary semaphores are those that have only two values---------
49 / 50
The critical section problem can be solved by the following except
50 / 50
Each page is a power of -------- bytes long in paging scheme.
Your score is
The average score is 36%
Restart quiz
