Question 1 2 out of 2 points The operating system manages each and every piece of hardware and software. Selected Answer: True
Correct Answer: True Question 2 2 out of 2 points The Memory Manager, the Interface Manager, the User Manager, and the File Manager are the basis of all operating systems. Selected Answer: False
Correct Answer: False Question 3 2 out of 2 points Networking was not always an integral part of operating systems. Selected Answer: True
Correct Answer: True Question 4 2 out of 2 points The high-level portion of the Process Manager is called the Process Scheduler. Selected Answer: False
Correct Answer: False Question 5 2 out of 2 points The Device Manager monitors every device, channel, and control unit. Selected Answer: True
Correct Answer: True Question 6 2 out of 2 points 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. Selected Answer: True
Correct Answer: True Question 7 2 out of 2 points The central processing unit (CPU) is the brains of the computer with the circuitry to control the interpretation and execution of instructions. Selected Answer: True
Correct Answer: True Question 8 2 out of 2 points The supercomputer was developed primarily for government applications needing massive and fast number-crunching ability to carry out military operations and weather forecasting. Selected Answer: True
Correct Answer: True Question 9 2 out of 2 points Since the mid-1970s rapid advances in computer technology have blurred the distinguishing characteristics of early machines. Selected Answer: True
Correct Answer: True Question 10 2 out of 2 points Real-time systems are used in time-critical environments where reliability is key and data must be processed within a strict time limit. Selected Answer: True
Correct Answer: True Question 11 2 out of 2 points The first bug was a moth trapped in a Harvard computer. Selected Answer: True
Correct Answer: True Question 12 0 out of 2 points If the control unit has two buffers, the second buffer can be loaded while the first buffer is transmitting its contents to or from the CPU. Selected Answer: False
Correct Answer: True Question 13 2 out of 2 points All computers have only a finite amount of memory and if a program doesn’t fit, then either the size of the main memory must be increased or the program must be modified. Selected Answer: True
Correct Answer: True Question 14 2 out of 2 points A single-user system supports multiprogramming. Selected Answer: False
Correct Answer: False Question 15 2 out of 2 points The first attempt to allow for multiprogramming used fixed partitions. Selected Answer: True
Correct Answer: True Question 16 0 out of 2 points The fixed partition scheme does not require that the entire program be stored contiguously and in memory from the beginning to the end of its execution. Selected Answer: True
Correct Answer: False Question 17 2 out of 2 points In a fixed partition scheme, large jobs may have a longer turnaround time as they wait for free partitions of sufficient size or may never run. Selected Answer: True
Correct Answer: True Question 18 2 out of 2 points The best-fit allocation method keeps the free/busy lists organized by memory locations, low-order memory to high-order memory. Selected Answer: False
Correct Answer: False Question 19 2 out of 2 points The first-fit algorithm assumes that the Memory Manager keeps only one list containing free memory blocks. Selected Answer: False
Correct Answer: False Question 20 2 out of 2 points One of the problems with the best-fit algorithm is that the entire table must be searched before the allocation can be made because the memory blocks are physically stored in sequence according to their location in memory. Selected Answer: True
Correct Answer: True Question 21 2 out of 2 points A null entry in the busy list occurs when a memory block between two other busy memory blocks is returned to the free list. Selected Answer: True
Correct Answer: True Question 22 2 out of 2 points 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. Selected Answer: True
Correct Answer: True Question 23 2 out of 2 points During compaction, the operating system must distinguish between addresses and data values, and the distinctions are not obvious once the program has been loaded into memory. Selected Answer: True
Correct Answer: True Question 24 2 out of 2 points After relocation and compaction, both the free list and the busy list are updated. Selected Answer: True
Correct Answer: True Question 25 0 out of 2 points One sector will hold one page of job instructions and fit into one page frame of memory. Selected Answer: False
Correct Answer: True Question 26 2 out of 2 points Paged memory allocation usually results in internal fragmentation, but never external fragmentation. Selected Answer: False
Correct Answer: False Question 27 2 out of 2 points The Job Table (JT) contains two entries for each active job: the size of the job and the memory location where its Page Map Table is stored. Selected Answer: True
Correct Answer: True Question 28 2 out of 2 points Each page of a job is actually stored in a page frame that can be located anywhere in available main memory. Selected Answer: True
Correct Answer: True Question 29 2 out of 2 points Every time an instruction is executed, or a data value is used, the operating system (or the hardware) must translate the job space address, which is relative, into its physical address, which is absolute. Selected Answer: True
Correct Answer: True Question 30 2 out of 2 points 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. Selected Answer: True
Correct Answer: True Question 31 2 out of 2 points The key to the successful implementation of demand paging is the use of a direct access memory device that can work directly with the CPU. Selected Answer: False
Correct Answer: False Question 32 2 out of 2 points Demand paging requires that the Page Map Table for each job keep track of each page as it is loaded or removed from main memory. Selected Answer: True
Correct Answer: True Question 33 2 out of 2 points Demand paging offers a perfect solution to inefficient memory limitations. Selected Answer: False
Correct Answer: False Question 34 2 out of 2 points The first-in first-out (FIFO) page replacement policy will remove the pages that have been in memory the shortest. Selected Answer: False
Correct Answer: False Question 35 2 out of 2 points A page interrupt is generated when a new page is brought into memory. Selected Answer: True
Correct Answer: True Question 36 2 out of 2 points When using a FIFO scheme, more memory will always result in better performance. Selected Answer: False
Correct Answer: False Question 37 2 out of 2 points A job’s working set is the set of pages residing in memory that can be accessed indirectly. Selected Answer: False
Correct Answer: False Question 38 2 out of 2 points 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). Selected Answer: True
Correct Answer: True Question 39 2 out of 2 points ____, part of the operating system, is unique to each operating system. Selected Answer: User Command Interface
Correct Answer: User Command Interface Question 40 2 out of 2 points ____ include(s) every peripheral unit in the system such as printers, disk drives, CD/DVD drives, flash memory, keyboards, and so on. Selected Answer: I/O Devices
Correct Answer: I/O Devices Question 41 2 out of 2 points A supercomputer can perform ____ floating-point operations per second. Selected Answer: 2.4 trillion
Correct Answer: 2.4 trillion Question 42 2 out of 2 points ____ systems are used in time-critical environments where reliability is key and data must be processed within a strict time limit. Selected Answer: Real-time
Correct Answer: Real-time Question 43 2 out of 2 points A hybrid system is a combination of the ____ systems. Selected Answer: batch and interactive
Correct Answer: batch and interactive Question 44 0 out of 2 points Vacuum tube computers were used during the period of ____. Selected Answer: 1935-1945
Correct Answer: 1940-1955 Question 45 2 out of 2 points The most common mechanism for implementing multiprogramming was the introduction of the ____ concept, which is when the CPU is notified of events needing operating systems services. Selected Answer: interrupt
Correct Answer: interrupt Question 46 2 out of 2 points A system with ____ divides programs into parts and keep them in secondary storage, bringing each part into memory only as it is needed. Selected Answer: virtual memory
Correct Answer: virtual memory Question 47 2 out of 2 points The overwhelming demand for ____ capability in the mid-1990s sparked the proliferation of networking capability. Selected Answer: Internet
Correct Answer: Internet Question 48 2 out of 2 points The name for the core part of an operating system is____. Selected Answer: kernel
Correct Answer: kernel Question 49 2 out of 2 points In a single-user system, jobs are processed ____. Selected Answer: sequentially
Correct Answer: sequentially Question 50 2 out of 2 points Fixed partitions are also called ____ partitions. Selected Answer: static
Correct Answer: static Question 51 2 out of 2 points The fixed partition scheme works well ____. Selected Answer: when jobs have the same size
Correct Answer: when jobs have the same size Question 52 2 out of 2 points ____ consists of fragments of free memory between blocks of allocated memory. Selected Answer: External fragmentation
Correct Answer: External fragmentation Question 53 2 out of 2 points ____ has the least wasted space and the smallest partition fitting the requirements. Selected Answer: Best-fit memory allocation
Correct Answer: Best-fit memory allocation Question 54 2 out of 2 points Consider the following space requirements for jobs 1-4 and memory blocks. Assuming a first-fit scheme is used, the job,____, is not able to run.
Jobs:
J1 10K
J2 20K
J3 30K
J4 10K

