CS604-Midterm
1 / 50
Command-line interpreter is also called __________ in some operating systems.
2 / 50
Round Robin algorithm is similar to ____________ scheduling but preemption is added to switch between processes.
3 / 50
In ---------addressing; the recipient is not required to name the sender.
4 / 50
A_____ is an abstract key for accessing a file.
5 / 50
Linux is a version of _______ operating system.
6 / 50
The correct command for compiling C program named program.c in Linux environment is
7 / 50
___________ algorithm is used in Deadlock avoidance.
8 / 50
Each page is a power of -------- bytes long in paging scheme.
9 / 50
An absolute pathname starts with the root directory (/) and a relative pathname starts with your home directory.
10 / 50
Database, Complier, Video games are examples of ________.
11 / 50
____ command display the status of a process.
12 / 50
_____ system call is used to write to a file or FIFO or any other IPC channel.
13 / 50
____ command gives a snapshot of the current processes.
14 / 50
The following requirement for solving critical section problem is known as ______. “There exists a bound on the number of times that other processes are allowed to enter their critical sections after a process has made a request to enter its critical section and before that request is granted.”
15 / 50
The interval from the time of submission to the time of completion is the ______
16 / 50
In indirect inter process communication, a sender_____mention the name of the recipient.
17 / 50
A major problem with priority scheduling algorithms is ______.
18 / 50
The Operating system is a layer of software between _________ and ___________.
19 / 50
The number of processes completed per unit time is called ___________.
20 / 50
Batch programs are usually _________ programs.
21 / 50
In ________addressing, the recipient is not required to name the sender.
22 / 50
You can create a threads by using the pthread_create() call.
23 / 50
The time it takes for the dispatcher to stop one process and start another running is known as the-----------.
24 / 50
Each process must first request permission to enter its critical section. The section of code implementing this request is called the _____
25 / 50
In Layered Approach of OS, the Layer highest Layer is User Interface layer.
26 / 50
The critical section problem can be solved by the following except
27 / 50
What do we name to an address that is loaded into the memory-address register of the memory?
28 / 50
-------- command gives a snapshot of the current processes.
29 / 50
The bottom-up view is that operating system is a resource manager who manages the hardware and software resources in the computer system.
30 / 50
A program in execution is called a _______________.
31 / 50
The Purpose of Operating System is to generate Executable Programs and to _______ them.
32 / 50
__________ commands in Linux is used to copy file
33 / 50
n-process critical section problem can be solved by using
34 / 50
If your processor does not have two slots empty in Per Process File Descriptor Table, then your _________ system call will fail.
35 / 50
You can use the ---------command in UNIX to create a directory.
36 / 50
When process opens its first file explicitly it will get descriptor number ______
37 / 50
copy file1 file2 is an example of ______ OS view.
38 / 50
Which register holds the smallest legal physical memory address for a process?
39 / 50
First-Come, First-Served (FCFS) is a --------------scheduling algorithm.
40 / 50
User mode can run the Privileged instructions.
41 / 50
Preemptive ----------------scheduling is sometimes called shortestremaining-time-first scheduling.
42 / 50
DOS is single user operating system.
43 / 50
------------has a hierarchical file system structure.
44 / 50
45 / 50
Shared libraries and kernel modules are stored in directory
46 / 50
--------------command to resume the execution of a suspended job in the foreground
47 / 50
/opt is used for storage of large applications.
48 / 50
The address generated by the CPU, after any indexing or other addressing-mode arithmetic, is called a --------address, and the address it gets translated to by the MMU is called a ---------address.
49 / 50
In Resource Allocation Graph, A _______ Pi →Rj indicates that process Pi may request resource Rj at some time in the future.
50 / 50
This condition is known as ______________.
Your score is
The average score is 36%
Restart quiz
