CS604-Midterm
1 / 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________.
2 / 50
Using _________system, we can create a new process in Linux.
3 / 50
The critical section problem can be solved by the following except
4 / 50
Cache is non-volatile memory.
5 / 50
A solution to the critical section problem must satisfy the following requirements
6 / 50
___________ algorithm is used in Deadlock avoidance.
7 / 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.
8 / 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 ________.
9 / 50
__________ directory includes essential system boot files including the kernel image.
10 / 50
_____________ is a preemptive scheduling algorithm.
11 / 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 _________.
12 / 50
rm and [r]mkdir commands are used to _____________ directory.
13 / 50
The bottom-up view is that operating system is a resource manager who manages the hardware and software resources in the computer system.
14 / 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.
15 / 50
Physical memory is broken down into fixed-sized blocks, called----------- and Logical memory is divided into blocks of the same size, called -----------
16 / 50
Mach, MacOS X Server, QNX, OS/2 and Windows NT are examples of OS Based on ______.
17 / 50
Operating system enables the user to use the Hardware Resources.
18 / 50
DOS is single user operating system.
19 / 50
Which of the Following is not an Operating System.
20 / 50
The Home Directory for superuser in Linux and Unix is
21 / 50
A program in execution is called a _______________.
22 / 50
You can create a threads by using the pthread_create() call.
23 / 50
This condition is known as ______________.
24 / 50
You can use the rm file1 command to __________ file1
25 / 50
You can use the ---------command in UNIX to create a directory.
26 / 50
command displays the contents of current working directory.
27 / 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.”
28 / 50
A pathname is the list of directories separated by _________.
29 / 50
OS helps manages the following except
30 / 50
__________ displays information about the top processes.
31 / 50
The -------------- system call suspends the calling process.
32 / 50
The manual pages can be read in Linux using ____ command.
33 / 50
The process of switching from one process to another is called latency.
34 / 50
Preemptive ----------------scheduling is sometimes called shortestremaining-time-first scheduling.
35 / 50
A semaphore that cause Busy-Waiting is termed as .
36 / 50
In Resource Allocation Graph, A _______ Pi →Rj indicates that process Pi may request resource Rj at some time in the future.
37 / 50
You can terminate a foreground process by pressing --------------
38 / 50
A parent process calling __________ system call will be suspended until children process terminates.
39 / 50
A time sharing system is
40 / 50
In deadlock detection and recovery algorithm, a deadlock exists in the system if and only if the wait for graph contains a _____________
41 / 50
The time it takes for the dispatcher to stop one process and start another running is known as the-----------.
42 / 50
Which part of the computer system helps in managing the file and memory management system?
43 / 50
44 / 50
Which register holds the smallest legal physical memory address for a process?
45 / 50
The following is NOT a classical problem of synchronization
46 / 50
Each process must first request permission to enter its critical section. The section of code implementing this request is called the _____
47 / 50
/opt is used for storage of large applications.
48 / 50
_________________ scheduling allows a process to move between queues.
49 / 50
------------ register contains the size of the process
50 / 50
Hardware provide basic computing resource.
Your score is
The average score is 36%
Restart quiz
