Section 1

Preview this deck

T/F Each unit in the I/O subsystem can finish its operation independently from the others.

Front

Star 0%
Star 0%
Star 0%
Star 0%
Star 0%

0.0

0 reviews

5
0
4
0
3
0
2
0
1
0

Active users

2

All-time users

3

Favorites

0

Last updated

4 years ago

Date created

Mar 1, 2020

Cards (250)

Section 1

(50 cards)

T/F Each unit in the I/O subsystem can finish its operation independently from the others.

Front

True

Back

T/F Each volume can only contain a single file.

Front

False

Back

____ bits make up the Channel Status Word (CSW) flag.

Front

Three

Back

T/F DASDs are good for files with low activity (the percent of records accessed) or for users who access records in a random fashion.

Front

True

Back

T/F The traffic controller maintains a spreadsheet file containing the status and connections for each unit in the I/O subsystem, grouped into Channel Control Blocks, Control Unit Control Blocks, and Device Control Blocks.

Front

False

Back

The I/O ____ allocates the devices, control units, and channels.

Front

Scheduler

Back

If the transport speed for a magnetic tape is 200 inches per second and the density is 1600 bpi, a total of ____ bytes can be transferred in one second.

Front

320,000

Back

On magnetic disks, files can be organized in one of three ways; ____.

Front

sequential, direct, or indexed sequential

Back

____ might be an encoded version of ADAMSbbbbbbbbbb

Front

ADAMSb10

Back

T/F It is easy to calculate the location of a variable-length record.

Front

False

Back

T/F The File Manager is in charge of the system's physical components, its information resources, and the policies used to store and distribute the files.

Front

True

Back

Without DMA, the ____ is responsible for the physical movement of data between main memory and the device.

Front

CPU

Back

T/F Direct access storage devices (DASDs) are devices that can directly read or write to a specific place on a disk.

Front

True

Back

T/F A find strategy determines the order in which the processes get the I/O handler device, and the goal is to keep seek time to a minimum.

Front

False

Back

On an optical disc, all sectors are ____.

Front

Of the Same Size Throughout the Disc

Back

Movable-head magnetic disks, such as the computer hard drive, have ____ read/write head(s).

Front

One

Back

T/F When using DMA, the CPU is involved in transferring data to and from memory for the entire transfer.

Front

False

Back

A ____ is a group of related records that contains information to be used by specific application programs to generate reports.

Front

file

Back

For every file request, the ___ is the point of entry.

Front

MFD

Back

Of the three components of access time in a movable-head DASDs, ____ is the longest.

Front

Seek Time

Back

T/F Two of the most important measures of optical disc drive performance are sustained data-transfer rate and longest access time.

Front

False

Back

T/F The SCAN algorithm moves the arm methodically from the inner to the outer track, servicing every request in its path.

Front

False

Back

In noncontiguous storage, linking can take place at the ___ level where each part of the file points to the next one in the sequence.

Front

storage

Back

The primary disadvantage of contiguous storage is that ___.

Front

file can't be expanded unless there is empty space available immediately following it

Back

T/F Among the many differences between an optical disc and a magnetic disk is the design of the disc track and sectors.

Front

True

Back

T/F A record is a group of related bytes that can be identified by the user with a name, type, and size.

Front

False

Back

T/F A magneto-optical (MO) disk drive combines the technology of magnetic disks with that of optical discs.

Front

True

Back

T/F Buffers are used extensively to better synchronize the movement of data between the relatively slow I/O devices and the very fast CPU.

Front

True

Back

In a fixed-head magnetic disk, each circle is called a ____.

Front

Track

Back

T/F Examples of batch commands are CREATE, DELETE, RENAME, and COPY.

Front

False

Back

Data recorded on DASDs may or may not be blocked at the discretion of the ____.

Front

Application Programmer

Back

The USB controller assigns bandwidth to each device depending on its priority, and the ____ priority is assigned to real-time exchanges where no interruption in the data flow is allowed, such as video or sound data.

Front

Highest

Back

When data is stored in fixed length fields, data that extends beyond the fixed size ____.

Front

is truncated

Back

T/F First-come, first-served (FCFS) is the simplest device-scheduling algorithm.

Front

True

Back

T/F Each unit in the I/O subsystem can finish its operation independently from the others.

Front

True

Back

