Intro To Operating Systems Test 1
How much is one Kilobyte in bytes
1024 bytes
What number does 11010011.0101 = in decimal? Shows Format
2^7 + 2^6 + 2^4 + 2^1 + 2^0 2^(-2) + 2^(-4) 128 + 64 + 16 + 2 + 1 + .25 + .0625 = 211.3125
What component of the computer performs operations, such as addition and subtraction, on the data?
ALU
Real-World example of interactive system....
ATM, Video Recorder....
Where are the results of operations performed by the arithmetic and logic unit held?
Accumulator
Real-World example of real-time system....
Air Traffic Control, Self driving cars....
The ____ demonstrates that when using a FIFO policy, in rare cases, adding more memory to a system can cause an increase in page interrupts.
Belady Anomaly
____ can be thought of as being an intermediary between main memory and the special-purpose registers, which are the domain of the CPU.
Cache memory
The arithmetic and logic unit is used to:
Carry out basic operations on integers and booleans
____ is the practice of using Internet-connected resources to perform processing, storage, or other operations.
Cloud computing
____ of memory is performed by the operating system to reclaim fragmented sections of the memory space.
Compaction
definition of the term 'CISC'?
Complex Instruction Set Computers
What is a method of transferring data from the computer's RAM to another part of the computer without processing it using the CPU?
DMA
In which instruction cycle does CPU determine which opcode and addressing mode have been used, and as such what actions need to be carried out ?
Decode
Which of these four does NOT comprise a part of the control unit?
Decoder Control Logic Circuits Timer or clock Instruction Register
The ____ uniquely identifies each resource, starts its operation,monitors its progress, and, finally, deallocates it, making the operating system available to the next waiting process.
Device Manager
____ consists of fragments of free memory between blocks of allocated memory.
External fragmentation
The ____ page replacement policy is based on the theory that the best page to remove is the one that has been in memory the longest.
FIFO
Which of the following is NOT one of the three stages of the instruction execution cycle?
Flag Fetch Execute Decode
The Program Counter register is used for:
Holding the address of the memory location that is to be next processed
From quickest to slowest instruction execution time, order these three addressing modes:
Immediate, direct, indirect
In a paged memory allocation scheme, the ____ contains two values for each active job: the size of the job and the memory location where its Page Map Table is stored.
Job Table
Which of these four does NOT comprise a part of the system bus?
Logic Bus Control Bus Data Bus Address Bus
Which Computer was the first to offer a Graphical User Interface?
Macintosh
____ is where the data and instructions of a computer must reside to be processed.
Main memory
Where does the control unit look in order to find the address of the next instruction to be fetched?
Memory Address Register (MAR)
In a paged memory allocation scheme, a simple ____ has one entry for each page frame that shows its location and its free/busy status
Memory Map Table
Real-World example of batch system....
Payroll system, Billing, Bank processing....
Which of the following is NOT a benefit of hyper-threading over actual multiple processors?
Performance
What Processor was a RISC instruction set architecture created by the 1991 Apple-IBM-Motorola alliance, known as AIM?
PowerPC
What type of interrupt is generated by some condition that occurs as a result of an instruction execution such as arithmetic overflow?
Program
A ____ chip holds software that is used to start the computer.
ROM
____ systems are used in time-critical environments where reliability is key and data must be processed within a strict time limit.
Real-time
The width of the address bus determines:
The maximum addressing capacity
instruction set
The range of opcodes which a CPU is programmed to recognize
True or False: In the bit-shifting variation of the LRU page replacement policy, the process of shifting bits to the right and resetting the leftmost bit to 1 when a page is referenced gives a history of each page's usage
True
With indirect addressing, how many memory lookups are need to obtain the required data?
Two
The ____ is often very different from one operating system to the next, sometimes even between different versions of the same operating system
User Interface
Real-World example of embedded systems....
Video games, Mobile phones, Vehicle computer
____ effectively removes restrictions on maximum program size.
Virtual memory
____ allows separate partitions of a single server to support different operating systems.
Virtualization
Which of the following facts regarding the CISC and RISC architectures is NOT true?
a. RISC processors generally cost less to manufacture b. The CISC architecture does not allow variable code lengths c. The RISC architecture does not allow use of complex addressing modes d. CISC processors generally have a much larger instruction set than their RISC equivalents
The fixed partition scheme works well when ____.
all jobs are of similar size
A hybrid system is a combination of ____ systems.
batch and interactive
The goal of the ____ memory allocation algorithm is to find the smallest memory block into which a job will fit.
best-fit
The purpose of cache memory is to keep handy the most recently accessed data and instructions so that the CPU can access them repeatedly without wasting time. This purpose is similar to that of the ____ of a Web browser.
bookmark file
In a relocatable dynamic partition scheme, the ____ ensures that, during execution, a program won't try to access memory locations that don't belong to it.
bounds register
A variation of the LRU page replacement algorithm known as the ____ replacement policy is implemented with a circular queue.
clock page
Starting in the 1950s, to reduce the discrepancy in speed between the I/O and the CPU, an interface called the ____ was placed between them to act as a buffer.
control unit
The release of memory space by the Memory Manager is called ____
deallocation
Memory compaction is also referred to as ____.
defragmentation
Each peripheral device has its own software, called a(n) ____, which contains the detailed instructions required to start that device, allocate it to a job, use the device correctly, and deallocate it when it's appropriate.
device driver
A disadvantage of segmented memory allocation is ____.
external fragmentation
The word ____ is used to indicate that a program is permanently held in ROM (read only memory), as opposed to being held in secondary storage.
firmware
The ____ method keeps the free/busy lists organized by memory locations, from low-order memory to high-order memory.
first-fit memory allocation
When reading an instruction, the operating system can tell the ____ of each group of digits by its location in the line and the operation code
function
There are two types of real-time systems depending on the consequences of missing the deadline. A ____ real-time system risks total system failure if the predicted time deadline is missed.
hard
The phenomenon of less-than-complete use of memory space in a fixed partition is called ____
internal fragmentation
The most common mechanism for implementing multiprogramming was the introduction of the ____ concept, whereby the CPU was notified of events needing operating systems services
interrupt
The name for the core portion of an operating system is the ____.
kernel
The four memory management techniques presented in this chapter share the requirement that the entire program being executed must be ___
loaded into memory
The term "____" means that during any phase of its execution, a program references only a small fraction of its pages.
locality of reference
The primary advantage of storing programs in noncontiguous locations is that ___
main memory is used more efficiently
With the development of ____ technology, a single chip was equipped with two or more processor cores.
multicore
A ____ in the busy list occurs when a memory block between two other busy memory blocks is returned to the free list.
null entry
By compacting and relocating, the Memory Manager optimizes the use of memory and thus improves throughput. However, it also requires more ____ than the other memory allocation schemes discussed in this chapter.
overhead
In the fixed-partition memory management scheme, the table that the Memory Manager uses to keep track of jobs is composed of the ____.
partition size, memory address, access, and status
One approach to performing compaction is to do it when a certain ____ of memory becomes busy.
percentage
Main memory is also known as ____.
random access memory
Single-user, fixed partition, and dynamic partition memory schemes share unacceptable fragmentation characteristics that were resolved with the development of ____.
relocatable dynamic partitions
In a relocatable dynamic partition scheme, the ____ contains a value that must be added to each address referenced in a program so that the system will be able to access the correct memory addresses after relocation.
relocation register
With segmented memory allocation, each job is divided into several ____ of different sizes, one for each module that contains pieces that perform related functions.
segments
In a single-user system, jobs are processed ____
sequentially
Cache memory is divided into blocks of equal size called ____.
slots
Fixed partitions are also called ____ partitions
static
In demand paging schemes, the ____ in a Page Map Table indicates whether the page is currently in memory.
status bit
In demand paging, pages are ____ between main memory and secondary storage.
swapped
To access a location in memory when using segmented memory management, the address is composed of two entries: ____.
the segment number and the displacement
In demand paging, when an excessive number of pages are moved back and forth between main memory and secondary storage, it is called ____.
thrashing
The efficiency of a batch system is measured in ____, which is the number of jobs completed in a given amount of time.
throughput
In active multiprogramming, each program is allowed to use only a preset amount of CPU time before it is interrupted so another job can begin its execution. The interrupted job resumes execution at some later time. This idea is called ____.
time slicing
In a paged memory allocation scheme, a page size that is too small will generate ___
very long Page Map Tables
A system with ____ divides programs into parts and keep them in secondary storage, bringing each part into memory only as it is needed.
virtual memory
In demand paging, the collection of pages residing in memory that can be accessed directly without incurring a page fault is called the ____.
working set