CS604-Midterm
1 / 50
The _______ are used for communication between related or unrelated processes on the same system or unrelated processes on different systems.
2 / 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.
3 / 50
--------------command to resume the execution of a suspended job in the foreground
4 / 50
The process id returned to the child process after successful fork system call execution is _____________.
5 / 50
You can use the ---------command in UNIX to create a directory.
6 / 50
A process consists of __________
7 / 50
__________ scheduler selects the process from the job pool and put them in main memory.
8 / 50
The process of switching from one process to another is called latency.
9 / 50
In indirect inter process communication, a sender ________ mention the name of the recipient.
10 / 50
Database, Complier, Video games are examples of ________.
11 / 50
Linux uses ___________ directory to store system configuration files.
12 / 50
I MB or 1 megabyte is equivalent to----
13 / 50
__________ directory includes essential system boot files including the kernel image.
14 / 50
The basic purpose of ________________is to help the users to utilize the hardware resources for completing different tasks in a simplified manner
15 / 50
What do we name to an address that is loaded into the memory-address register of the memory?
16 / 50
Linux Treats Devices as Files.
17 / 50
Preemptive ----------------scheduling is sometimes called shortestremaining-time-first scheduling.
18 / 50
A solution to the critical section problem must satisfy the following requirements
19 / 50
The Shortest-Job-First Scheduling algorithm can be
20 / 50
Bounded Buffer is a buffer of ____________ size
21 / 50
_________________ scheduling allows a process to move between queues.
22 / 50
IPC provides a mechanism to allow processes to communicate and to synchronize their actions without sharing the same__________
23 / 50
Physical memory is broken down into fixed-sized blocks, called----------- and Logical memory is divided into blocks of the same size, called -----------
24 / 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.
25 / 50
If a system is not in a safe state, there can be No deadlocks.
26 / 50
------------has a hierarchical file system structure.
27 / 50
The number of processes completed per unit time is called ___________.
28 / 50
Taking the CPU from one process and giving the CPU to another process is termed as
29 / 50
__________ integer shows the highest priority of a process in CPU scheduling
30 / 50
The performance of Round Robin algorithm does NOT depends heavily on the size of the time quantum.
31 / 50
Preventing a condition of ________ to happen, deadlocks can be prevented to happen.
32 / 50
Managing Secondary Storage Involves all of the Following except
33 / 50
Cache is non-volatile memory.
34 / 50
The Purpose of Operating System is to generate Executable Programs and to _______ them.
35 / 50
Which part of the computer system helps in managing the file and memory management system?
36 / 50
All threads within a process share the ________ address space.
37 / 50
The priority of a process can be changed using ___________ command.
38 / 50
__________ commands in Linux is used to copy file
39 / 50
Banker‟s algorithm is used for ________________
40 / 50
Each process must first request permission to enter its critical section. The section of code implementing this request is called the _____
41 / 50
The time it takes for the dispatcher to stop one process and start another running is known as the-----------.
42 / 50
Which of the following is NOT a Hardware Resource.
43 / 50
Each page is a power of -------- bytes long in paging scheme.
44 / 50
The critical section problem can be solved by the following except
45 / 50
Cooperating processes never share any data, code, memory or state.
46 / 50
___________ is a solution to the problem of indefinite blockage of low-priority processes.
47 / 50
Command-line interpreter is also called __________ in some operating systems.
48 / 50
Which register holds the smallest legal physical memory address for a process?
49 / 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.
50 / 50
________ scheduling algorithm is sometimes called shortest remaining time first scheduling algorithm.
Your score is
The average score is 36%
Restart quiz
