COP4610 Mid2
Which of these is a NOT standard control block containing the information required to manage the channels, control units and devices in the I/O subsystem?
Flag Control Block
Which of the below is not an example of sequential access storage media?
Gramophone vinyl record
Which of the below statements is true?
I/O bound processes are given priority over CPU bound processes.
Which part of the device management performs the actual transfer of data?
I/O device handler
Which of the below statements is true?
I/O scheduler implements the policies that determine the allocation of, and access to, the devices, control units, and channels
What is a Process State Diagram?
Illustrates the States in which a process can be in, and it also defines the flow in which a particular state can be achieved by the Process
When a shareable resource is allowed to be shared between two processes which can make modifications that should not be allowed, we see an example of _____ problem.
process synchronization
A(n) ____ is an inactive unit, such as a file stored on a disk.
program
The unit of _____ is in characters per inch.
tape density
Round-robin scheduling _____ .
gives each task the same chance at the processor
A task in a blocked state _____ .
is waiting for same temporarily unavailable resources
What resembles a process condition when there are two people on a landing trying to pass each other on a narrow staircase, and each time one takes a step to the side, the other mirrors that step (neither moves forward)?
livelock
Processes can run concurrently if ________ .
multiple CPUs or multiple cores are available and the program is written in a way to utilize them
A relationship between processes such that each has some part (critical section) which must not be executed while the critical section of another is being executed, is known as ___ .
mutual exclusion
The strategy of allowing processes that are logically runnable to be temporarily suspended is called _____.
preemptive scheduling
The ____ and ____ states in the process state diagram help to handle process overload conditions.
swapped-blocked, swapped-ready
How many philosophers may eat simultaneously in the Dining Philosophers problem with 5 philosophers?
2
Which of these statements is correct?
Arithmetic instructions as well as logical expressions can be broken down for execution using instruction level parallelism.
In case of directed graphs to depict a deadlock scenario, which of the below is false?
Dashed line with arrow from a resource to process indicates a process waiting for resource
____ is a technique used to guarantee the integrity of the data through which the user locks out all other users while working with the database.
Database locking
Which of the below is not an example of a Direct Access Storage Device?
Digital Audio Tape
Which of the below is not a category of Direct Access Storage Devices?
Digital tapes
The most efficient way to store information in a traditional, electromechanical hard disk is to store it platter by platter, filling up one platter surface completely and then filling up the other surface of the same platter, and so on, because this helps in the fastest data retrieval. What is your comment on the above statement?
It is false.
The ____ scheduling algorithm is designed especially for time-sharing systems.
Round Robin
Which of the below common configurations of multiprocessing systems is the most unreliable?
Master/slave
Which of the below is not a disadvantage of blocking?
More wastage of tape as compared to storing individual records
Which of the following is false for Multilevel Feedback Queues with greater priority for higher levels?
Multilevel Feedback Queues tend to favor CPU bound processes.
Which of these statements is correct?
Multiple cores in a single system are preferred to a single core because of low leakage current and heating problems.
______ is the act of allowing only one process to have access to a dedicated resource.
Mutual exclusion
In which of the below a deadlock might not happen?
Printer dedicated to a single computer trying to print from a single document
Which of the following transitions might typically NOT happen in a process scheduling state diagram?
Ready -> Held
Which of the multiprocessor configurations works best in case of processor failure?
Symmetric configuration
Which of the below statements is TRUE?
The four deadlock conditions are necessary but not sufficient for a deadlock to occur.
Which of the below is false about traditional electromechanical hard disk storage media?
The hard disk is an example of optical direct access storage media
Which of the below might not be a part of the Process Control Block?
Thread Priority
Number of processes executed in unit time constitute the ____ in a scheduling scenario.
Throughput
The below dedicated graph indicates a deadlock.
True
The move of the processor from one process to another is preceded by ______ .
a context switch
When multiple processes keep holding on to the same resource and do not give it up, this results in ______ .
a deadlock
If multiple processes holding some resources preemptively relinquish the granted resources when they sense that they are not being scheduled for long times, but the execution of such processes still does not progress, it might probably be due to _____ .
a livelock
When multiple processes keep holding on to the same resource and try to give it up but it doesn't solve the problem, this results in ______ .
a livelock
Between a process and a CPU, the 'Run till Done' mode is ______
a non-preemptive scheme
As a basic check against data corruption, the magnetic tapes store ____ .
additional parity bits
Buffering is done ___ .
all options correct
Which memory type is similar to drawers attached to your working table for a carpentry project?
cache
Saving of job processing information when interrupted by a timer runout pertains to ______ .
context switch
The ____ register of an I/O port can be written by the host to start a command or to change the mode of a device.
control
Concurrent access to shared data may result in _____.
data inconsistency
If there are 24 million sales records and they can be divided amongst different cores/CPUs for calculations, this is a case of _____ .
data level parallelism
In computer systems, a(n) ____ is a system-wide tangle of resource requests that begins when two or more jobs are put on hold, each waiting for a vital resource to become available.
deadlock
Banker's algorithm for resource allocation deals with ____
deadlock avoidance
Process-resource scenarios can be modeled with the help of _______ .
directed graphs
An example of ____ occurs when two people meet on the stairs and each one holds ground and waits for the other to retreat.
resource holding
A race condition ____.
results when several threads try to access and modify the same data concurrently
What resembles a process condition when there are people on a landing trying to pass each other on a narrow staircase, other people wait on landing for a break but the break never comes?
starvation
When multiple processes keep holding on to the same resource and do not give it up, this can result in ______ .
starvation
The swapper is _____ .
the process overload scheduler
A(n) ____ is created by a process, and it can be scheduled and executed independently of its parent process.
thread
Which of the following scheduling objectives should be applied to the following?: the system should admit jobs to create a mix that will keep most devices busy.
to balance resource utilization
The term ____ is used to refer to the time required to execute a job and return the output to the user.
turnaround time
The SJF algorithm executes first the job ___ .
with the least processor needs
Will the following situation result in a deadlock?
yes
