CS604-Midterm
1 / 50
POSIX is a standard developed by ANSI
2 / 50
Progress and Bounded Waiting are some of the characteristics to solve the critical section problems.
3 / 50
___________ algorithm is used in Deadlock avoidance.
4 / 50
The manual pages can be read in Linux using ____ command.
5 / 50
A_______ is an integer variable that, apart from initialization is accessible only through two standard atomic operations: wait and signal.
6 / 50
Current working directory can be accessed using --------- Command.
7 / 50
Hardware provide basic computing resource.
8 / 50
Which of the following is correct definition for wait operation?
9 / 50
______scheduler selects the process from the job pool and put them in main memory.
10 / 50
Mkfifo() is a _______.
11 / 50
You can terminate a foreground process by pressing --------------
12 / 50
A_____ is an abstract key for accessing a file.
13 / 50
OS helps manages the following except
14 / 50
------------ register contains the size of the process
15 / 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.
16 / 50
_____ system call is used to write to a file or FIFO or any other IPC channel.
17 / 50
Linux uses ___________ directory to store system configuration files.
18 / 50
The process of switching from one process to another is called ---------------.
19 / 50
The Operating system is a layer of software between _________ and ___________.
20 / 50
I/O instructions are Privileged Instructions.
21 / 50
The integer value of ________semaphores can range over an unrestricted integer domain.
22 / 50
In Unix/ Linux, by default the standard output file is attached to the ___________
23 / 50
The Home Directory for superuser in Linux and Unix is
24 / 50
User Goal of OS is that It easy to use, reliable, safe and fast.
25 / 50
Managing Secondary Storage Involves all of the Following except
26 / 50
Cache is non-volatile memory.
27 / 50
_______ is also called Swapper.
28 / 50
n-process critical section problem can be solved by using
29 / 50
You can create a threads by using the pthread_create() call.
30 / 50
In ________addressing, the recipient is not required to name the sender.
31 / 50
A Process that has finished working, as well as its parent process has also finished its execution. In this state the process A will be called as _________ process.
32 / 50
The time it takes for the dispatcher to stop one process and start another running is known as the-----------.
33 / 50
The creating process is called a--------------- process while the new processes are called the -------------- of that process
34 / 50
The execution of critical sections must NOT be mutually exclusive
35 / 50
The Shortest-Job-First Scheduling algorithm can be
36 / 50
Preemptive ----------------scheduling is sometimes called shortestremaining-time-first scheduling.
37 / 50
__________ displays information about the top processes.
38 / 50
The returned code to the child process after successful fork system call execution is
39 / 50
Preventing a condition of ________ to happen, deadlocks can be prevented to happen.
40 / 50
The number of processes completed per unit time is called ___________.
41 / 50
Which register holds the smallest legal physical memory address for a process?
42 / 50
Banker‟s algorithm is used for ________________
43 / 50
You can use the rm file1 command to __________ file1
44 / 50
You can use the ---------command in UNIX to create a directory.
45 / 50
The nice value helps in assigning ______ to a process.
46 / 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.
47 / 50
The scheduling of ______ are done by the operating system.
48 / 50
First _______ entries in Per Process File Descriptor Table are used as soon as the process is created.
49 / 50
A system call________
50 / 50
____ command display the status of a process.
Your score is
The average score is 36%
Restart quiz
