Section 1

Preview this deck

10) The user has direct access to the processor with a batch-processing type of OS.

Front

Star 0%
Star 0%
Star 0%
Star 0%
Star 0%

0.0

0 reviews

5
0
4
0
3
0
2
0
1
0

Active users

0

All-time users

0

Favorites

0

Last updated

1 year ago

Date created

Mar 1, 2020

Cards (105)

Section 1

(50 cards)

10) The user has direct access to the processor with a batch-processing type of OS.

Front

False

Back

10) A process that is not in main memory is immediately available for execution, regardless of whether or not it is awaiting an event

Front

False

Back

11) Both batch processing and time sharing use multiprogramming.

Front

True

Back

5) One of the driving forces in operating system evolution is advancement in the underlying hardware technology.

Front

True

Back

4) In a multithreaded environment there are separate stacks for each thread, as well as a separate control block for each thread.

Front

True

Back

2) Windows process design is driven by the need to provide support for a variety of OS environments.

Front

True

Back

14) The principle objective of Batch Multiprogramming is to minimize response time.

Front

False

Back

2) It is not possible for a communications interrupt to occur while a printer interrupt is being processed.

Front

False

Back

2) The OS masks the details of the hardware from the programmer and provides the programmer with a convenient interface for using the system.

Front

True

Back

9) A monolithic kernel is implemented as a single process with all elements sharing the same address space.

Front

True

Back

3) A design change in the structure or semantics of the process control block could affect a number of modules in the OS.

Front

True

Back

12) The Program Status Word contains status information in the form of condition codes, which are bits typically set by the programmer as a result of program operation.

Front

False

Back

12) The phrase "control is passed to a job" means that the processor is now fetching and executing instructions from the monitor program.

Front

False

Back

8) Swapping is not an I/O operation so it will not enhance performance.

Front

False

Back

1) A computer platform consists of a collection of hardware resources, such as the processor, main memory, I/O modules, timers, and disk drives.

Front

True

Back

14) A process switch may occur any time that the OS has gained control from the currently running process.

Front

True

Back

15) The operating system acts as an interface between the computer hardware and the human user.

Front

True

Back

5) It is not the responsibility of the operating system to control the execution of processes.

Front

False

Back

2) For efficiency, applications should be written directly for a given hardware platform.

Front

False

Back

3) A system bus transfers data between the computer and its external environment.

Front

False

Back

9) If a system does not employ virtual memory each process to be executed must be fully loaded into main memory.

Front

True

Back

5) It takes less time to terminate a process than a thread.

Front

False

Back

1) The OS performs a protection function to prevent unwanted interference between processes with respect to resources.

Front

True

Back

4) Cache memory is invisible to the OS.

Front

True

Back

7) The OS may create a process on behalf of an application.

Front

True

Back

1) The processor controls the operation of the computer and performs its data processing functions.

Front

True

Back

7) The fetched instruction is loaded into the Program Counter.

Front

False

Back

6) If there is an application or function that should be implemented as a set of related units of execution, it is far more efficient to do so as a collection of separate processes rather than a collection of threads.

Front

False

Back

3) The ABI gives a program access to the hardware resources and services available in a system through the user ISA.

Front

False

Back

1) An OS should be constructed in such a way as to permit the effective development, testing, and introduction of new system functions without interfering with service.

Front

True

Back

6) The first step in designing an OS to control processes is to describe the behavior that we would like the processes to exhibit.

Front

True

Back

7) A process consists of three components: an executable program, the associated data needed by the program, and the execution context of the program.

Front

True

Back

13) In a time sharing system, a user's program is pre-empted at regular intervals, but due to relatively slow human reaction time this occurrence is usually transparent to the user.

Front

True

Back

9) The interrupt can occur at any time and therefore at any point in the execution of a user program.

Front

True

Back

13) The process control block is the least important data structure in an OS.

Front

False

Back

6) Digital Signal Processors deal with streaming signals such as audio and video.

Front

True

Back

8) Interrupts are provided primarily as a way to improve processor utilization.

Front

True

Back

15) The principal function of the OS is to create, manage, and terminate processes.

Front

True

Back

12) All processor designs include a register or set of registers, often known as the program status word, which contains status information.

Front

True

Back

3) The unit of dispatching is usually referred to as a process or task.

Front

False

Back

10) Over the years memory access speed has consistently increased more rapidly than processor speed.

Front

False

Back

5) With interrupts, the processor cannot be engaged in executing other instructions while an I/O operation is in progress.

Front

False

Back

11) An SMP can be defined as a stand-alone computer system with two or more similar processors of comparable capability.

Front

True

Back

13) An example of a multicore system is the Intel Core i7.

Front

True

Back

4) The process control block is the key tool that enables the OS to support multiple processes and to provide for multiprocessing.

Front

True

Back

11) The OS may suspend a process if it detects or suspects a problem.

Front

True

Back

6) The processor itself is not a resource so the OS is not involved in determining how much of the processor time is devoted to the execution of a user program.

Front

False

Back

8) Uniprogramming typically provides better utilization of system resources than multiprogramming.

Front

False

Back

14) In a two-level memory hierarchy the Hit Ratio is defined as the fraction of all memory accesses found in the slower memory.

Front

False

Back

15) Virtualization technology enables a single PC or server to simultaneously run multiple operating systems or multiple sessions of a single OS.

Front

True

Back

Section 2

(50 cards)

1) Deadlock is permanent because none of the events is ever triggered.

Front

True

Back

