Networking was not always an integral part of operating systems.

False
True

The Device Manager is responsible for connecting with every device thats available on the
system and for choosing the most efficient way to allocate them.
False
True

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

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

True

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

True
False

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

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

There are two primary types of user interfaces: the graphical user interface and the command line
interface.
True
False
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 ____.
CPU sharing
distributed processing
time slicing
shared processing

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

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

False
True

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

True
False

The release of memory space by the Memory Manager is called ____.

fragmentation
free memory
relocation
deallocation

In a single-user system, jobs are processed ____.

in order of longest job to shortest job
sequentially
randomly
intermittently

Memory compaction is also referred to as ____.

dynamic allocation
 reallocation
defragmentation
collection

The first attempt to allow for multiprogramming used fixed partitions.

False
True

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.
segmentation
null entries
overhead
main memory

A(n) ____ in the busy list occurs when a memory block between two other busy memory blocks
is returned to the free list.
joined entry
empty entry
null entry
blank line

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

____ consists of fragments of free memory between blocks of allocated memory.

Indirect partitioning
External fragmentation
An inefficient fit
Internal fragmentation

In demand paging, when an excessive number of pages are moved back and forth between main
memory and secondary storage, it is called ____.
faulting
paging
thrashing
swapping
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.
True
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
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
False

With segmented memory allocation, each job is divided into several ____ of different sizes, one
for each module that contains pieces that perform related functions.
pages
segments
modules
partitions

____ effectively removes restrictions on maximum program size.

Shared memory
Segmenting
Multithreading
Virtual 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.
Memory Map Table
Job Table
Page Access Table
Memory Management Table

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

Cache memory is divided into blocks of equal size called ____.

partitions
pages
segments
slots

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
True

The Process Scheduler assigns the CPU to execute the processes for those jobs placed on the
____ queue by the Job Scheduler.
READY
PROCESS
NEXT
WAITING

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.
True
False

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

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

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

In Round Robin scheduling, if processing isnt 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.
False
True

An I/O request is called a(n) ____ wait in multiprogramming environments.

scheduled
forced
indirect
natural

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

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

The ____ is also called a high-level scheduler.

Thread Scheduler
Program Scheduler
Job Scheduler
Process Scheduler

Grades are 39 out of 40