CS604-Midterm
1 / 50
____ command gives a snapshot of the current processes.
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
The Shortest-Job-First Scheduling algorithm can be
4 / 50
User Goal of OS is that It easy to use, reliable, safe and fast.
5 / 50
Batch programs are usually _________ programs.
6 / 50
The correct command for compiling C program named program.c in Linux environment is
7 / 50
You can display all of the signals supported by your system, along with their numbers, by using the -----------command
8 / 50
A time sharing system is
9 / 50
Operating System is the Manager of Hardware Resources.
10 / 50
A semaphore that cause Busy-Waiting is termed as ___________.
11 / 50
Shared libraries and kernel modules are stored in directory
12 / 50
A system call________
13 / 50
____ command display the status of a process.
14 / 50
The main characteristic of a Real time system is
15 / 50
Database, Complier, Video games are examples of ________.
16 / 50
A Process „A‟ that has finished working but its parent process has also finished its execution. In this state the process „A‟ will be called as _____ process.
17 / 50
A process consists of __________
18 / 50
In Linux directory structure, there is ___________ root directory.
19 / 50
If your processor does not have two slots empty in Per Process File Descriptor Table, then your _________ system call will fail.
20 / 50
rm and [r]mkdir commands are used to _____________ directory.
21 / 50
Which part of the computer system helps in managing the file and memory management system?
22 / 50
You can use the ---------command in UNIX to create a directory.
23 / 50
The major advantage of multi-programming system is
24 / 50
We can install and run multiple OS by using VMWare.
25 / 50
The scheduling of ______ are done by the operating system.
26 / 50
Utilities used for system administration (halt, ifconfig, fdisk, etc.) are stored in _____________ directory.
27 / 50
________________ is an integer variable accessible through wait and signal which are atomic operations.
28 / 50
Linux uses ___________ directory to store system configuration files.
29 / 50
A 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 ________.
30 / 50
The interval from the time of submission to the time of completion is the ______
31 / 50
A process is said to be in critical section if it executes code that manipulates shared data
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
In deadlock detection and recovery algorithm, a deadlock exists in the system if and only if the wait for graph contains a _____________
34 / 50
_________buffer places no practical limit on the size of the buffer
35 / 50
Linux Treats Devices as Files.
36 / 50
In Layered Approach of OS, the Layer highest Layer is User Interface layer.
37 / 50
A program in execution is called a _______________.
38 / 50
_________ command to resume the execution of a suspended job in the foreground
39 / 50
When process opens its first file explicitly it will get descriptor number ______
40 / 50
___________ algorithm is used in Deadlock avoidance.
41 / 50
You can terminate a foreground process by pressing --------------
42 / 50
All threads within a process share the ________ address space.
43 / 50
/usr/X11R6 is used by the X Window System.
44 / 50
___________ is used in real time operating systems.
45 / 50
Mach, MacOS X Server, QNX, OS/2 and Windows NT are examples of OS Based on ______.
46 / 50
When a process opens its first file explicitly it will get descriptor number _________
47 / 50
_____________ is the basis of queuing theory which is branch of mathematics used to analyze systems involving queues and servers.
48 / 50
/opt is used for storage of large applications.
49 / 50
________ scheduling algorithm is sometimes called shortest remaining time first scheduling algorithm.
50 / 50
Each page is a power of -------- bytes long in paging scheme.
Your score is
The average score is 36%
Restart quiz
