CS604-Midterm
1 / 50
The time it takes for the dispatcher to stop one process and start another running is known as the-----------.
2 / 50
The process id returned to the child process after successful fork system call execution is _____________.
3 / 50
Bounded Buffer is a buffer of ____________ size
4 / 50
Hardware provide basic computing resource.
5 / 50
What do we name to an address that is loaded into the memory-address register of the memory?
6 / 50
Operating System is the Manager of Hardware Resources.
7 / 50
A process is said to be in critical section if it executes code that manipulates shared data
8 / 50
Which register holds the smallest legal physical memory address for a process?
9 / 50
The priorities of processes in the __________ group remain fixed.
10 / 50
Mach, MacOS X Server, QNX, OS/2 and Windows NT are examples of OS Based on ______.
11 / 50
__________ scheduler selects the process from the job pool and put them in main memory.
12 / 50
In ---------addressing, the recipient is not required to name the sender.
13 / 50
/opt is used for storage of large applications.
14 / 50
A process consists of __________
15 / 50
Each page is a power of -------- bytes long in paging scheme.
16 / 50
You can use the ---------command in UNIX to create a directory.
17 / 50
__________ displays information about the top processes.
18 / 50
___________ is used in real time operating systems.
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
___________ is a piece of code in a cooperating process in which the process may updates shared data (variable, file, database, etc.).
21 / 50
_____ system call is used to write to a file or FIFO or any other IPC channel.
22 / 50
Swapper is also termed as Short term scheduler.
23 / 50
Current working directory can be accessed using --------- Command.
24 / 50
________________ is an integer variable accessible through wait and signal which are atomic operations.
25 / 50
Which of the following is correct definition for wait operation?
26 / 50
The bottom layer in the layered approach of Operating System is-----------
27 / 50
I/O instructions are Privileged Instructions.
28 / 50
The critical section problem can be solved by the following except
29 / 50
The execution of critical sections must NOT be mutually exclusive
30 / 50
A solution to the critical section problem must satisfy the following requirements
31 / 50
A_____ is an abstract key for accessing a file.
32 / 50
In Linux directory structure, there is ___________ root directory.
33 / 50
The following is NOT a classical problem of synchronization
34 / 50
Users are the People, machines or computers that uses the Hardware resources.
35 / 50
The interval from the time of submission to the time of completion is the ______
36 / 50
___________ algorithm is used in Deadlock avoidance.
37 / 50
The process of switching from one process to another is called ---------------.
38 / 50
------------has a hierarchical file system structure.
39 / 50
____ command display the status of a process.
40 / 50
If a system is not in a safe state, there can be No deadlocks.
41 / 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 _________.
42 / 50
_________buffer places no practical limit on the size of the buffer
43 / 50
A program in execution is called a _______________.
44 / 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________.
45 / 50
Linux Treats Devices as Files.
46 / 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 ________.
47 / 50
You can use the ------------- command to display the status of suspended and background processes
48 / 50
Database, Complier, Video games are examples of ________.
49 / 50
The -----------scheme is not applicable to a resource allocation system with multiple instances of each resource type.
50 / 50
------------ register contains the size of the process
Your score is
The average score is 36%
Restart quiz
