INT-1700 Study Guide I

Question 1

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

Answer

true

Question 2

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

Answer

true

Question 3

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

Answer

true

Question 4

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

Answer

true

Question 5

Context switching is required by all preemptive algorithms.

Answer

true

Question 6

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.

Answer

true

Question 7

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

Answer

true

Question 8

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.

Answer

true

Question 9

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

Answer

true

Question 10

Research continues to focus on finding the optimum allocation scheme.

Answer

true

Question 11

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

Answer

true

Question 12

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.

Answer

true

Question 13

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

Answer

true

Question 14

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.

Answer

true

Question 15

Networking was not always an integral part of operating systems.

Answer

true

Question 16

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.

Answer

true

Question 17

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

Answer

true

Question 18

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

Answer

true

Question 19

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

Answer

true

Question 20

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

Answer

true

Question 21

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

Answer

true

Question 22

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

Answer

true

Question 23

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.

Answer

true

Question 24

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.

Answer

true

Question 25

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.

Answer

true

Question 26

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

Answer

true

Question 27

Virtual memory can be implemented with both paging and segmentation.

Answer

true

Question 28

In the relocatable dynamic partitions scheme, the Memory Manager relocates programs to gather together all of the empty blacks and compact them to make one block of memory large enough to accommodate some or all of the jobs, waiting to get in.

Answer

true

Question 29

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.

Answer

true

Question 30

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

Answer

true

Question 31

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

Answer

true

Question 32

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

Answer

true

Question 33

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

Answer

true

Question 34

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

Answer

true

Question 35

The buffers use 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.

Answer

true

Question 36

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

Answer

true

Question 37

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

Answer

true

Question 38

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

Answer

true

Question 39

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.

Answer

true

INT-1700 Study Guide I

Crea una cuenta gratis para terminar este test

Preguntas del test (39)

Información

Escríbenos

¿Qué te parece el nuevo diseño?