CS506

1. An example of block-oriented devices Is ........ The disk. The printer. The mouse. None of the above.

2. ......is the amount of time spent executing between I/O operations. The processor burst. The service time. The turnaround time. None of the above.

3. Unequal size fixed partitioning leads to ......... internal fragmentation than equal size fixed partitioning. less. more. none of the above.

4. 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.

5. ……………………is the management of multiple processes within a multiprocessor system. Multiprocessing. Multiprogramming. Distributed processing. None of the above.

Do not start a process if its demands might lead to deadlock is an example of .... Deadlock avoidance. Deadlock detection. Deadlock prevention. None of the above.

Monitors support .................................. by the use of condition variables. Synchronization. mutual exclusion. None of the above.

.................. is an example of consumable resources. The processor. The I/O device. The main memory. None of the above.

A threads library contains code for…………………………………….. Creating threads. Destroying threads. Scheduling threads. All of the above.

The following 3 conditions…...are necessary but not sufficient for a deadlock to exist. (Choose 3). Circular wait. no preemption. mutual exclusion. hold-&-wait.

The preemptive policies provide better service to the total population of processes than the non-preemptive. True. False.

A single suspend state allows blocked processes only to be swapped out. True. False.

When designing the I/o function, the hierarchical approach should be avoided. True. False.

With using interrupts, the processor spends time waiting for an I/o operation to be performed. True. False.

Segmentation eliminates internal fragmentation. True. False.

Interrupts are handled at the device I/O layer. True. False.

The medium-term scheduler is invoked whenever an event leads to blocking or preempting the current running process. True. False.

In a pure priority-scheduling scheme, there are multiple ready queues in ascending order of priority. True. False.

The shortest process next strategy is a preemptive version of the shortest remaining time strategy. True. False.

With equal-size fixed partitioning, a process whose size is <= the partition size can be loaded into any available partition. True. False.

After swapping out a process, it must be relocated to the same area of the main memory. True. False.

The process table contains the frame location for each page in the process. True. False.

Deadlock can be avoided by adopting a policy that eliminates one of its conditions. True. False.

Preemption means no resource can be forcedly removed from a process holding it. True. False.

FIFO performs better for the long processes than the short processes. True. False.

In the single-threaded approach, the concept of a thread is recognized. True. False.

Synchronous elements in a program can be implemented as threads. True. False.

In KLTs, the kernel is not aware of the existence of threads. True. False.

The semWait increments the semaphore. If it becomes negative, the process executing it is blocked. True. False.

Interrupt disabling can work only in a uni-processor system. True. False.

In an OS that supports threads, swapping is done on a thread basis. True. False.

Solaris is an example of the OSs that use the kernel-level threads. True. False.

With mutual exclusion, only one of a set of concurrent processes is able to access a given resource. True. False.

In a multiple-processor system, it is possible to interleave the execution of multiple processes and to overlap them. True. False.

CRM keeps track of all customer interactions to provide a single and integrated view of all customer activities. True. False.

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.

........................is the management of multiple processes within a multiprocessor system. Multiprocessing. Multiprogramming. Distributed processing. None of the above.

.................. is an example of consumable resources. The processor. Information In I/O buffers. The main memory. None of the above.

A threads library contains code for........... Creating threads. Destroying threads. Scheduling threads. all of the above.

The process consists of....... Program code. Associated data. A process control block. all of the above.

User programs are typically executed in…………. The control mode. the kernel mode. the system mode. None of the above.

............ is a device that detects and responds to some type of input from the physical environment. The mouse. The sensor. The modem. None of the above.

.......is the amount of time spent executing between I/O operations. The processor burst. The service time. The turnaround time. 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 (DMA). I/0 module. I/0 bus. none of the Save.

A suspended process is characterized by ....... Is not in the main memory. May or may not be waiting for an event. all of the above.

In a multiple-processor system, it is possible to interleave the execution of multiple processes and also to overlap them. True. False.

In a pure priority scheduling scheme, there are multiple ready queues In ascending order of priority. True. False.

The page table contains the frame location for each page in the process. True. False.

Starvation is a permanent blocking of a set of processes that compete for resources or communicate with each other. True. False.

With using interrupts, the processor spends time waiting for an I/O operation to be performed. True. False.

With equal-size fixed partitioning, a process whose size Is <= the partition size can be loaded into any available partition. True. False.

Deadlock can be avoided by adopting a policy that eliminates one of its conditions. True. False.

The termination of a process terminates all the threads within this process. True. False.

Synchronous elements in a program can be implemented as threads. True. False.

Very short time quantum should be used with Round Robin. True. False.

The sernWait increments the semaphore. if it becomes negative, the process executing It is blocked. True. False.

Buffering 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 a critical resource. True. False.

The dispatcher is a small program that switches the processor from one process to another. True. False.

…………….Means no resource can be forcedly removed from a process holding it. no preemption. hold & wait. mutual exclusion. none of the above.

…………is an example of reusable resources. The processor. Information In I/O buffers. a signal. None 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.

A suspended process is characterized by........... is not in the main memory. may or may not be waiting for an event. All of the above.

In a multiprocessor system, it is not possible to interleave the execution of multiple processes. True. False.

Starvation is a permanent blocking of a set of processes that compete for resources or communicate with each other. True. False.

