CS604-Midterm
1 / 50
__________ integer shows the highest priority of a process in CPU scheduling
2 / 50
Preventing a condition of ________ to happen, deadlocks can be prevented to happen.
3 / 50
____ is a virtual directory in Linux and Unix.
4 / 50
You can create a threads by using the pthread_create() call.
5 / 50
In ---------addressing, the recipient is not required to name the sender.
6 / 50
copy file1 file2 is an example of ______ OS view.
7 / 50
In Unix/ Linux, by default the standard output file is attached to the ___________
8 / 50
Database, Complier, Video games are examples of ________.
9 / 50
If a system is not in a safe state, there can be No deadlocks.
10 / 50
A dashed line is used to represent a _________ in Resource Allocation Graph.
11 / 50
When process opens its first file explicitly it will get descriptor number ______
12 / 50
_____________ is a preemptive scheduling algorithm.
13 / 50
The basic purpose of ________________is to help the users to utilize the hardware resources for completing different tasks in a simplified manner
14 / 50
Time interval when the I/O Devices are accessed is known as --------.
15 / 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.
16 / 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.
17 / 50
Preemptive ----------------scheduling is sometimes called shortestremaining-time-first scheduling.
18 / 50
The scheduling of ______ are done by the operating system.
19 / 50
Physical memory is broken down into fixed-sized blocks, called----------- and Logical memory is divided into blocks of the same size, called -----------
20 / 50
A pathname is the list of directories separated by _________.
21 / 50
The -----------scheme is not applicable to a resource allocation system with multiple instances of each resource type.
22 / 50
The priority of a process can be changed using ___________ command.
23 / 50
In Layered Approach of OS, the Layer highest Layer is User Interface layer.
24 / 50
_____ system call is used to write to a file or FIFO or any other IPC channel.
25 / 50
The bottom-up view is that operating system is a resource manager who manages the hardware and software resources in the computer system.
26 / 50
User Goal of OS is that It easy to use, reliable, safe and fast.
27 / 50
The process of switching from one process to another is called ---------------.
28 / 50
A program in execution is called a _______________.
29 / 50
A process is said to be in critical section if it executes code that manipulates shared data
30 / 50
The manual pages can be read in Linux using ____ command.
31 / 50
The interval from the time of submission to the time of completion is the ______
32 / 50
The process id returned to the child process after successful fork system call execution is _____________.
33 / 50
Files that start with a -------- in UNIX/Linux directory structure are known as hidden files .
34 / 50
________________ is an integer variable accessible through wait and signal which are atomic operations.
35 / 50
Operating System provides services such as Managing Primary and Secondary Storage, Processes and Allowing user to manage his/her files and directories.
36 / 50
The Shortest-Job-First Scheduling algorithm can be
37 / 50
I MB or 1 megabyte is equivalent to----
38 / 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.
39 / 50
Mkfifo() is a _______.
40 / 50
In Resource Allocation Graph, A _______ Pi →Rj indicates that process Pi may request resource Rj at some time in the future.
41 / 50
A_____ is an abstract key for accessing a file.
42 / 50
A process consists of __________
43 / 50
A system call________
44 / 50
Batch programs are usually _________ programs.
45 / 50
First-Come, First-Served (FCFS) is a --------------scheduling algorithm.
46 / 50
__________ commands in Linux is used to copy file
47 / 50
_________________ scheduling allows a process to move between queues.
48 / 50
The ________ requires that once a writer is ready, that writer performs its write as soon as possible , if a writer waiting to access the object, no new readers may start reading.
49 / 50
You can use the ------------- command to display the status of suspended and background processes
50 / 50
A semaphore that cause Busy-Waiting is termed as .
Your score is
The average score is 36%
Restart quiz
