A suspended process is characterized by ……… isn’t in the main memory. may or may not be awaiting an event. all of the above. none of the above.
.
…………..…….. is an example of reusable resources.
The processor Information in I/O buffers A signal None of the above.
……………….. is a device that detects and responds to some type of input from the physical environment. The sensor The modem The mouse None of the above.
In an OS that supports threads, scheduling and dispatching is done on ………………….. a process basis. a thread basis. all of the above. none of the above.
Customer Relationship Management is an example of ………………… multi-process applications. multi-threaded applications. all of the above. None of the above.
………………………. is the amount of the time spent executing between I/O operations. The service time The processor burst all of the above. None of the above.
With the use of ……….…..., the processor is involved only at the beginning and end of the data transfer. Direct Memory Access I/O bus I/O module none of the above.
The Not Running state should be split into ………………….. Ready and Blocked. Ready and New. New and Blocked. none of the above.
……………….……. is an example of single-threaded approaches. MS-DOS Windows Solaris None of the above.
Interrupts are handled at ………………….. layer. logical I/O device I/O scheduling and control none of the above.
With …………..….., memory compaction must be done more frequently than with the other algorithms. the best-fit the first-fit the next-fit none of the above.
A threads library contains code for………
creating threads. destroying threads. scheduling threads. all of the above.
User programs are typically executed in ……….. the user mode. the kernel mode. the system mode. none of the above.
The process consists of………..
program code. associated data. the process control block. all of the above.
……………………….… means no resource can be forcibly removed from a process holding it. No Preemption Hold & Wait Circular Wait None of the above.
In ………………….., the process with the shortest expected processing time is selected next. the shortest remaining time the shortest process next feedback scheduling none of the above.
A selection criteria for aborting deadlocked processes can be choosing the process with the ……………… . lowest priority. least estimated time remained. most total resources allocated so far. all of the above.
A process can be terminated because of ……………….
a user action. errors. Parent process is terminated. all of the above.
………. is the management of multiple processes within a uni-processor system. Multiprogramming Multiprocessing Distributed processing None of the above.
The semaphore that specifies the order in which processes are removed from the queue is called ………… a weak semaphore. a strong semaphore. a binary semaphore. none of the above.
With ………….., dynamic priority mechanism is used. feedback scheduling pure priority scheduling virtual round robin none of the above.
…………. is an example of machine readable devices. A controller A printer A keyboard None of the above.
With …………..….., memory compaction must be done more frequently than with the other algorithms. the best-fit the first-fit the next-fit none of the above.
In an OS that supports threads, scheduling and dispatching is done on ………………….. a process basis. a thread basis. all of the above. none of the above.
The basic instruction processing cycle can be enhanced by................ Ignoring the interrupts Adding an interrupt check stage all of the above. none of the above.
…… tells the compiler how it builds an application. ABI API ISA none of the above.
..........contains the most frequently used functions of the OS Virtual Memory Kernel Processor none of the above.
.................user multiple processes, each of which supports multiple threads. Windows Solaris all of the above. none of the above.
In OS that supports threads,.......is done on thread basis. dispatching suspension swapping none of the above.
An example of block-oriented devices is............... the disk. the printer. the mouse. none of the above.
..........is a decision whether to add a new process to the set of processes that are currently active. Long-term scheduling Medium-term scheduling Short-term scheduling.
Interrupts are handled at........ scheduling & control layer device I/O layer logical I/O layer none of the above.
.................is the management of multiple processes within a multiprocessor system. Multiprograming Multiprocessing Distributed processing None of the above.
“Do not start a process if its demands might lead to deadlock” is an example of approaches of: deadlock detection deadlock prevention deadlock avoidance.
The phenomenon in which there is wasted space internal to a partition is referred to as: internal fragmentation external fragmentation overlaying.
With fixed partitioning, the number of partitions specified at system generation time: increases the number of active processes in the system. limits the number of active processes in the system. does not affect the number of active processes in the system.
With feedback scheduling, the lowest-priority queue uses: a simple FCFS mechanism. a round-robin mechanism. a priority mechanism.
Allocation of secondary storage space is generally treated at: directory management layer. file system layer. physical organization layer.
Traditionally, every personal computer (PC) would run .......................... only one OS at a time. many operating systems at a time. none of the above.
............................ is a list of new processes waiting to use the processor. The long-term queue The short-term queue None of the above.
............................... is called the dispatcher. The long-term scheduler The short-term scheduler None of the above.
The data relating to the process having the exit state, ................. are temporarily preserved by the OS. the OS no longer needs to maintain them. none of the above.
A single suspend state model allows ...................... to be swapped out. blocked processes only blocked and ready processes none of the above.
It is efficient to have ......... a number of blocked queues. one blocked queue. none of the above.
Certain instructions of the OS are executed in ........... the user mode. the kernel mode. the control mode. none of the above.
The semaphore that specifies the order in which processes are removed from the queue is called ............ a weak semaphore. a strong semaphore. a binary semaphore. none of the above.
.......................... is an example of single-threaded approaches. MS-DOS Windows Solaris None of the above.
............. is an example of human readable devices. A controller A printer USB None of the above.
Customer Relationship Management is an example of ..................... multi-process applications. multi-threaded applications. all of the above. None of the above.
In an OS that supports threads, scheduling and dispatching is done on ....................... a process basis. a thread basis. all of the above. none of the above.
User-Level Threads (ULTs) can run on any OS True False.
A process is starved when it is definitely denied access to a resource. True False.
Only one process is allowed to enter its critical section at a time. True False.
In unequal-size partitioning, it is efficient to use a single queue for all partitions. True False.
Using segmentation, a program and its associated data are divided into fixed-size segments. True False.
Preemptive policies provide better service to the overall population of processes than non-preemptive policies. True False.
First-come-first-served tends to favor processor-bound processes over I/O-bound processes. True False.
In a virtual round robin, processes in the auxiliary queue get preference over processes in the main ready queue. True False.
Using controllers, the processor is responsible for the specifics of interfacing with external devices. True False.
At the directory management layer, file names are converted to identifiers. True False.
The exchange of data between the DMA and the I/O modules takes place through the system bus. True False.
Scheduling is managing queues to minimize the queuing delay, and optimize the performance. True False.
With paging, the internal fragment contains only a fraction of the last page of the process. True False.
Mutual exclusion means exclude all other processes from a course of action while a process is granted this ability. True False.
Processor bound process is the process that mostly uses the processor. True False.
Internal fragmentation is the used space internal to a partition. True False.
It is efficient to have a number of blocked queues; one for each event. True False.
A single suspend state only allows processes which are blocked to be swapped out. True False.
Synchronous elements in a program can be implemented as threads. True False.
The page table contains the frame location for each page in the process. True False.
The semWaitB checks the semaphore value. If it is zero, then the process executing it will be blocked. True False.
Pre-emptive policies provide better service to the total population of processes than non pre-emptive ones. True False.
In a pure priority scheduling scheme, there are multiple ready queues in descending order of priority. True False.
A process in the Ready state is moved to the Blocked state when the event for which it was waiting occurs. True False.
The process control block is the key tool that enables the OS to support multiple processes. True False.
A deadlock is a temporary blocking of a group of processes competing for resources or communicating with each other. True False.
With equal-size fixed partitioning, a process whose size is >= the partition size can be loaded into any available
partition. True False.
In a multiple-processor system, it is possible to interleave the execution of multiple processes. True False.
With using interrupts, the processor spends time waiting for an I/O operation to be performed. True False.
Deadlock can be prevented by adopting a policy that eliminates one of its conditions. True False.
The suspension of a process does not suspend all of the threads within this process. True False.
The kernel is the portion of the OS that includes the important system functions. True False.
The critical section is the portion of the program that uses the critical resource. True False.
There are no deadlocks in this diagram. True False.
With the Round Robin algorithm, very long time slice should be used. True False.
Starvation is a permanent blocking of a set of processes that compete for resources or communicate with each other. True False.
The suspension of a process suspends all of the threads within this process. True False.
The dispatcher is the portion of the OS that includes the important system functions. True False.
In a multiple-processor system, it is not possible to interleave the execution of multiple processes. True False.
With using interrupts, the processor does not spend time waiting for an I/O operation to be performed. True False.
Deadlock can be detected by adopting a policy that eliminates one of its conditions. True False.
The critical section is the portion of the program that uses a critical resource. True False.
The kernel is a small program that switches the processor from one process to another. True False.
Asynchronous elements in a program can be implemented as threads. True False.
The semWaitB checks the semaphore value. If it is one, then the process executing it will be blocked. True False.
With the Round Robin algorithm, very long time slice should not be used. True False.
Mutual exclusion is the ability to exclude all other processes from a course of action while a process is granted that ability. True False.
Processor bound process is the process that mostly uses the I/O devices. True False.
There is no external fragmentation with paging. True False.
In OSs that support threads, scheduling and dispatching is done on thread basis. True False.
In the SOC, only the CPUs and Caches are on the same chip. True False.
In symmetric multiprocessor system, the failure of a single processor halts the machine True False.
Traditionally, every personal computer runs multiple operating systems at a time. True False.
In a multiple-processor system, it is not possible to interleave the execution of multiple processes True False.
System Bus moves data between the computer and its external environment. True False.
An I/O address register is used for the exchange of data between an I/O module and the processor. True False.
Graphical Processing Units is used only for advanced graphics. False True.
In Symmetric Multiprocessors, the failure of a single processor halts the machine True False.
Paging systems allow processes to be comprised of a number of fixed-size blocks (pages) True False.
With dynamic mapping HW, the requirement that all pages of a process reside in main memory simultaneously is eliminated. True False.
Authenticity concerned with the proper verification of the identity of users. True False.
With virtualization, every personal computer would run only one OS at a time. True False.
PCB is the key tool that enables the OS to support multiple processes. True False.
User programs are typically executed in Kernel mode. True False.
Solaris uses of multiple processes each of which supports single thread. True False.
Threads communication in a process requires invoking the kernel. True False.
Consumable resources can be safely used by only one process at a time and is not depleted by that use. True False.
Mutual Exclusion can be prevented by defining a linear ordering of resource types. True False.
A frame is variable-length block of the main memory False True.
After swapping out a process, it must be relocated to the same area of the memory. True False.
With equal-size partitioning, any process whose size is less than or equal to the partition size must be loaded into the smallest available partition. True False.
Mechanisms that support relocation also support the protection requirement & sharing capabilities. True False.
Printers are examples of block-oriented devices. True False.
A semaphore that does not specify the order in which processes are removed from the queue is a binary
semaphore. True False.
Condition variables are used for scheduling constraints. True False.
Deadlock prevention means that periodically the OS performs an algorithm that allows it to detect the circular
wait condition. True False.
In SoC, not only the CPUs are on the same chip but also other componentslike I/O modules&themain memory. True False.
Internal fragmentation is the used space internal to a partition. True False.
With the Round Robin algorithm, very long time slice should be avoided. False True.
The processor controls the operations of the computer and performs its data processing functions. True False.
Multi-Core Computers combine 2 or more processors on a single piece of silicon. True False.
Interrupts increase the processor utilization. True False.
The main memory stores data and instructions and it keeps its contents after shutting down the computer. True False.
The memory buffer register contains the data to be written into the memory or the data read from the memory. True False.
I/O modules contain internal buffers for permanently holding the data. True False.
In the SoC, the CPUs and caches only are on the same chip. True False.
The memory address register contains the fetched instruction. True False.
The new process is the process that is prepared to be executed given the opportunity and is in the main memory. True False.
In Symmetric Multiprocessors machines, the failure of a single processor halts the machine. True False.
The OS must provide a response that clears the error condition with the most impact on the running applications. True False.
The programmer does the scheduling duties for executing the programs. True False.
The ABI is used by the programmers to access the HW resources and the OS services. True False.
Paging systems allow processes to be comprised of a number of variable-size pages. True False.
All the pages of a process must reside in the main memory concurrently. True False.
Programs should be dynamically allocated across the memory as required True False.
A good OS will collect usage statistics for various resources and monitor the performance parameters. True False.
The program counter register holds the address of the next instruction to be fetched. True False.
Graphical Processing Units are used for advanced graphics and for general numerical processing. True False.
The OS maintains an I/O queue for each I/O device. True False.
Over time, the processor is switched between various processes. True False.
Confidentiality assures that users can’t read data for which access is unauthorized. True False.
The OS must allocate and de-allocate various resources for each active process. True False.
Many processes are allowed to enter their critical section at a time. True False.
Nowadays, more and more of the I/O function are performed without the central processor involvement. True False.
Scheduling is managing queues to maximize the queuing delay, and optimize the performance. True False.
Synchronization is coordinating multiple concurrent activities of multiple processes that are using a common
resource. True False.
First-come-first-served tends to favor I/O-bound processes over processor-bound processes. True False.
At the File System layer, access rights are managed. True False.
Non pre-emptive policies provide better service to the total population of processes than Pre-emptive ones. True False.
The page table contains the frame location for every page in the process. True False.
With the Round Robin algorithm, very long time slice is not recommended. True False.
Modular programs can be implemented as threads. True False.
The page table contains the frame location for each page in the process True False.
With pre-emptive policies, once a process is in the running state it continues to execute until it blocks itself, or it terminates. True False.
Buffers are commonly used when burning data onto a compact disc and when printing documents. False True.
There is external fragmentation with paging. True False.
FCFS may result in inefficient use of both of the processor and the I/O devices True False.
With the next-fit algorithm, memory compaction must be done more frequently than with the other algorithms. True False.
We can avoid deadlock by adopting a policy that eliminates one of its conditions. True False.
If there is an application that should be implemented as a set of related units of execution, it is efficient to do so as a collection of separate processes. True False.
|