The process image contains the frame location for each page in the process. True. False.

The dispatcher is a small program that switches the processor from one process lo another. True. False.

The kernel is the portion of the OS that includes the important system functions. True. False.

The suspension of a process suspends all the threads within this process. True. False.

in a pure priority scheduling scheme, there are multiple ready queries in descending order of priority. 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 prevented by adopting a policy that eliminates one of its conditions. True. False.

Asynchronous elements in a program can be implemented as threads. True. False.

the critical section is the portion of the program that uses a critical resource. True. False.

Very short time slice should not be used with the Round Robin algorithm. True. False.

The semWait decrements the semaphore. If it becomes negative, the process executing it is blocked. True. False.

Consumable resources can be safely used by only one process at a time and is not depleted by that use. True. False.

Deadlock can be detected by adopting a policy that eliminates one of its conditions. True. False.

Mutual Exclusion can be prevented by defining a linear ordering of resource types. True. False.

A frame is a variable-length block of the main memory. True. False.

After swapping out a process, it must be relocated to the same area of the memory. True. False.

Mechanisms that support relocation also support the protection requirement & sharing capabilities. 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.

Printers are examples of block-oriented devices. True. False.

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.

Consumable resources can be safely used by only one process at a time and is not depleted by that use. True. False.

Deadlock can be detected by adopting a policy that eliminates one of the conditions. 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. True. False.

After swapping out a process, it must be relocated to the same area of memory. True. False.

Mechanisms that support relocation also support the protection requirement & sharing capabilities. True. False.

With equal-size partitioning, any process whose size is less than or equal to the partition size can be loaded into the smallest available partition. True. False.

Printers are examples of block-oriented devices. True. False.

A thread is usually defined as a “light weight process” because an operating system (OS) maintains smaller data structures for a thread than for a process. In relation to this, which of the following is TRUE?. On per-thread basis, the OS maintains only CPU register state. The OS does not maintain a separate stack for each thread. On per-thread basis, the OS does not maintain virtual memory state. On per-thread basis, the OS maintains only scheduling and accounting information.

The OS mode is also known as. Control Mode. Kernal Mode. System Mode. All the Above.

On the OS that support threads ....... done on a thread basis. scheduling. suspension. swapping. None of the above.

............ is an example of the OS's Kernel Level Thread. Windows. Solaris. MS-Dos. None of the Above.

............. is the management of multiple proseccos within a multiprocessor system. Multiprocessing. Multiprogramming. Distributed Processing.

A Suspended Process is characterized by. is not in the main memory. may or may be not waiting for an event. All the Above.

...... uses multiple processes, each of which support multiple threads. Windows. Solaris. All the Above. modern Unix.

Customer Relationship Management (CRM) is an example of. Multi-threaded applications. Multiprocess applications. None of the Above.

In the OS support Threads ..... is done on thread basis. Dispatching. Suspension. Swapping. None of the above.

The basic instruction processing cycle can be enhanced by. Ignoring the interrupts. Adding an interrupt check stage. None.

…… tells the compiler how it builds an application. ISA. ABI. API. None.

contains the most frequently used functions of the OS. Virtual Memory. Kernel. Processor. None.

The not running state should be split into…. Ready and new. Ready and blocked. New and blocked. None.

The process consists of.. Program code. Associated Data. Process control block. All of the above.

……… is an example of a consumable resource. Processor. Memory. None of the above.

……. Is an example of a single-threaded approaches. MS-DOS. Windows. Solaris. None of the above.

With … memory compaction must be done more frequently than with other algorithms. Best-fit. First-fit. Next-fit. None of the above.

The dispatcher is a small program that switches the processor from one process to another. True. False.

The process control block is the key that enables the OS to support multiple processes. 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.

Starvation is a permanent blocking of a set of processes that compete for resources or communicate with each other. True. False.

The semWaitB checks the semaphore value. If it is one, then the process executing it will be blocked. True. False.

Deadlock can be avoided by adopting a policy that eliminates one of its conditions. True. False.

In equal-size fixed partitioning, a process whose size is >= the partition size can be loaded int any available partition. True. False.

Processor bound process is the process that mostly uses the I/O devices. True. False.

The critical section is the portion of the program that uses a critical resource. True. False.

There is no external fragmentation with paging. True. False.

In a pure priority scheduling scheme, there are multiple ready queues in descending order of priority. True. False.

is a decision whether to add a new process to the set of processes that are current active. Long-term scheduling. Medium-term scheduling. Short-term scheduling.

Solaris Use one process with multiple threads. True. False.

Hold & Wait means no resource can be forcibly removed from a process holding it. True. False.

the term atomic means that the instruction is treated as a single step that can not be interrupted. True. False.

Synchronization: coordinating multiple concurrent activities that are using a common resource. True. False.

Strong Semaphore doesn't specify the order in which processes are removed from such a queue. True. False.

A communications architecture layer may consist of a number of layers. True. False.

FCFS may result in inefficient use of both of the processor and the I/O devices. True. False.

If a process is swapped out, all of its threads are necessarily swapped out. True. False.

With preemptive policies, once a process is in the running state, it continues to execute until terminates or it blocks itself. True. False.

With paging, there is only external fragmentation. True. False.