CS604-Midterm
1 / 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.
2 / 50
___________ is a piece of code in a cooperating process in which the process may updates shared data (variable, file, database, etc.).
3 / 50
Users are the People, machines or computers that uses the Hardware resources.
4 / 50
You can terminate a foreground process by pressing --------------
5 / 50
Round Robin algorithm is similar to ____________ scheduling but preemption is added to switch between processes.
6 / 50
A dashed line is used to represent a _________ in Resource Allocation Graph.
7 / 50
__________ displays information about the top processes.
8 / 50
The Operating system is a layer of software between _________ and ___________.
9 / 50
Database, Complier, Video games are examples of ________.
10 / 50
You can use the ---------command in UNIX to create a directory.
11 / 50
-------- command gives a snapshot of the current processes.
12 / 50
____ command gives a snapshot of the current processes.
13 / 50
command displays the contents of current working directory.
14 / 50
Banker‟s algorithm is used for ________________
15 / 50
This condition is known as ______________.
16 / 50
Mach, MacOS X Server, QNX, OS/2 and Windows NT are examples of OS Based on ______.
17 / 50
The critical section problem can be solved by the following except
18 / 50
Mkfifo() is a _______.
19 / 50
A semaphore that cause Busy-Waiting is termed as .
20 / 50
_______ is also called Swapper.
21 / 50
___________ is used in real time operating systems.
22 / 50
/usr/X11R6 is used by the X Window System.
23 / 50
_________ command to resume the execution of a suspended job in the foreground
24 / 50
________ determines What will be done.
25 / 50
In Layered approach of OS, Lowest Layer is known as ________.
26 / 50
I/O instructions are Privileged Instructions.
27 / 50
First-Come, First-Served (FCFS) is a --------------scheduling algorithm.
28 / 50
Each process must first request permission to enter its critical section. The section of code implementing this request is called the _____
29 / 50
Time interval when the I/O Devices are accessed is known as --------.
30 / 50
The performance of Round Robin algorithm does NOT depends heavily on the size of the time quantum.
31 / 50
The 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 ________.
32 / 50
Progress and Bounded Waiting are some of the characteristics to solve the critical section problems.
33 / 50
The execution of critical sections must NOT be mutually exclusive
34 / 50
A solution to the critical section problem must satisfy the following requirements
35 / 50
Each page is a power of -------- bytes long in paging scheme.
36 / 50
_____ system call is used to write to a file or FIFO or any other IPC channel.
37 / 50
Batch programs are usually _________ programs.
38 / 50
The _______ are used for communication between related or unrelated processes on the same system or unrelated processes on different systems.
39 / 50
In Unix/ Linux, by default the standard input file is attached to the ___________
40 / 50
The process of switching from one process to another is called latency.
41 / 50
Preemptive ----------------scheduling is sometimes called shortestremaining-time-first scheduling.
42 / 50
The process id returned to the child process after successful fork system call execution is _____________.
43 / 50
Preventing a condition of ________ to happen, deadlocks can be prevented to happen.
44 / 50
The Shortest-Job-First Scheduling algorithm can be
45 / 50
The interval from the time of submission to the time of completion is the ______
46 / 50
__________ integer shows the highest priority of a process in CPU scheduling
47 / 50
You can create a threads by using the pthread_create() call.
48 / 50
Managing Secondary Storage Involves all of the Following except
49 / 50
Utilities used for system administration (halt, ifconfig, fdisk, etc.) are stored in _____________ directory.
50 / 50
Which of the following is correct definition for wait operation?
Your score is
The average score is 36%
Restart quiz
