CS604-Midterm
1 / 50
Linux is a version of _______ operating system.
2 / 50
If your processor does not have two slots empty in Per Process File Descriptor Table, then your _________ system call will fail.
3 / 50
------------ register contains the size of the process
4 / 50
In Layered approach of OS, Lowest Layer is known as ________.
5 / 50
The creating process is called a--------------- process while the new processes are called the -------------- of that process
6 / 50
_________buffer places no practical limit on the size of the buffer
7 / 50
The _______ are used for communication between related or unrelated processes on the same system or unrelated processes on different systems.
8 / 50
A semaphore that cause Busy-Waiting is termed as .
9 / 50
Mach, MacOS X Server, QNX, OS/2 and Windows NT are examples of OS Based on ______.
10 / 50
Which of the Following is not an Operating System.
11 / 50
User Goal of OS is that It easy to use, reliable, safe and fast.
12 / 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 _________.
13 / 50
/opt is used for storage of large applications.
14 / 50
You can create a threads by using the pthread_create() call.
15 / 50
_________________ scheduling allows a process to move between queues.
16 / 50
Progress and Bounded Waiting are some of the characteristics to solve the critical section problems.
17 / 50
__________ scheduler selects the process from the job pool and put them in main memory.
18 / 50
A_____ is an abstract key for accessing a file.
19 / 50
In Unix/ Linux, by default the standard input file is attached to the ___________
20 / 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.
21 / 50
Time interval when the I/O Devices are accessed is known as --------.
22 / 50
___________ algorithm is used in Deadlock avoidance.
23 / 50
The number of processes completed per unit time is called ___________.
24 / 50
The priority of a process can be changed using ___________ command.
25 / 50
________ scheduling algorithm is sometimes called shortest remaining time first scheduling algorithm.
26 / 50
Cache is non-volatile memory.
27 / 50
The returned code to the child process after successful fork system call execution is
28 / 50
Database, Complier, Video games are examples of ________.
29 / 50
A semaphore that cause Busy-Waiting is termed as ___________.
30 / 50
The Purpose of Operating System is to generate Executable Programs and to _______ them.
31 / 50
Taking the CPU from one process and giving the CPU to another process is termed as
32 / 50
The priorities of processes in the __________ group remain fixed.
33 / 50
Operating system enables the user to use the Hardware Resources.
34 / 50
___________ is a solution to the problem of indefinite blockage of low-priority processes.
35 / 50
The integer value of ________semaphores can range over an unrestricted integer domain.
36 / 50
Which of the following is correct definition for wait operation?
37 / 50
Starvation is infinite blocking caused due to unavailability of resources.
38 / 50
What do we name to an address that is loaded into the memory-address register of the memory?
39 / 50
Each page is a power of -------- bytes long in paging scheme.
40 / 50
If a system is not in a safe state, there can be No deadlocks.
41 / 50
The correct command for compiling C program named program.c in Linux environment is
42 / 50
_________ command to resume the execution of a suspended job in the foreground
43 / 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________.
44 / 50
_______ is also called Swapper.
45 / 50
The bottom layer in the layered approach of Operating System is-----------
46 / 50
The time it takes for the dispatcher to stop one process and start another running is known as the-----------.
47 / 50
An operating system is a control program that manages the execution of user programs to prevent errors and improper use of a computer.
48 / 50
Kernel is responsible for scheduling the user level threads.
49 / 50
Binary semaphores are those that have only two values---------
50 / 50
A dashed line is used to represent a _________ in Resource Allocation Graph.
Your score is
The average score is 36%
Restart quiz
