INT-1700 EXAM #1

. Batch systems date from early computers, when each job consisted of a stack of chips entered into the system as a unit known as a stack.

False

. Dual core or quad core multi-core chips are larger than a single-processor chip but produce less current leakage and heat.

False

A job's state moves from HOLD to WAITING when it's ready to run but is waiting for the CPU.

False

A job's working set is the collection of pages that must be loaded from secondary storage.

False

A program is an active entity that requires a set of resources, including a processor and special registers, to perform its function

False

A single-user system supports multiprogramming.

False

Cache memory is based on the concept of using a large, fast, and expensive memory to supplement the workings of main memory.

False

Single-user contiguous allocation schemes have the problem of partition intrusion.

False

The Memory Manager, the Interface Manager, the User Manager, and the File Manager are the four essential managers of every major operating system.

False

The Processor Manager is a composite of at least two submanagers: one in charge of job scheduling and the other in charge of program scheduling.

False

The best-fit allocation method keeps the free/busy lists organized by memory locations, low-order memory to high-order memory.

False

The content of a random access memory (RAM) chip is nonvolatile, meaning that it is not erased when the power is turned off.

False

The first-fit algorithm assumes that the Memory Manager keeps only one list containing free memory blocks.

False

The key to the successful implementation of demand paging is the use of a high-speed CPU.

False

When using a FIFO scheme, adding more memory always results in better performance.

False

With demand paging, if there are no empty page frames available, to move in a new page, one of the current resident pages must be placed into main memory.

False

____ is the practice of using Internet-connected resources to perform processing, storage, or other operations. a. Cloud computing b. Command line interfacing c. Process management d. Network management

a. Cloud Computing

. In a demand paging scheme, the first-in first-out (FIFO) page replacement policy chooses the page least recently accessed to be swapped out.

false

. When using priority scheduling, priorities are assigned to jobs by the owner of the job (the user).

false

CPU-bound jobs (such as printing a series of documents) have many brief CPU cycles and long I/O cycles

false

Compaction should always be performed only when there are jobs waiting to get in.

false

First-come, first-served (FCFS) is a preemptive scheduling algorithm that handles jobs according to their arrival time.

false

For a fixed partition system, memory deallocation is relatively complex.

false

General-purpose operating systems such as Linux or Windows are used in embedded systems.

false

In active multiprogramming schemes, a job can monopolize the CPU for a long time while all other jobs waited.

false

Onboard systems are computers that are physically placed inside the products that they operate to add features and capabilities

false

Paged memory allocation offers the advantage that it doesn't require the entire job to be stored in memory during its execution.

false

The Memory Manager is in charge of main memory, widely known as ROM.

false

The control program that handles the interruption sequence of events is called the event scheduler.

false

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.

false

The shortest remaining time (SRT) algorithm is often used in interactive systems.

false

Thrashing is a problem that occurs when there are a large number of jobs and many free pages so that pages are being moved around too much.

false

When executing a job, the File Manager determines whether a user request requires that a file be retrieved from storage or whether it is already in memory.

false

With distributed operating systems, users need to be aware of which processor is actually running their applications.

false

With segmented memory allocation, each job is divided into several segments of the same size, one for each module containing pieces that perform related functions

false

. In a paged memory allocation scheme, to find the actual position of an instruction in memory, first the page number and displacement are determined. Then the operating system refers to the job's PMT to correlate the page with its page frame.

true

. Most computer programs alternate between CPU cycles and I/O cycles.

true

A large job can have problems with a first-fit memory allocation scheme.

true

A processor is also known as a CPU.

true

After relocation and compaction, both the free list and the busy list are updated.

true

As a process moves through the system, its status changes. Possible process statuses include HOLD, READY, RUNNING, WAITING, and FINISHED

true

In the 2010s, chips with millions of transistors that were very close together helped increase system performance dramatically.

true

It is possible to minimize response time by running only interactive jobs and letting batch jobs wait until the interactive load ceases.

true

Memory defragmentation is performed by the operating system to reclaim fragmented space.

true

Shortest job next (SJN) is a nonpreemptive scheduling algorithm (also known as shortest job first, or SJF) that handles jobs based on the length of their CPU cycle time.

true

Single-user systems in a non-networked environment allocate, to each user, access to all available main memory for each job, and jobs are processed sequentially, one after the other

true

The Device Manager is responsible for connecting with every device that's available on the system and for choosing the most efficient way to allocate them.

true

The algorithm used to store jobs into memory in a fixed partition system 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

The buffers used in the 1950s to reduce the discrepancy in speed between the I/O and the CPU were conceptually similar to those now used routinely by Web browsers to make video and audio playback smoother.

true

The first bug was a moth trapped in a Harvard computer.

true

The fixed partition scheme works well if all of the jobs run on the system are of the same size or if the sizes are known ahead of time and don't vary between reconfigurations.

true

The primary advantage of storing programs in noncontiguous page frames (in a paged memory allocation scheme) is that main memory is used more efficiently because an empty page frame can be used by any page of any job.

true

The segmented/demand paged memory allocation scheme is a combination of segmentation and demand paging, and it offers the logical benefits of segmentation, as well as the physical benefits of paging.

true

There are two primary types of user interfaces: the graphical user interface and the command line interface.

true