Blocks:
B1 30K
B2 15K
B3 50K
B4 20K Selected Answer: J3
Correct Answer: J3 Question 55 2 out of 2 points Consider the following space requirements for jobs 1-4 and memory blocks. Assuming a best-fit scheme is used, the job,____, is placed in the last block.
Jobs:
J1 10K
J2 20K
J3 30K
J4 10K

Blocks:
B1 30K
B2 15K
B3 50K
B4 20K Selected Answer: J2
Correct Answer: J2 Question 56 2 out of 2 points ____ is how memory is deallocated in a fixed partition scheme. Selected Answer: Memory Manager resets the status of the memory block where the job was stored to “free.”
Correct Answer: Memory Manager resets the status of the memory block where the job was stored to “free.” Question 57 2 out of 2 points In a dynamic partition scheme, ____, is how the Memory Manager deallocates a block that is between two other free blocks? Selected Answer: The sizes of the three free partitions must be combined.
Correct Answer: The sizes of the three free partitions must be combined. Question 58 2 out of 2 points A(n) ____ in the busy list occurs when a memory block between two other busy memory blocks is returned to the free list. Selected Answer: null entry
Correct Answer: null entry Question 59 2 out of 2 points The ____ of memory, sometimes referred to as garbage collection or defragmentation, is performed by the operating system to reclaim fragmented sections of the memory space. Selected Answer: compaction
Correct Answer: compaction Question 60 2 out of 2 points The operating system can tell the ____ of each group of digits by its location in the line and the operation code. Selected Answer: function
Correct Answer: function Question 61 2 out of 2 points The ____ contains the value that must be added to each address referenced in the program so it will be able to access the correct memory addresses after relocation. Selected Answer: relocation register
Correct Answer: relocation register Question 62 2 out of 2 points By compacting and relocating, the Memory Manager optimizes the use of memory and thus improves throughput, but an unfortunate side effect is more ____. Selected Answer: overhead
Correct Answer: overhead Question 63 2 out of 2 points One approach to performing compaction is to do it when a certain ____ of memory becomes busy. Selected Answer: percentage
Correct Answer: percentage Question 64 2 out of 2 points The primary advantage of storing programs in noncontiguous locations is that ____. Selected Answer: main memory is used more efficiently
Correct Answer: main memory is used more efficiently Question 65 2 out of 2 points There are ____ entries per page in the PMT. Selected Answer: 1
Correct Answer: 1 Question 66 2 out of 2 points If the page size is 100 lines,____ is the displacement for line 214 of a program. Selected Answer: 14
Correct Answer: 14 Question 67 2 out of 2 points A page size that is too small will generate ____. Selected Answer: very long PMTs
Correct Answer: very long PMTs Question 68 2 out of 2 points With demand paging, jobs are divided into equally sized ____ that initially reside in secondary storage. Selected Answer: pages
Correct Answer: pages Question 69 2 out of 2 points One of the most important innovations of demand paging was that it made ____ feasible. Selected Answer: virtual memory
Correct Answer: virtual memory Question 70 2 out of 2 points In demand paging when a job requires a certain page to be loaded and there is no empty page frame,____ . Selected Answer: A resident page must be swapped back into secondary storage.
Correct Answer: A resident page must be swapped back into secondary storage. Question 71 2 out of 2 points When there is an excessive amount of page swapping between main memory and secondary storage, the operation becomes inefficient, which is called ____. Selected Answer: thrashing
Correct Answer: thrashing Question 72 2 out of 2 points The ____ policy is based on the theory that the best page to remove is the one that has been in memory the longest. Selected Answer: FIFO
Correct Answer: FIFO Question 73 2 out of 2 points Assume that four page frames are available and are numbered 1-4. Pages A-D have been loaded into page frames 1-4 in order. Assume that page E is requested.The page frame to be loaded into when the FIFO algorithm is used is ____. Selected Answer: 1
Correct Answer: 1 Question 74 2 out of 2 points If a particular demand paging configuration has 9 page interrupts out of 11 page requests, failure rate is ____. Selected Answer: 82%
Correct Answer: 82% Question 75 2 out of 2 points Assume that four page frames are available and are numbered 1-4. Pages A-D have been loaded into page frames 1-4 in order. The program has accessed the pages in the following order: B, D, A, C. Assume that page E is requested. The ____ page frame will be loaded when the LRU algorithm is used. Selected Answer: 2
Correct Answer: 2