The purpose of an extension is to ___.

Front

identify the type of file

Back

The number of characters that can be recorded per inch on a magnetic tape is determined by the ____ of the tape.

Front

Density

Back

The need for algorithms to resolve conflicts between processors is called process ____. A) communication B) synchronization C) reduction D) transformation

Front

B

Back

In a networked environment using the OpenVMS Alpha operating system, a file might be named VAX2::USR3:[IMFST.FLYNN]INVENTORY_COST.DOC;7. ___ is the volume where the file is stored?

Front

USR3

Back

T/F A fixed-head disk is lower in cost than a movable head disk.

Front

False

Back

T/F On a magnetic tape, the inter-record gap (IRG) is about two inches long regardless of the sizes of the records it separates.

Front

False

Back

When using random access files, the program used to store the data follows a set of instructions, called a ___ algorithm, that transforms each key into a number, the record's logical address.

Front

hashing

Back

T/F Directories are special files with listings of filenames and their attributes.

Front

True

Back

The most commonly used access control scheme is the ___.

Front

access control list

Back

The File Manager is in charge of the system's ____ components.

Front

physical

Back

T/F A file descriptor usually contains only a file name and the directory name in which the file is located.

Front

False

Back

T/F N-Step SCAN holds all new requests until the arm starts on its way back.

Front

True

Back

T/F The universal serial bus (USB) controller acts as an interface between the operating system, device drivers, and applications and the devices that are attached via the USB host.

Front

True

Back

The File Manager uses the address of the ____ to access the next sequential record.

Front

last byte read

Back

T/F The job of the I/O control unit is to keep up with the I/O requests from the CPU and pass them down the line to the appropriate control unit.

Front

False

Back

Section 2

(50 cards)

Once starvation has been detected, an algorithm can be implemented in which the system blocks new jobs until the starving jobs have been satisfied. A) True B) False

Front

T

Back

3.The supercomputer was developed primarily for government applications needing massive and fast number-crunching ability to carry out military operations and weather forecasting. A) True B) False

Front

T

Back

To overlay is to transfer segments of a program from main memory into secondary storage for execution, so that two or more segments take turns occupying the same memory locations. A) True B) False

Front

T

Back

8. A system with ____ divides programs into parts and keep them in secondary storage, bringing each part into memory only as it is needed. A) virtual memory B) shared memory C) segmented processing D) passive multiprogramming

Front

A

Back

The following algorithm can be described as ____. 1 Set counter to 1 2 Do while counter <= number of blocks in memory If job_size > memory_size(counter) Then counter = counter + 1 Else load job into memory_size(counter) adjust free/busy memory lists go to step 4 End do 3 Put job in waiting queue 4 Go fetch next job A) first-fit memory allocation B) best-fit memory allocation C) least-fit memory allocation D) fixed partition memory allocation

Front

A

Back

T/F After a job has been placed on the READY queue by the Job Scheduler, the Process Scheduler takes over

Front

True

Back

4.In the 1950s, only one FORTRAN program could run at a time, and then the FORTRAN compiler had to be reloaded into memory. A) True B) False

Front

F

Back

According to the Banker's Algorithm an unsafe state always leads to deadlock. A) True B) False

Front

F

Back

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. A) True B) False

Front

T

Back

Assume the following events and actions take place. The following statement, ____ is true. Event Action 1 P1 requests and is allocated the printer R1. 2 P1 releases the printer R1. 3 P2 requests and is allocated the disk drive R2. 4 P2 releases the disk R2. 5 P3 requests and is allocated the plotter R3. 6 P3 releases the plotter R3. A) There is no deadlock. B) Event 4 caused deadlock. C) Event 5 caused deadlock. D) Event 6 caused deadlock.

Front

A

Back

The transition from ____ is initiated by the Job Scheduler according to some predefined policy

Front

HOLD to READY

Back

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. A) True B) False

Front

T

Back

The segmented/demand paged memory allocation scheme offers the logical benefits of segmentation, as well as the physical benefits of paging. A) True B) False

Front

T

Back

Each active thread in a process shares the ____ and the resources allocated to its process. A) processor registers B) program counter C) data area D) status

Front

C

Back

T/F The Process Scheduler often uses a timing mechanism and periodically interrupts running processes when a predetermined slice of time has expired.

Front

True

Back

