How can we help?

You can also find more resources in our Help Center.

31 terms

Test 1-3

Tests over Chapters 1 through 3
STUDY
PLAY
False
The minicomputer of the 1970s was smaller than the microcomputer.
False
The Memory Manager, the Interface Manager, the User Manager, and the File Manager are the basis of all operating systems.
True
Networking was not always an integral part of operating systems
False
The high-level portion of the Process Manager is called the Process Scheduler.
True
A page interrupt is generated when a new page is brought into memory.
True
When the Processor Manager receives a command, it determines whether the program must be retrieved from storage or is already in memory, and then notifies the appropriate manager.
True
Since the mid-1970s rapid advances in computer technology have blurred the distinguishing characteristics of early machines.
True
Real-time systems are used in time-critical environments where reliability is key and data must be processed within a strict time limit.
True
Onboard systems are computers placed inside other products to add features and capabilities.
True
A process requires space in main memory where it resides during its execution although, from time to time, it requires other resources such as data files or I/O devices
False
Early memory management schemes are still used in today's operating systems.
False
To overlay is to transfer segments of a program from main memory into secondary storage for execution, so that two or more segments take turns occupying the same memory locations.
False
The problem of partition intrusion is present in single-user contiguous allocation schemes.
True
The algorithm used to store jobs into memory requires a few more steps than the one used for a single-user system because the size of the job must be matched with the size of the partition to make sure it fits completely.
True
A large job can have problems with a first-fit memory allocation list.
True
A large job can have problems with a first-fit memory allocation list.
True
A null entry in the busy list occurs when a memory block between two other busy memory blocks is returned to the free list.
True
In the relocatable dynamic partitions scheme, the Memory Manager relocates programs to gather together all of the empty blocks and compact them to make one block of memory large enough to accommodate some or all of the jobs waiting to get in.
False
Memory is allocated during garbage collection.
True
The bounds register is used to store the highest (or lowest, depending on the specific system) location in memory accessible by each program.
False
Compaction should always be performed only when there are jobs waiting to get in
True
One sector will hold one page of job instructions and fit into one page frame of memory.
False
Paged memory allocation usually results in internal fragmentation, but never external fragmentation.
True
Each page of a job is actually stored in a page frame that can be located anywhere in available main memory.
True
Demand paging was the first widely used scheme that removed the restriction of having the entire job in memory from the beginning to the end of its processing.
True
A page interrupt is generated when a new page is brought into memory
True
A variation of the LRU page replacement algorithm is known as the clock page replacement policy because it is implemented with a circular queue and uses a pointer to step through the reference bits of the active pages, simulating a clockwise motion
True
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.
False
A job's working set is the set of pages residing in memory that can be accessed indirectly.
True
The use of virtual memory requires cooperation between the Memory Manager (which tracks each page or segment) and the processor hardware (which issues the interrupt and resolves the virtual address)
True
The optimal selection of cache size and replacement algorithm can result in 80 to 90 percent of all requests being in the cache.