4) A useful tool in characterizing the allocation of resources to processes is the resource allocation graph.

Front

True

Back

4) Race condition is a situation in which two or more processes continuously change their states in response to changes in the other process(es) without doing any useful work.

Front

False

Back

4) Programs in other processes should not be able to reference memory locations in a process for reading or writing purposes without permission.

Front

True

Back

13) The dining philosophers problem can be representative of problems dealing with the coordination of shared resources which may occur when an application includes concurrent threads of execution.

Front

True

Back

13) It is possible for one process to lock the mutex and for another process to unlock it.

Front

False

Back

7) Secondary memory provides fast access at relatively high cost.

Front

False

Back

8) A hardware mechanism is needed for translating relative addresses to physical main memory addresses at the time of execution of the instruction that contains the reference.

Front

True

Back

7) An example of an application that could make use of threads is a file server.

Front

True

Back

10) An unsafe state is one in which there is at least one sequence of resource allocations to processes that does not result in a deadlock.

Front

False

Back

15) Processes need to be synchronized to enforce mutual exclusion.

Front

True

Back

6) Any protection mechanism must have the flexibility to allow several processes to access the same portion of main memory.

Front

True

Back

8) Termination of a process does not terminate all threads within that process.

Front

False

Back

13) As a default, the kernel dispatcher uses the policy of hard affinity in assigning threads to processors.

Front

False

Back

6) An indirect method of deadlock prevention is to prevent the occurrence of a circular wait.

Front

False

Back

15) A mutex is used to ensure that only one thread at a time can access the resource protected by the mutex.

Front

True

Back

14) A signal is similar to a hardware interrupt but does not employ priorities.

Front

True

Back

15) The potential performance benefits of a multicore organization depend on the ability to effectively exploit the parallel resources available to the application.

Front

True

Back

7) Atomicity guarantees isolation from concurrent processes.

Front

True

Back

6) When processes cooperate by communication, the various processes participate in a common effort that links all of the processes.

Front

True

Back

2) It is possible in a single-processor system to not only interleave the execution of multiple processes but also to overlap them.

Front

False

Back

12) The case of cooperation by sharing covers processes that interact with other processes without being explicitly aware of them.

Front

True

Back

2) The use of unequal size partitions provides a degree of flexibility to fixed partitioning.

Front

True

Back

3) As an extension of the principles of modular design and structured programming, some applications can be effectively programmed as a set of concurrent processes.

Front

True

Back

11) The principal operation of memory management is to bring processes into main memory for execution by the processor.

Front

True

Back

12) In a pure ULT facility, all of the work of thread management is done by the application, and the kernel is not aware of the existence of threads.

Front

True

Back

3) In a multiprogramming system the available main memory is not generally shared among a number of processes.

Front

False

Back

9) Deadlock avoidance requires knowledge of future process resource requests.

Front

True

Back

7) If access to a resource requires mutual exclusion then mutual exclusion must be supported by the OS

Front

True

Back

5) The sharing of main memory among processes is useful to permit efficient and close interaction among processes because such sharing does not lead to any problems.

Front

False

Back

10) On a uniprocessor, multiprogramming does not enable the interleaving of multiple threads within multiple processes.

Front

False

Back

3) Interrupts, signals, messages, and information in I/O buffers are all examples of reusable resources.

Front

False

Back

14) Windows is an example of a kernel-level thread approach.

Front

True

Back

5) For deadlock to occur, there must not only be a fatal region, but also a sequence of resource requests that has led into the fatal region.

Front

True

Back

10) Overlay programming wastes programmer time.

Front

True

Back

11) Any alteration of a resource by one thread affects the environment of the other threads in the same process.

Front

True

Back

10) The functioning of a process, and the output it produces, must be independent of the speed at which its execution is carried out relative to the speed of other concurrent processes.

Front

True

Back

5) The memory protection requirement must be satisfied by the operating system rather than the processor.

Front

False

Back

11) An atomic operation executes without interruption and without interference.

Front

True

Back

12) Deadlock avoidance is more restrictive than deadlock prevention.

Front

False

Back

1) The central themes of operating system design are all concerned with the management of processes and threads.

Front

True

Back

9) If a process is swapped out, all of its threads are necessarily swapped out because they all share the address space of the process.

Front

True

Back

1) In a Uniprogramming system main memory is divided into two parts.

Front

True

Back

14) One of the most common problems faced in concurrent processing is the producer/consumer problem.

Front

True

Back

2) All deadlocks involve conflicting needs for resources by two or more processes.

Front

True

Back

9) Two or more processes can cooperate by means of simple signals, such that a process can be forced to stop at a specified place until it has received a specific signal.

Front

True

Back

8) Concurrent processes do not come into conflict with each other when they are competing for the use of the same resource.

Front

False

Back

9) In a multiprogramming environment the programmer knows at the time of coding how much space will be available and where that space will be.

Front

False

Back

11) A process that is waiting for access to a critical section does not consume processor time.

Front

False

Back

8) The OS may pre-empt the second process and require it to release its resources if a process requests a resource that is currently held by another process.

Front

True

Back

Section 3

(5 cards)

14) All segments of all programs must be of the same length.

Front

False

Back

13) The best-fit algorithm is usually the worst performer.

Front

True

Back

4) The OS frequently relinquishes control and must depend on the processor to allow it to regain control.

Front

True

Back

12) A physical address is the location of a word relative to the beginning of the program and the processor translates that into a logical address.

Front

False

Back

15) Segmentation does not eliminate internal fragmentation.

Front

False

Back