2. Card systems date from the earliest computers, which relied on punched cards or tape for input when a job was entered by assembling the cards into a deck and running the entire deck of cards through a card reader as a group. A) True B) False

Front

F

Back

The classic problem of producers and consumers is one in which one process produces some data that another process consumes later. A) True B) False

Front

F

Back

Assume that four jobs A-D require the CPU cycles listed below. Using the SJN algorithm, the ____ job is run first. Job: A B C D CPU cycle: 5 2 6 4

Front

B

Back

__ is the practice of using Internet-Connected resources to perform processing, storage or other operations

Front

Cloud Computing

Back

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

Front

False

Back

Studies have shown that having any ____, even a small one, can substantially improve the performance of the computer system. A) cache B) memory block C) page block D) block

Front

A

Back

One sector will hold one page of job instructions and fit into one page frame of memory. A) True B) False

Front

T

Back

In the dining philosophers problem there are five philosophers and four forks. A) True B) False

Front

F

Back

With demand paging, jobs are divided into equally sized ____ that initially reside in secondary storage. A) pages B) blocks C) frames D) sets

Front

A

Back

In the "dining philosophers" problem, a philosopher can pick up a fork when____. A) there is one available B) there are two available C) no other philosopher is eating D) it is his turn, going in numerical order from one philosopher to the next

Front

B

Back

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

Front

False

Back

6.In second-generation computers, 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

Front

A

Back

__ allows separate partitions of a single server to support a different operating system.

Front

Virtualization

Back

__ allow/s users to manipulate resources that may be located over a wide geographical area.

Front

Networks

Back

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. A) True B) False

Front

T

Back

____ gives users the appearance that their programs are being completely loaded in main memory during their entire processing time. A) Segmenting B) Virtual memory C) Shared memory D) Multithreading

Front

B

Back

The best-fit free list scheme uses memory more efficiently than the first-fit free scheme but it is slower to implement. A) True B) False

Front

T

Back

T/F A single processor can be shared by several jobs, or several processes, but if, and 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.

Front

True

Back

Threads share the same resources as the process that created them. A) True B) False

Front

T

Back

____ is necessary in any computer system because some resources such as memory, CPU, and dedicated devices must be exclusively allocated to one user at a time. A) Mutual exclusion B) Resource holding C) No preemption D) Circular wait

Front

A

Back

For storing a value in between calculations, a CPU has

Front

a temporary register

Back

To write a program that a CPU understands and can run, a programmer would need all the below except?

Front

Cache

Back

1. Onboard systems are computers placed inside other products to add features and capabilities. A) True B) False

Front

F

Back

In a single-user system, jobs are processed ____. A) sequentially B) intermittently C) randomly D) in order of longest job to shortest job

Front

A

Back

5.A supercomputer can perform ____ floating-point operations per second. A) 240 million B) 2.4 billion C) 2.4 trillion D) 24 trillion

Front

C

Back

Assume jobs A-D arrive in quick succession in the READY queue. Using round robin scheduling, the turnaround time for job C is ____. Arrival time: 0 1 2 3 Job: A B C D CPU cycle: 8 4 9 5

Front

24

Back

When using the clock page replacement policy, a page with a reference bit of ____ is replaced. A) -1 B) 0 C) 1 D) 5

Front

B

Back

__ are computers physically placed inside the products in which they operate to add specific features and capabilities.

Front

Embedded Systems

Back

____ is when, in modern printing systems, a disk accepts output from several users and acts as a temporary storage area for all output until the printer is ready to accept it. A) Phishing B) Lagging C) Spooling D) Spoofing

Front

C

Back

7. The primary distinguishing characteristic of modern computers is ____. A) memory capacity B) processor capacity C) disk space D) physical size

Front

B

Back

Which of the following is an essential manager of every O/S?

Front

Process Manager

Back

The only reason for multiprocessing is to increase computer power. A) True B) False

Front

F

Back

The following,____, describes the first memory allocation scheme. A) Each program to be processed was loaded into secondary storage, then swapped into memory in parts B) Each program to be processed was partially loaded into memory, then granted more memory as needed C) Each program to be processed was allocated a portion of memory and could negotiate with other programs to access more memory D) Each program to be processed was loaded in its entirety into memory and allocated as much contiguous space in memory as it needed

Front

D

Back