Web browsers use multithreading routinely. For example, one thread can retrieve images while another sends and retrieves e-mail.

true

When using a multiple-level queue strategy, aging is used to ensure that jobs in lower-level queues will eventually complete their execution.

true

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. a. device controller b. device software c. device handler d. device driver

d. device driver

A disadvantage of segmented memory allocation is ____. a. the physical size requirements of main memory b. the number of page faults c. internal fragmentation d. external fragmentation

d. external fragmentation

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. a. null entries b. segmentation c. main memory d. overhead

d. overhead

. A variation of the LRU page replacement algorithm known as the clock page replacement policy is implemented using a pointer to step through the reference bits of the active pages, simulating a clockwise motion.

True

. Associative memory is a name given to several hardware registers that are allocated to each active job whose task is to associate segment and page numbers belonging to the job being processed with their main memory addresses.

True

. Demand paging introduced the concept of loading only a part of the program into memory for processing

True

. Operating systems with networking capability have a fifth essential manager called the Network Manager that provides a convenient way for authorized users to share resources.

True

. The bounds register is used to store the highest (or lowest, depending on the specific system) location in memory accessible by each program.

True

. The operating system manages each and every piece of hardware and software.

True

A single processor can be shared by several jobs, or several processes, but only if the operating system has a scheduling policy, as well as a scheduling algorithm, to determine when to stop working on one job and proceed to another

True

An important function of the Processor Manager is to keep track of the status of each job, process, and thread.

True

Context switching is required by all preemptive algorithms.

True

If one job monopolizes the system, the extent of its overall effect on system performance depends on the scheduling policy and whether the job is CPU-bound or I/O-bound.

True

In Round Robin scheduling, if processing isn't finished when time expires, the job is preempted and put at the end of the READY queue and its information is saved in its Process Control Block.

True

In a dynamic partition system, 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 a fixed partition scheme, large jobs will need to wait if the large partitions are already booked, and they will be rejected if they're too big to fit into the largest partition.

True

In the 1980s, as a result of multiprocessing techniques, it became possible to execute two programs at the same time in parallel.

True

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

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.

True

Networking was not always an integral part of operating systems.

True

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.

True

Research continues to focus on finding the optimum allocation scheme.

True

The Job Table (JT) contains two values for each active job: the size of the job and the memory location where its Page Map Table is stored.

True

The central processing unit (CPU) is the brains of the computer with the circuitry to control the interpretation and execution of instructions.

True

The first attempt to allow for multiprogramming used fixed partitions

True

The optimal selection of cache size and replacement algorithm can result in 80 to 90 percent of all requests being in the cache.

True

Virtual memory can be implemented with both paging and segmentation

True

With demand paging, three additional fields are introduced for each page in each PMT: one to determine if the page being requested is already in memory, a second to determine if the page contents have been modified while in memory, and a third to determine if the page has been referenced most recently.

True

The name for the core portion of an operating system is the ____. a. manager b. center c. nucleus d. kernel

d. Kernel

The first-come, first-served (FCFS) algorithm is fine for most ____ systems. a. multiuser b. user initiated c. interactive d. batch

d. batch

. 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. a. control unit b. scheduler c. holder d. buffer manager

a. control unit

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. a. function b. value c. order d. assignment

a. function

No movement between queues is a very simple policy that rewards those who have ____ jobs. a. high-priority b. low-priority c. CPU-bound d. I/O-bound

a. high-priority

The four memory management techniques presented in this chapter share the requirement that the entire program being executed must be ____. a. loaded into memory b. stored on disk c. written in a single language d. relocatable

a. loaded into memory

Cache memory is divided into blocks of equal size called ____. a. slots b. pages c. segments d. partitions

a. slots b.

In a paged memory allocation scheme, a page size that is too small will generate ____. a. very long Page Map Tables b. excessive internal fragmentation c. excessive page faults d. excessive external fragmentation

a. very long page map tables

Assume that jobs A-D arrive in the READY queue in quick succession and have the CPU cycle requirements listed below. Using the SRT algorithm, the average turnaround time is ____. Arrival time: 0 1 2 3 Job: A B C D CPU cycle: 6 3 1 4 a. 2.5 b. 6.25 c. 7.75 d. 9.0

b. 6.25

The ____ method keeps the free/busy lists organized by memory locations, from low-order memory to high-order memory. a. fixed partition allocation b. first-fit memory allocation c. dynamic fit memory allocation d. best-fit memory allocation

b. first-fit memory

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. a. Memory Management Table b. Job Table c. Page Access Table d. Memory Map Table

b. job table

. ____ is where the data and instructions of a computer must reside to be processed. a. CPU b. Main memory c. Read-only memory d. I/O memory

b. main memory

An I/O request is called a(n) ____ wait in multiprogramming environments. a. forced b. natural c. scheduled d. indirect

b. natural

____ effectively removes restrictions on maximum program size. a. Segmenting b. Virtual memory c. Shared memory d. Multithreading

b. virtual memory

The transition from ____ can be initiated by the Process Scheduler or the Job Scheduler. a. WAITING to READY b. RUNNING to WAITING c. RUNNING to FINISHED d. HOLD to READY

c. Running to finished

____ allows separate partitions of a single server to support different operating systems. a. Multiprocessing b. Multithreading c. Virtualization d. Shared processing

c. virtualization