CS604-Midterm
1 / 50
A program in execution is called a _______________.
2 / 50
___________ is a piece of code in a cooperating process in which the process may updates shared data (variable, file, database, etc.).
3 / 50
copy file1 file2 is an example of ______ OS view.
4 / 50
The main characteristic of a Real time system is
5 / 50
Each process must first request permission to enter its critical section. The section of code implementing this request is called the _____
6 / 50
A process is said to be in critical section if it executes code that manipulates shared data
7 / 50
Each page is a power of -------- bytes long in paging scheme.
8 / 50
In indirect inter process communication, a sender_____mention the name of the recipient.
9 / 50
The ________ requires that once a writer is ready, that writer performs its write as soon as possible , if a writer waiting to access the object, no new readers may start reading.
10 / 50
The major advantage of multi-programming system is
11 / 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.
12 / 50
___________ is a solution to the problem of indefinite blockage of low-priority processes.
13 / 50
When a process opens its first file explicitly it will get descriptor number _________
14 / 50
User mode can run the Privileged instructions.
15 / 50
We can install and run multiple OS by using VMWare.
16 / 50
Which of the following is correct definition for wait operation?
17 / 50
Which register holds the smallest legal physical memory address for a process?
18 / 50
In Layered approach of OS, Lowest Layer is known as ________.
19 / 50
________ scheduling algorithm is sometimes called shortest remaining time first scheduling algorithm.
20 / 50
/usr/X11R6 is used by the X Window System.
21 / 50
The basic purpose of ________________is to help the users to utilize the hardware resources for completing different tasks in a simplified manner
22 / 50
The integer value of ________semaphores can range over an unrestricted integer domain.
23 / 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 ________.
24 / 50
________ determines What will be done.
25 / 50
Cooperating processes never share any data, code, memory or state.
26 / 50
The performance of Round Robin algorithm does NOT depends heavily on the size of the time quantum.
27 / 50
If a system is not in a safe state, there can be No deadlocks.
28 / 50
A time sharing system is
29 / 50
Linux uses ___________ directory to store system configuration files.
30 / 50
command displays the contents of current working directory.
31 / 50
You can use the ---------command in UNIX to create a directory.
32 / 50
___________ algorithm is used in Deadlock avoidance.
33 / 50
What do we name to an address that is loaded into the memory-address register of the memory?
34 / 50
Which of the Following is not an Operating System.
35 / 50
The Operating system is a layer of software between _________ and ___________.
36 / 50
__________ directory includes essential system boot files including the kernel image.
37 / 50
The process of switching from one process to another is called ---------------.
38 / 50
Progress and Bounded Waiting are some of the characteristics to solve the critical section problems.
39 / 50
Time interval when the I/O Devices are accessed is known as --------.
40 / 50
All threads within a process share the ________ address space.
41 / 50
The returned code to the child process after successful fork system call execution is
42 / 50
You can create a threads by using the pthread_create() call.
43 / 50
Mach, MacOS X Server, QNX, OS/2 and Windows NT are examples of OS Based on ______.
44 / 50
If your processor does not have two slots empty in Per Process File Descriptor Table, then your _________ system call will fail.
45 / 50
You can display the contents (names of files and directories) of a directory in UNIX/Linux directory structure with the --------------- command.
46 / 50
I MB or 1 megabyte is equivalent to----
47 / 50
Files that start with a -------- in UNIX/Linux directory structure are known as hidden files .
48 / 50
Banker‟s algorithm is used for ________________
49 / 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________.
50 / 50
If the fork system call fails, it returns
Your score is
The average score is 36%
Restart quiz