In a symmetric configuration, processor scheduling is ____. A) centralized B) decentralized C) multifaceted D) balanced

Front

B

Back

For many computational purposes, serial processing is sufficient; it's easy to implement and fast enough for most users. A) True B) False

Front

T

Back

Section 3

(50 cards)

The first-in first-out (FIFO) page replacement policy will remove the pages that have been in memory the shortest. A) True B) False

Front

F

Back

Consider the following page fault handler algorithm. Replace the * in the algorithm with ____. 1 If there is no free page frame Then select page to be swapped out using page removal algorithm update job's Page Map Table If content of page had been changed then * End if End if 2 Use page number from step 3 from the Hardware Instruction Processing Algorithm to get disk address where the requested page is stored 3 Read page into memory 4 Update job's Page Map Table 5 Update Memory Map Table 6 Restart interrupted instruction A) save page to main memory B) write page to disk C) mark page as being changed in PMT D) choose another page

Front

B

Back

Parallel processing is also called ____. A) uniprocessing B) multiprocessing C) shared processing D) divided processing

Front

B

Back

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

Front

False

Back

T/F Aging is used to ensure that jobs in lower-level queues will eventually complete their execution.

Front

True

Back

For ____ systems, deadlocks quickly become critical situations. A) batch B) interactive C) real-time D) general purpose

Front

C

Back

When modeling deadlock, if there's a cycle in the graph, then there is a deadlock involving the processes and the resources in the cycle. A) True B) False

Front

T

Back

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. A) deallocation B) redirection C) compaction D) reallocation

Front

C

Back

Assume the Memory Manager receives a request for a block of 200. When the best-fit algorithm is used, ____ is the beginning address of the block granted by the Memory Manager. Beginning Address Memory Block Size 4075 105 5225 5 6785 600 7560 20 7600 205 10250 4050 15125 230 24500 1000 A) 6785 B) 7600 C) 10250 D) 15125

Front

B

Back

12. Powerful microcomputers developed for use by commercial, educational and government enterprises are called ____. A) supercomputers B) minicomputers C) terminals D) workstations

Front

D

Back

A ____ is a portion of a process that can run independently

Front

Thread

Back

____ occurs when two processes do not release control of resources they are using. A) No preemption B) Circular wait C) Resource holding D) Mutual exclusion

Front

C

Back

Multiprocessing can refer to one job using several processors to execute sets of instructions in parallel. A) True B) False

Front

T

Back

9. The File Manager is responsible for data files but not program files. A) True B) False

Front

F

Back

The success of process synchronization hinges on the capability of the operating system to make a resource available to other processes while it is being used by one of them. A) True B) False

Front

F

Back

Some systems increase the priority of jobs that have been in the system for an unusually long time to expedite their exit, which is known as ____.

Front

Aging

Back

Failure to lock database records before updating them may result in a ____ between processes. A) struggle B) race C) timeout D) livelock

Front

B

Back

____ proposed a solution to the readers and writers problem that did not result in starvation for readers or writers. A) Hoare B) Courtois C) Heymans D) Parnas

Front

A

Back

____ consists of fragments of free memory between blocks of allocated memory. A) An inefficient fit B) Indirect partitioning C) External fragmentation D) Internal fragmentation

Front

C

Back

If a particular demand paging configuration has 9 page interrupts out of 11 page requests, failure rate is ____. A) 18% B) 52% C) 82% D) 95%

Front

C

Back

Most current operating systems support the implementation of threads, or ____, which have become part of numerous application packages. A) parallel processes B) lightweight processes C) heavyweight processes D) semaphores

Front

B

Back

Which of the following memory management schemes does not allow multi-programming?

Front

Single-user contiguous scheme

Back

The loosely coupled configuration features several complete computer systems, each with its own memory, I/O devices, CPU, and operating system. A) True B) False

Front

T

Back

____ developed the Banker's Algorithm. A) Havender B) Holt C) Dijkstra D) Lane & Mooney

Front

C

Back

T/F From HOLD, the job moves to WAITING when it's ready to run but is waiting for the CPU

Front

False

Back

To access a location in memory when using segmented memory management, the address is composed of two entries: ____. A) the segment number and the line number B) the segment number and the displacement C) the line number and the displacement D) the segment number, the line number, and the displacement

Front

B

Back

