Upgrade to remove ads
Only $35.99/year

Operating Systems Quiz 1 - 3 review

Terms in this set (72)

T/F: A system bus transfers data between the computer and its external environment.
False
T/F: The fetched instruction is loaded into the Program Counter.
False
T/F: Interrupts are provided primarily as a way to improve processor utilization.
True
T/F: The interrupt can occur at any time and therefore at any point in the execution of a user program.
True
T/F: 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.
True
T/F: One of the driving forces in operating system evolution is advancement in the
underlying hardware technology.
True
T/F: 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.
False
T/F: The user has direct access to the processor with a batch-processing type of OS.
False
T/F: In a time-sharing system, a user's program is preempted at regular intervals, but due to relatively slow human reaction time this occurrence is usually transparent to the user.
True
T/F: A design change in the structure or semantics of the process control block could affect several modules in the OS.
True
T/F: The process control block is the key tool that enables the OS to support multiple processes and to provide for multiprocessing.
True
T/F: A process that is not in main memory is immediately available for execution, regardless of whether or not it is awaiting an event.
False
The four main structural elements of a computer system are:
A. Processor, Main Memory, I/O Modules and System Bus
B. Processor, I/O Modules, System Bus and Secondary Memory
C. Processor, Registers, Main Memory and System Bus
D. Processor, Registers, I/O Modules and Main Memory
A. Processor, Main Memory, I/O Modules and System Bus
Instruction processing consists of two steps:
A. fetch and execute
B. instruction and execute
C. instruction and halt
D. fetch and instruction
A. fetch and execute
In a uniprocessor system, multiprogramming increases processor efficiency by:
A. Taking advantage of time wasted by long wait interrupt handling
B. Disabling all interrupts except those of highest priority
C. Eliminating all idle processor cycles
D. Increasing processor speed
A. Taking advantage of time wasted by long wait interrupt handling
A __________ organization has several potential advantages over a uniprocessor organization including performance, availability, incremental growth, and scaling.
A. temporal locality
B. symmetric multiprocessor
C. direct memory access
D. processor status word
B. symmetric multiprocessor
A(n) __________ is a set of resources for the movement, storage, and processing of data and for the control of these functions.
A. architecture
B. program
C. computer
D. application
C. computer
The operating system's __________ refers to its inherent flexibility in permitting
functional modifications to the system without interfering with service.
A. efficiency
B. ability to evolve
C. controlled access
D. convenience
B. ability to evolve
"The process was placed in a suspended state by an agent; either itself, a parent process, or the OS, for the purpose of preventing its execution," is a characteristic of a _________ process.
A. blocked
B. suspended
C. ready
D. swapped
B. suspended
A(n) __________ is a unit of activity characterized by the execution of a sequence
of instructions, a current state, and an associated set of system resources.
A. identifier
B. process
C. state
D. kernel
B. process
We can characterize the behavior of an individual process by listing the sequence of instructions, referred to as a __________, that executes for that process.
A. state
B. trace
C. process block
D. priority
B. trace
When one process spawns another, the spawned process is referred to as the __________ .
A. trap process
B. child process
C. stack process
D. parent process
B. child process
__________ involves moving part or all of a process from main memory to disk.
A. Swapping
B. Relocating
C. Suspending
D. Blocking
A. Swapping
A process is in the _________ state when it is in main memory and awaiting an
event.
A. Blocked
B. Blocked/Suspended
C. Ready/Suspend
D. Ready
A. Blocked
T/F: In a multithreaded environment there are separate stacks for each thread, as well
as a separate control block for each thread.
True
T/F: 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.
False
T/F: If a process is swapped out, all of its threads are necessarily swapped out because they all share the address space of the process.
True
T/F: On a uniprocessor, multiprogramming does not enable the interleaving of multiple threads within multiple processes
False
T/F: Any alteration of a resource by one thread affects the environment of the other threads in the same process.
True
T/F: The potential performance benefits of a multicore organization depend on the ability to effectively exploit the parallel resources available to the application.
True
T/F: It is possible in a single-processor system to not only interleave the execution of multiple processes but also to overlap them.
False
T/F: As an extension of the principles of modular design and structured programming, some applications can be effectively programmed as a set of concurrent processes.
True
T/F: 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.
False
T/F: 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.
False
T/F: A process that is waiting for access to a critical section does not consume processor time.
False
T/F: The case of cooperation by sharing covers processes that interact with other processes without being explicitly aware of them.
True
In a multithreaded environment, a __________ is defined as the unit of resource allocation and a unit of protection
A. strand
B. process
C. string
D. trace
B. process
The principal disadvantage of the _________ approach is that the transfer of
control from one thread to another within the same process requires a mode switch to the kernel.
A. KLT
B. LWP
C. VAX
D. ULT
A. KLT
A ________ is a user-created unit of execution within a process.
A. Kernel
B. KLT
C. light weight process
D. ULT
D. ULT
The _________ are the fundamental entities that can be scheduled and dispatched to run on one of the system processors.
A. Processes
B. Kernel threads
C. LWPs
D. ULTs
B. Kernel threads
A situation in which a runnable process is overlooked indefinitely by the scheduler, although it is able to proceed, is _________ .
A. mutual exclusion
B. deadlock
C. starvation
D. livelock
C. starvation
The requirement that when one process is in a critical section that accesses shared resources, no other process may be in a critical section that accesses any of those shared resources is ________ .
A. critical section
B. livelock
C. mutual exclusion
D. atomic operation
C. mutual exclusion
A ________ occurs when multiple processes or threads read and write data items so that the final result depends on the order of execution of instructions in the multiple processes.
A. atomic operation
B. race condition
C. livelock
D. deadlock
B. race condition
A _________ is an integer value used for signaling among processes
A. semaphore
B. message
C. mutex
D. atomic operation
A. semaphore
There are four basic thread operations associated with a change in thread state:
Block, Unblock, Finish, and ____.
Spawn
A way to overcome the problem of blocking threads is to use a technology referred to as ____ , which converts a blocking system call into a nonblocking system call.
Jacketing
A ____ is a programming language construct that encapsulates variables, access procedures, and initialization code within an abstract data type.
Monitor
A monitor supports synchronization by the use of ____ that are contained within
the monitor and accessible only within the monitor.
Condition Variables
T/F: Interrupts, signals, messages, and information in I/O buffers are all examples of reusable resources.
False
T/F: An indirect method of deadlock prevention is to prevent the occurrence of a circular wait.
False
T/F: Deadlock avoidance requires knowledge of future process resource requests.
True
T/F: The use of unequal size memory partitions provides a degree of flexibility to fixed partitioning.
True
T/F: Any protection mechanism must have the flexibility to allow several processes to access the same portion of main memory.
True
T/F: 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
True
T/F: 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.
False
T/F: The medium-term scheduler is invoked whenever an event occurs that may lead to the blocking of the current process or that may provide an opportunity to preempt a currently running process in favor of another.
False
T/F: One problem with a pure priority scheduling scheme is that lower-priority processes may suffer starvation.
True
T/F: First-come-first-served (FCFS) performs much better for short processes than long ones.
False
T/F: Round robin is particularly effective in a general purpose time sharing system or transaction processing system
True
T/F: In the Highest Response Ratio Next (HRRN) scheduling policy, longer jobs are favored because they yield a larger ratio from the smaller denominator in the equation.
False
With _________ only one process may use a resource at a time and no process
may access a resource unit that has been allocated to another process.
A. hold and wait
B. mutual exclusion
C. no preemption
D. circular wait
B. mutual exclusion
The strategy of deadlock _________ is to design a system in such a way that the
possibility of deadlock is excluded
A. prevention
B. detection
C. diversion
D. avoidance
A. prevention
The _________ condition can be prevented by requiring that a process request all
of its required resources at one time and blocking the process until all requests
can be granted simultaneously.
A. mutual exclusion
B. hold and wait
C. circular wait
D. no preemption
B. hold and wait
The __________ condition can be prevented by defining a linear ordering of
resource types
A. hold and wait
B. no preemption
C. mutual exclusion
D. circular wait
D. circular wait
One technique for overcoming external fragmentation is __________ .
A. loading
B. compaction
C. relocation
D. partitioning
B. compaction
In the Dynamic Partitioning technique of memory management, the placement
algorithm that chooses the block that is closest in size to the request is called
__________ .
A. first-fit
B. best-fit
C. last-fit
D. next-fit
B. best-fit
The page table for each process maintains _________ .
A. the physical memory location of the process
B. the frame location for each page of the process
C. the page location for each frame of the process
D. the logical memory location of the process
B. the frame location for each page of the process
This is a decision whether to add a new process to the set of processes that are
currently active:
A. short-term scheduling
B. long-term scheduling
C. medium-term scheduling
D. I/O scheduling
B. long-term scheduling
A fixed length block of data that resides in secondary memory is a ____
page
When there is wasted space internal to a partition due to the fact that the block
of data loaded is smaller than the partition is referred to as ____
internal fragmentation
A scheduling mechanism that requires no prior knowledge of process length, yet
can nevertheless favor shorter jobs, is known as the ____ scheduling mechanism.
feedback
Response time in an interactive system is an example of:
A. user-oriented criteria for long-term scheduling policies
B. system-oriented criteria for short-term scheduling policies
C. system-oriented criteria for long-term scheduling policies
D. user-oriented criteria for short-term scheduling policies
D. user-oriented criteria for short-term scheduling policies
Recommended textbook solutions

Fundamentals of Database Systems

7th Edition•ISBN: 9780133970777 (1 more)Ramez Elmasri, Shamkant B. Navathe
687 solutions

Introduction to Algorithms

3rd Edition•ISBN: 9780262033848 (2 more)Charles E. Leiserson, Clifford Stein, Ronald L. Rivest, Thomas H. Cormen
726 solutions

Information Technology Project Management: Providing Measurable Organizational Value

5th Edition•ISBN: 9781118911013 (2 more)Jack T. Marchewka
346 solutions

Information Technology Project Management: Providing Measurable Organizational Value

5th Edition•ISBN: 9781118898208Jack T. Marchewka
346 solutions