CS604-Midterm
1 / 50
_________buffer places no practical limit on the size of the buffer
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
In deadlock detection and recovery algorithm, a deadlock exists in the system if and only if the wait for graph contains a _____________
4 / 50
------------has a hierarchical file system structure.
5 / 50
The major advantage of multi-programming system is
6 / 50
A dashed line is used to represent a _________ in Resource Allocation Graph.
7 / 50
The bottom-up view is that operating system is a resource manager who manages the hardware and software resources in the computer system.
8 / 50
Operating system enables the user to use the Hardware Resources.
9 / 50
I/O instructions are Privileged Instructions.
10 / 50
In Resource Allocation Graph, A _______ Pi →Rj indicates that process Pi may request resource Rj at some time in the future.
11 / 50
Mach, MacOS X Server, QNX, OS/2 and Windows NT are examples of OS Based on ______.
12 / 50
The priorities of processes in the __________ group remain fixed.
13 / 50
A semaphore that cause Busy-Waiting is termed as .
14 / 50
Mkfifo() is a _______.
15 / 50
/opt is used for storage of large applications.
16 / 50
A parent process calling __________ system call will be suspended until children process terminates.
17 / 50
You can display all of the signals supported by your system, along with their numbers, by using the -----------command
18 / 50
The _______ are used for communication between related or unrelated processes on the same system or unrelated processes on different systems.
19 / 50
__________ commands in Linux is used to copy file
20 / 50
The address generated by the CPU, after any indexing or other addressing-mode arithmetic, is called a --------address, and the address it gets translated to by the MMU is called a ---------address.
21 / 50
The hardware mechanism that enables a device to notify CPU is called an -------------
22 / 50
In Layered approach of OS, Lowest Layer is known as ________.
23 / 50
Preemptive ----------------scheduling is sometimes called shortestremaining-time-first scheduling.
24 / 50
The execution of critical sections must NOT be mutually exclusive
25 / 50
The integer value of ________semaphores can range over an unrestricted integer domain.
26 / 50
________________ is an integer variable accessible through wait and signal which are atomic operations.
27 / 50
Files that start with a -------- in UNIX/Linux directory structure are known as hidden files .
28 / 50
The Shortest-Job-First Scheduling algorithm can be
29 / 50
You can create a threads by using the pthread_create() call.
30 / 50
The process of switching from one process to another is called ---------------.
31 / 50
Starvation is infinite blocking caused due to unavailability of resources.
32 / 50
-------- command gives a snapshot of the current processes.
33 / 50
If your processor does not have two slots empty in Per Process File Descriptor Table, then your _________ system call will fail.
34 / 50
Linux Treats Devices as Files.
35 / 50
Which of the following is correct definition for wait operation?
36 / 50
The time it takes for the dispatcher to stop one process and start another running is known as the-----------.
37 / 50
/usr/X11R6 is used by the X Window System.
38 / 50
copy file1 file2 is an example of ______ OS view.
39 / 50
command displays the contents of current working directory.
40 / 50
POSIX is a standard developed by ANSI
41 / 50
In ________ communication the process which wants to communicate with the other process must explicitly name the recipient and the sender.
42 / 50
A solution to the critical section problem must satisfy the following requirements
43 / 50
The nice value helps in assigning ______ to a process.
44 / 50
Utilities used for system administration (halt, ifconfig, fdisk, etc.) are stored in _____________ directory.
45 / 50
DOS is single user operating system.
46 / 50
Cooperating processes never share any data, code, memory or state.
47 / 50
Taking the CPU from one process and giving the CPU to another process is termed as
48 / 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.
49 / 50
__________ scheduler selects the process from the job pool and put them in main memory.
50 / 50
The critical section problem can be solved by the following except
Your score is
The average score is 36%
Restart quiz