There are ____ entries per page in the PMT. A) 0 B) 1 C) 2 D) 5

Front

B

Back

T/F The shortest remaining time (SRT) algorithm is often used in interactive systems

Front

False

Back

There won't be __ inside a CPU?

Front

RAM

Back

Consider the case of a home construction company with two application programs, purchasing (P1) and sales (P2), which are active at the same time. They each need to access two files, inventory (F1) and suppliers (F2), to update daily transactions. The following series of events will cause a deadlock. Fill in the missing event in the sequence. 1. Purchasing (P1) accesses the supplier file (F2). 2. Sales (P2) accesses the inventory file (F1). 3. Purchasing (P1) doesn't release the supplier file (F2) but requests the inventory file (F1), but P1 is blocked because F1 is being held by P2. 4. Meanwhile, ____ A) sales (P2) doesn't release the inventory file (F1) but requests the supplier file (F2) B) sales (P2) does release the inventory file (F1) and then requests the supplier file (F2) C) purchasing (P1) does release the supplier file (F2) which is then requested by sales (P2) D) purchasing (P1) exits

Front

A

Back

__ is performed by the O.S to reclaim fragmented space.

Front

Memory Compaction

Back

15.Few major advances were made in data management during the 1960s. A) True B) False

Front

F

Back

T/F Context switching is required by all preemptive algorithms

Front

True

Back

The phenomenon of less than complete use of memory space in a fixed partition is called?

Front

internal fragmentation.

Back

The __ contains the value that must be added to each address referenced in the program so that the system will be able to access the correct memory address after relocation?

Front

base register

Back

Which of the following requirement is not a disadvantage of a fixed partition scheme?

Front

It does not allow multiprogramming

Back

By compacting and relocating, the Memory Manager optimizes the use of memory and thus improves throughput, but an unfortunate side effect is more ____. A) null entries B) segmentation C) errors D) overhead

Front

D

Back

13.Card systems date from the earliest computers, which relied on punched cards or tape for input when a job was entered by assembling the cards into a deck and running the entire deck of cards through a card reader as a group. A) True B) False

Front

F

Back

The kernel resides in?

Front

RAM

Back

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. A) busy list B) compaction monitor C) relocation register D) bounds register

Front

C

Back

10. Real-time systems are used in time-critical environments where reliability is key and data must be processed within a strict time limit. A) True B) False

Front

T

Back

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

Front

A

Back

The cache hit ratio is ____, if the total number of requests is 10 and 6 of those are found in cache memory. A) 6% B) 10% C) 60% D) 100%

Front

C

Back

14.Since the mid-1970s rapid advances in computer technology have blurred the distinguishing characteristics of early machines. A) True B) False

Front

T

Back

A deadlock is preceded by six simultaneous conditions that the operating system could have recognized. A) True B) False

Front

F

Back

Research continues to focus on finding the optimum allocation scheme. A) True B) False

Front

T

Back

11. A hybrid system is a combination of the ____ systems. A) batch and interactive B) batch and real-time C) interactive and real-time D) real-time and general-purpose

Front

A

Back

After relocation and compaction, both the free list and the busy list are updated. A) True B) False Points Earned: 1.0/1.0 Correct Answer(s): True

Front

T

Back

The common element in all synchronization schemes is to allow a process to finish work on a critical region of the program before other processes have access to it. A) True B) False

Front

T

Back

When using a FIFO scheme, more memory will always result in better performance. A) True B) False

Front

F

Back

Section 4

(50 cards)

Deadlocks are most serious in real-time systems. A) True B) False

Front

T

Back

T/F 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 PCB.

Front

True

Back

Which of the following is the correct way of calculating the starting address of the page frame?

Front

Multiply the page frame number by the page frame size

Back

The __ policy is based on the assumption that the best page to remove is the one that has been in memory the longest.

Front

FIFO

Back

In general, when a job is allocated to the CPU its Page Map Table is loaded into main memory while the Segment Map Tables are loaded only as needed. A) True B) False

Front

F

Back

17.____ means that several logical records are grouped within one physical record. A) Grouping B) Fixing C) Combining D) Blocking

Front

D

Back

____ include(s) every peripheral unit in the system such as printers, disk drives, CD/DVD drives, flash memory, keyboards, and so on. A) The CPU B) I/O Devices C) Processors D) Secondary components

Front

B

