CS604-Midterm
1 / 50
Current working directory can be accessed using --------- Command.
2 / 50
A process is said to be in critical section if it executes code that manipulates shared data
3 / 50
__________ directory includes essential system boot files including the kernel image.
4 / 50
Physical memory is broken down into fixed-sized blocks, called----------- and Logical memory is divided into blocks of the same size, called -----------
5 / 50
__________ commands in Linux is used to copy file
6 / 50
A major problem with priority scheduling algorithms is ______.
7 / 50
First _______ entries in Per Process File Descriptor Table are used as soon as the process is created.
8 / 50
Which part of the computer system helps in managing the file and memory management system?
9 / 50
____ is a virtual directory in Linux and Unix.
10 / 50
DOS is single user operating system.
11 / 50
Banker‟s algorithm is used for ________________
12 / 50
Batch programs are usually _________ programs.
13 / 50
In Linux directory structure, there is ___________ root directory.
14 / 50
The nice value helps in assigning ______ to a process.
15 / 50
The interval from the time of submission to the time of completion is the ______
16 / 50
All threads within a process share the ________ address space.
17 / 50
Operating System provides services such as Managing Primary and Secondary Storage, Processes and Allowing user to manage his/her files and directories.
18 / 50
Progress and Bounded Waiting are some of the characteristics to solve the critical section problems.
19 / 50
Round Robin algorithm is similar to ____________ scheduling but preemption is added to switch between processes.
20 / 50
The priorities of processes in the __________ group remain fixed.
21 / 50
The -----------scheme is not applicable to a resource allocation system with multiple instances of each resource type.
22 / 50
/usr/X11R6 is used by the X Window System.
23 / 50
You can use the rm file1 command to __________ file1
24 / 50
______scheduler selects the process from the job pool and put them in main memory.
25 / 50
Hardware provide basic computing resource.
26 / 50
Users are the People, machines or computers that uses the Hardware resources.
27 / 50
Each page is a power of -------- bytes long in paging scheme.
28 / 50
The manual pages can be read in Linux using ____ command.
29 / 50
In ________addressing, the recipient is not required to name the sender.
30 / 50
In ---------addressing; the recipient is not required to name the sender.
31 / 50
We can install and run multiple OS by using VMWare.
32 / 50
------------ register contains the size of the process
33 / 50
A ---------------- (or an exception) is a software-generated interrupt caused either by an error (division by zero or invalid memory access) or by a user request for an operating system service.
34 / 50
_____________ is a preemptive scheduling algorithm.
35 / 50
If a system is not in a safe state, there can be No deadlocks.
36 / 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.
37 / 50
Files that start with a -------- in UNIX/Linux directory structure are known as hidden files .
38 / 50
Mkfifo() is a _______.
39 / 50
A parent process calling __________ system call will be suspended until children process terminates.
40 / 50
rm and [r]mkdir commands are used to _____________ directory.
41 / 50
The bottom-up view is that operating system is a resource manager who manages the hardware and software resources in the computer system.
42 / 50
__________ integer shows the highest priority of a process in CPU scheduling
43 / 50
Bounded Buffer is a buffer of ____________ size
44 / 50
A solution to the critical section problem must satisfy the following requirements
45 / 50
The creating process is called a--------------- process while the new processes are called the -------------- of that process
46 / 50
Database, Complier, Video games are examples of ________.
47 / 50
The Operating system is a layer of software between _________ and ___________.
48 / 50
-------- command gives a snapshot of the current processes.
49 / 50
The performance of Round Robin algorithm does NOT depends heavily on the size of the time quantum.
50 / 50
In deadlock detection and recovery algorithm, a deadlock exists in the system if and only if the wait for graph contains a _____________
Your score is
The average score is 36%
Restart quiz
