CS604-Midterm
1 / 50
When a process opens its first file explicitly it will get descriptor number _________
2 / 50
The performance of Round Robin algorithm does NOT depends heavily on the size of the time quantum.
3 / 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.
4 / 50
Each process must first request permission to enter its critical section. The section of code implementing this request is called the _____
5 / 50
The -----------scheme is not applicable to a resource allocation system with multiple instances of each resource type.
6 / 50
__________ directory includes essential system boot files including the kernel image.
7 / 50
Banker‟s algorithm is used for ________________
8 / 50
A parent process calling __________ system call will be suspended until children process terminates.
9 / 50
User Goal of OS is that It easy to use, reliable, safe and fast.
10 / 50
Shared libraries and kernel modules are stored in directory
11 / 50
The correct command for compiling C program named program.c in Linux environment is
12 / 50
___________ is a solution to the problem of indefinite blockage of low-priority processes.
13 / 50
The process of switching from one process to another is called ---------------.
14 / 50
The process of switching from one process to another is called latency.
15 / 50
The creating process is called a--------------- process while the new processes are called the -------------- of that process
16 / 50
Files that start with a -------- in UNIX/Linux directory structure are known as hidden files .
17 / 50
Linux uses ___________ directory to store system configuration files.
18 / 50
The priority of a process can be changed using ___________ command.
19 / 50
The time it takes for the dispatcher to stop one process and start another running is known as the-----------.
20 / 50
________________ is an integer variable accessible through wait and signal which are atomic operations.
21 / 50
First-Come, First-Served (FCFS) is a --------------scheduling algorithm.
22 / 50
If your processor does not have two slots empty in Per Process File Descriptor Table, then your _________ system call will fail.
23 / 50
In Resource Allocation Graph, A _______ Pi →Rj indicates that process Pi may request resource Rj at some time in the future.
24 / 50
DOS is single user operating system.
25 / 50
copy file1 file2 is an example of ______ OS view.
26 / 50
First _______ entries in Per Process File Descriptor Table are used as soon as the process is created.
27 / 50
28 / 50
Bounded Buffer is a buffer of ____________ size
29 / 50
Which of the following is correct definition for wait operation?
30 / 50
What do we name to an address that is loaded into the memory-address register of the memory?
31 / 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.
32 / 50
You can create a threads by using the pthread_create() call.
33 / 50
In deadlock detection and recovery algorithm, a deadlock exists in the system if and only if the wait for graph contains a _____________
34 / 50
Starvation is infinite blocking caused due to unavailability of resources.
35 / 50
A time sharing system is
36 / 50
Batch programs are usually _________ programs.
37 / 50
________ scheduling algorithm is sometimes called shortest remaining time first scheduling algorithm.
38 / 50
Command-line interpreter is also called __________ in some operating systems.
39 / 50
We can install and run multiple OS by using VMWare.
40 / 50
The critical section problem can be solved by the following except
41 / 50
The integer value of ________semaphores can range over an unrestricted integer domain.
42 / 50
A Process „A‟ that has finished working but its parent process has also finished its execution. In this state the process „A‟ will be called as _____ process.
43 / 50
command displays the contents of current working directory.
44 / 50
Users are the People, machines or computers that uses the Hardware resources.
45 / 50
Time interval when the I/O Devices are accessed is known as --------.
46 / 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.
47 / 50
________ determines What will be done.
48 / 50
__________ displays information about the top processes.
49 / 50
Which register holds the smallest legal physical memory address for a process?
50 / 50
The process id returned to the child process after successful fork system call execution is _____________.
Your score is
The average score is 36%
Restart quiz