Back

A ____ of processing must be handled as a unit. A) line B) segment C) critical region D) semaphore

Front

C

Back

Assume that the Page Map Table below is in effect. The number of lines per page is 400. The actual memory location for line 433 is ____. Job Page Number Page Frame Number 0 8 1 10 2 5 3 11 A) 1 B) 33 C) 4000 D) 4033

Front

D

Back

T/F A process is an inactive unit, such as a file stored on a disk

Front

False

Back

Fill in the missing event that causes livelock. At an insurance company the system performs many daily transactions. One day the following series of events ties up the system: 1. Process P1 wishes to show a payment so it issues a command to read the balance, which is stored in cylinder 20 of a disk pack. 2. ____ 3. P2 gains control of the I/O channel and issues a command to write someone else's payment to a record stored in cylinder 310. If the command is not "locked out," P2 will be put on hold while the control unit moves the arm to cylinder 310. 4. Because P2 is "on hold," the channel is free to be captured again by P1, which reconfirms its command to "read from cylinder 20." 5. Since the last command from P2 had forced the arm mechanism to cylinder 310, the disk control unit begins to reposition the arm to cylinder 20 to satisfy P1. The I/O channel would be released because P1 is once again put on hold, so it could be captured by P2, which issues a WRITE command only to discover that the arm mechanism needs to be repositioned. A) While the control unit is moving the arm to cylinder 20, P1 is put on hold and the I/O channel is free to process the next I/O request. B) P1 discovers that another process has locked the portion of the disk it needs to access. C) P2 is put on hold while the control unit moves the arm to satisfy P1's request D) P1 is unable to find the information it needs, so requests a different READ operation for a different cylinder.

Front

A

Back

Automatic detection by the compiler of instructions that can be performed in parallel is called ____. A) automatic parallelism B) array parallelism C) explicit parallelism D) implicit parallelism

Front

D

Back

16.Second-generation computers were developed to meet the needs of ____. A) home users B) businesses C) secondary education D) online users

Front

B

Back

Deadlock does not usually affect the entire system. A) True B) False

Front

F

Back

A variation of the LRU page replacement algorithm is known as the clock page replacement policy because it is implemented with a circular queue and uses a pointer to step through the reference bits of the active pages, simulating a clockwise motion. A) True B) False

Front

T

Back

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. A) True B) False

Front

F

Back

The fixed partition scheme works well ____. A) when jobs have the same size B) when jobs have different sizes C) when job sizes are not known in advance D) when all jobs are under 100K

Front

A

Back

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. A) True B) False

Front

T

Back

Deadlock is a system-wide tangle of resource requests that begins when two or more jobs are put on hold, each waiting for a vital resource to become available. A) True B) False

Front

T

Back

Front

Back

Assume the Memory Manager receives a request for a block of 200. When the best-fit algorithm is used, ____ is the beginning address of the block granted by the Memory Manager. Beginning Address Memory Block Size 4075 105 5225 5 6785 600 7560 20 7600 205 10250 4050 15125 230 24500 1000

Front

B

Back

T/F 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.

Front

True

Back

__ is a small high-speed memory unit that a processor can access more rapidly than main memory

Front

Cache memory

Back

For well-defined, fixed time constraints, it is recommended to use a/an __ Operating system.

Front

real-time

Back

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. A) True B) False

Front

T

Back

There are several recovery algorithms, but they all have one feature in common: they all require at least one victim, an expendable job, which, when removed from the deadlock, will free the system. A) True B) False

Front

T

Back

____ is the partitioning of a single server, each of which can support a different operating system. A) Multiprocessing B) Multithreading C) Virtualization D) Shared processing

Front

C

Back

A job's working set is the set of pages residing in memory that can be accessed indirectly. A) True B) False

Front

F

Back

Consider the following four cases. The LRU policy,____, will be least likely to swap. Modified Referenced Meaning Case 1 0 0 Not modified AND not referenced Case 2 0 1 Not modified BUT was referenced Case 3 1 0 Was modified BUT not referenced Case 4 1 1 Was modified AND was referenced A) Case 1 B) Case 2 C) Case 3 D) Case 4

Front

D

Back

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

Front

True

Back

Statement: User programs can be stored from memory location 0000000H.

Front

False

Back

