COP 4610 Exam 1

A general rule of thumb for selecting a proper time quantum in Round Robin scheduling is that it should be long enough to allow ____ percent of the CPU cycles to run to completion.

80

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

True

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

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 2010s, chips with millions of transistors that were very close together helped increase system performance dramatically.

True

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

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 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 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 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

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

True

Virtual memory can be implemented with both paging and segmentation.

True

In demand paging, the collection of pages residing in memory that can be accessed directly without incurring a page fault is called the ____.

page set

The Job Scheduler seeks to ____ when scheduling jobs.

balance CPU and I/O intensive jobs

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

False

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

False

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

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

A(n) ____ is created by a process, and it can be scheduled and executed independently of its parent process.

thread

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 a demand paging scheme, the first-in first-out (FIFO) page replacement policy chooses the page least recently accessed to be swapped out.

False

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

False

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