When there is an excessive amount of page swapping between main memory and secondary storage, the operation becomes inefficient, which is called ____. A) excessive demand paging B) hot swapping C) thrashing D) overswapping

Front

C

Back

Within the Memory Manager the Segment Link Table lists details about each segment (one for each job). A) True B) False

Front

F

Back

The first bug was a moth trapped in a Harvard computer. A) True B) False

Front

T

Back

For a fixed partition system, memory deallocation is quite complex. A) True B) False

Front

F

Back

The symmetric configuration is best implemented if the processors are all of the same type. A) True B) False

Front

T

Back

Queues use ____ to track jobs the same way customs officials use passports to track international visitors

Front

PCBs

Back

__ allocation is a better scheme for distributing free frames.

Front

proportional

Back

In a highly interactive environment there is a third layer of the Processor Manager called the ____ scheduler.

Front

Middle-Level

Back

Which of the following concepts is best at preventing page faults?

Front

The working set

Back

The ____ policy is based on the theory that the best page to remove is the one that has been in memory the longest. A) TRU B) LRU C) LIFO D) FIFO

Front

D

Back

Where there is an excessive amount of page swapping between main memory and secondary storage, the operation becomes inefficient. This is phenomenon is called__

Front

Thrashing

Back

The overwhelming demand for ____ capability in the mid-1990s sparked the proliferation of networking capability. A) e-mail B) processing C) Internet D) FTP

Front

C

Back

A network that's congested or has filled a large percentage of its I/O buffer space can become deadlocked if it doesn't have ____ to control the flow of messages through the network. A) procedures B) protocols C) policies D) rules

Front

B

Back

____ holds pertinent information, including the address where the job is stored and, in the case of virtual memory, the mapping between virtual and physical memory locations

Front

Main Memory

Back

Vacuum tube computers were used during the period of ____. A) 1920s-1930s B) 1935-1945 C) 1940-1955 D) 1945-1960

Front

C

Back

Operations on semaphore s enforce the concept of ____, which is necessary to avoid having two operations attempt to execute at the same time. A) mutual execution B) mutex execution C) signal exclusion D) mutual exclusion

Front

D

Back

The first attempt to allow for multiprogramming used fixed partitions. A) True B) False

Front

T

Back

One problem with the Banker's Algorithm is that resources aren't well utilized because the algorithm assumes the worst case and, as a result, keeps vital resources unavailable to guard against unsafe states. A) True B) False

Front

T

Back

____ is the act of allowing only one process to have access to a dedicated resource. A) No preemption B) Circular wait C) Resource holding D) Mutual exclusion

Front

D

Back

Section 5

(50 cards)

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. A) True B) False

Front

T

Back

One of the most important innovations of demand paging was that it made ____ feasible. A) memory demand B) virtual demand C) virtual paging D) virtual memory

Front

D

Back

Starvation is the result of the liberal allocation of resources. A) True B) False

Front

F

Back

Interactive systems generally improve the use of resources through ____ resource sharing, but this resource sharing capability also increases the possibility of deadlocks. A) interspersed B) group C) dynamic D) static

Front

C

Back

Optimal page replacement

Front

is used mostly for comparison with other page-replacement schemes

Back

T/F The process state contains all of the data about the job needed by the operating system to manage the processing of the job.

Front

False

Back

Average wastage from internal fragmentation in paging?

Front

would be half a page per running process

Back

A process requires space in main memory where it resides during its execution although, from time to time, it requires other resources such as data files or I/O devices. A) True B) False

Front

T

Back

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). A) True B) False

Front

T

Back

The contents of ROM are volatile, hence they are erased when the power is turned off, unlike the contents of RAM.

Front

False

Back

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. A) True B) False

Front

B

Back

Statement: Cache is an extension of the Main Memory in the CPU.

Front

False

Back

The ____ is unique to each operating system. A) User Interface B) Process Manager C) Memory Manager D) File Manager

Front

A

Back

Few major advances were made in data management during the 1960s. A) True B) False

Front

T

Back

The ____ allocates each resource, starts its operation, and, finally, deallocates the resource, making it available to the next process or job. A) Device Manager B) File Manager C) Keyboard Manager D) Memory Manager

Front

A

Back

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

Front

True

Back

During the second generation, programmers started dividing their programs into sections that resembled working sets, really segments, originally called roll in/roll out and now called ____. A) undermaps B) overmaps C) underlays D) overlays

Front

D

Back

In the PMT, the ____ bit for all pages in memory is 1. A) status B) referenced C) modified D) frame

Front

A

Back

Deadlock was a serious problem for early batch systems. A) True B) False

Front

T

Back

Each page of a job is actually stored in a page frame that can be located anywhere in available main memory. A) True B) False

Front

T

Back

First-come, first-served (FCFS) is a very simple algorithm to implement because it ____.

Front

uses a FIFO queue

Back

A typical ____ computer houses devices to perform audio, video, and graphic creation and editing. A) multiprocessor B) multimedia C) networked D) PDA

Front

B

Back

__ algorithm that is often chosen for block replacement.

Front

LRU

Back

To find the exact position of an instruction in memory, after the page number and displacement has been calculated, the operating system refers to the job's PMT to find out which page frame contains the page. A) True B) False

Front

T

Back

The name for the nucleus of an operating system is the ____. A) manager B) center C) core D) kernel

Front

D

Back

Which of the following memory management schemes solved internal fragmentation?

Front

Segmented memory allocation

Back

The extended page map table will not have the __ bit.

Front

Page Fault

Back

An address for actual memory content is known as

Front

Physical address

Back

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. A) True B) False

Front

T

Back

In the memory of a single-tasking OS, which of the following may NOT be found?

Front

Cache

Back

The address of the beginning of a page frame is found by multiplying the page frame number by the number of frames. A) True B) False

Front

F

Back

The time lose in swap out and swap in can be reduced by __

Front

writing the swapped-out page based on modified bit

Back

If locks are not used to preserve data integrity, the updated records in a database might include only some of the data—and their contents would depend on the order in which each process finishes its execution. A) True B) False

Front

T

Back

The high-level portion of the Process Manager is called the Process Scheduler. A) True B) False

Front

F

Back

The Job Scheduler seeks to ___ , when scheduling jobs

Front

Balance CPU and I/O intensive jobs.

Back

Many early programs used convoluted logic that only the original programmer could understand, so it was nearly impossible for anyone else to debug or change the program later on. A) True B) False

Front

T

Back

The term __ is used to describe the programming code used to start the computer and perform other necessary tasks.

Front

Firmware

Back

Fill in the missing step in the following deadlock situation. Two users from the local board of education are each running a program (P1 and P2), and both programs will eventually need two DVD drives to copy files from one disc to another. Only two DVD-R drives are available and they're allocated on an "as requested" basis. Soon the following sequence transpires: 1. P1 requests drive 1 and gets it. 2. ____ 3. P1 requests drive 2 but is blocked. 4. P2 requests drive 1 but is blocked. A) P1 requests drive 2. B) P2 requests drive 2 and gets it. C) P2 requests drive 1 but is blocked. D) P1 releases drive 1.

Front

B

Back

The minicomputer of the 1970s was smaller than the microcomputer. A) True B) False

Front

F

Back

The term 'deallocation' could apply to:

Front

memory space, a device and a file.

Back

There are two types of fragmentation: internal and external. The type depends on the location of the wasted space.

Front

True.

Back

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. A) True B) False

Front

T

Back

The term ____, means that during any phase of its execution, the program references only a small fraction of its pages. A) dynamic paging B) structured programming C) locality of reference D) working set

Front

C

Back

____ introduced the need for control cards, which defined the exact nature of each program and its requirements. A) Job scheduling B) Control scheduling C) Job control D) Structure control

Front

A

Back

T/F The Process Scheduler often uses a timing mechanism and periodically interrupts running processes when a predetermined slice of time has expired

Front

True

Back

To move in a new page, a resident page must be swapped back into primary storage. A) True B) False

Front

F

Back

Consider a logical address with a page size of 8KB. How many bits must be used to represent the page offset in the logical address?

Front

13

Back

The ____ is used to indicate that a program is permanently held in ROM (read only memory), as opposed to being held in secondary storage. A) hardware B) firmware C) software D) shareware

Front

B

Back

There are ____ entries per page in the PMT. A) 0 B) 1 C) 2 D) 5

Front

B

Back

____ can be thought of as being an intermediary between main memory and the special-purpose registers, which are the domain of the CPU. A) Virtual memory B) Cache memory C) Paging D) Segmenting

Front

B

Back