Operating Systems Concepts

The Device Manager monitors every device, channel, and control unit. A) True B) False

A) True

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

A) User Interface

The ____ is also called the high-level scheduler. A) Process Scheduler B) Job Scheduler C) Program Scheduler D) Thread Scheduler

B) Job Scheduler

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

B) businesses

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

C) Internet

____ operating systems are typically used for a network platform. A) IRIX, UNICOS B) Linux, Macintosh, MS-DOS, Windows 2000/XP C) Linux, NetWare, UNIX, Windows D) IBM OS/390, UNIX

C) Linux, NetWare, UNIX, Windows

A thread transitions from RUNNING to ____ when it has to wait for an event outside its control to occur. A) LOOPING B) BLOCKED C) WAITING D) PENDING

C) WAITING

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

C) compaction

In a computer, the ____ holds the Central Processing Unit, the Arithmetic and Logic Unit, registers, cache, and main memory. A) parallel system B) USB interface C) tower D) monitor

C) tower

There are ____associative registers. A) two B) five C) ten D) a varied number of

D) a varied number of

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

D) workstations

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 A) 7 B) 20 C) 22 D) 24

D) 24

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

D) FIFO

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

C) 2.4 trillion

____ 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

C) Resource holding

____ 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

C) Spooling

____ semaphores are used in the producer and consumer problem. A) One B) Two C) Three D) Four

C) Three

____ allows for faster turnaround of CPU-bound jobs. A) No movement between queues B) Movement between queues C) Variable time quantum per queue D) Aging

C) Variable time quantum per queue

In a directed graph used to model deadlock, ____ represents deadlock. A) a solid arrow B) a dashed arrow C) a cycle D) any path

C) a cycle

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

C) dynamic

In a highly interactive environment there is a third layer of the Processor Manager called the ____ scheduler. A) Managing B) Subprocess C) middle-level D) Program

C) middle-level

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

D) Blocking

Once a thread is in the ready state, the state it can enter next is ____. A) BLOCKED B) FINISHED C) WAITING D) RUNNING

D) RUNNING

____ systems are used in time-critical environments where reliability is key and data must be processed within a strict time limit. A) Embedded B) Hybrid C) Interactive D) Real-time

D) Real-time

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

D) virtual memory

____ 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

D) Mutual exclusion

Internal interrupts, or ____ interrupts, also occur as a direct result of the arithmetic operation or job instruction currently being processed. A) I/O B) illegal job instruction C) illegal operation D) synchronous

D) synchronous

Queues use ____ to track jobs the same way customs officials use passports to track international visitors. A) jobs B) processes C) PCBs D) record identifiers

C) PCBs

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

A) True

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

A) True

Each job is uniquely identified by the user's identification and a pointer connecting it to its descriptor. A) True B) False

A) True

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

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

A) True

Parallel processing is a situation in which two or more processors operate in unison. A) True B) False

A) True

Resource holding, where a job holds on to one resource while waiting for another one that's not yet available, could be sidestepped by forcing each job to request, at creation time, every resource it will need to run to completion. A) True B)False

A) True

The Intel 4004 chip in 1971 had 2,300 transistors while the Pentium II chip twenty years later had 7.5 million, and the Pentium 4 Extreme Edition processor introduced in 2004 had 178 billion transistors. A) True B) False

A) True

The Process Scheduler often uses a timing mechanism and periodically interrupts running processes when a predetermined slice of time has expired. A) True B) False

A) True

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

A) True

The operating system manages each and every piece of hardware and software. A) True B) False

A) True

When the Processor Manager receives a command, it determines whether the program must be retrieved from storage or is already in memory, and then notifies the appropriate manager. A) True B) False

A) True

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

A) automatic parallelism

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

A) batch and interactive

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

A) control unit

The scheme of ____ removes the possibility of a circular wait and therefore guarantees the removal of deadlocks. A) hierarchical ordering B) preemption C) saving and restoring job state D) requesting all resources before job run

A) hierarchical ordering

A____ is a portion of a process that can run independently. A) thread B) program C) miniprocess D) subprocess

A) thread

First-come, first-served (FCFS) is a very simple algorithm to implement because it ____. A) uses a FIFO queue B) uses a LIFO queue C) uses a circular queue D) uses a directed graph

A) uses a FIFO queue

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

A) virtual memory

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

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 A) A B) B C) C D) D

B) B

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

B) False

A semaphore is a negative integer variable that is used as a binary signal. A) True B) False

B) False

An operating system is a special type of hardware. A) True B) False

B) False

From HOLD, the job moves to WAITING when it's ready to run but is waiting for the CPU. A) True B) False

B) False

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

B) False

The Memory Manager, the Interface Manager, the User Manager, and the File Manager are the basis of all operating systems. A) True B) False

B) False

The Processor Manager is a composite of two submanagers: one in charge of job scheduling and the other in charge of program scheduling. A) True B) False

B) False

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

B) False

The problem of partition intrusion is present in single-user contiguous allocation schemes. A) True B) False

B) False

To find the address of a given program line, the line number is multiplied by the page size. A) True B) False

B) False

____ showed how the four conditions can be modeled using directed graphs. A) Havender B) Holt C) Dijkstra D) Lane & Mooney

B) Holt

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.

B) P2 requests drive 2 and gets it

An algorithm designed to detect starvation by tracking how long each job has been waiting for resources is the same concept as ____. A) deadlock B) aging C) preemption D) round robin

B) aging

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

B) decentralized

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

B) firmware

The ____ keeps the free/busy lists organized by memory locations, low-order memory to high-order memory. A) fixed partition llocation B) first-fit memory allocation C) dynamic fit memory allocation D) best-fit memory allocation

B) first-fit memory allocation

A thread (or ____) can be defined as a unit smaller than a process, which can be scheduled and executed. A) heavyweight process B) lightweight process C) kernel D) distributor

B) lightweight process

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

B) lightweight processes

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

B) processor capacity

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

B) race

If the page size is 100 bytes,____ is the displacement for byte 214 of a program. A) 0.5 B) 2 C) 14 D) 21400

C) 14

____ is the actual memory address for a job that starts at 18K. A) 1,800 B) 18,000 C) 18,432 D) 180,000

C) 18,432

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

C) 1940-1955

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%

C) 60%

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%

C) 82%

____ is when each process involved in the impasse is waiting for another to voluntarily release the resource so that at least one will be able to continue on. A) Mutual exclusion B) Resource holding C) Circular wait D) No preemption

C) Circular wait

Which of the following is the first step in reducing a directed graph to eliminate deadlock? A) Remove the process that is holding on to the most resources. B) Find a process that's waiting only for resource classes that aren't fully allocated C) Find a process that is currently using a resource and not waiting for one. D) Find the oldest process and remove it from the graph.

C) Find a process that is currently using a resource and not waiting for one

Fill in the missing event that causes deadlock in a database. There are two processes (P1 and P2), each of which needs to update two records (R1 and R2) and the following sequence leads to a deadlock: 1. P1 accesses R1 and locks it. 2. P2 accesses R2 and locks it. 3. ____4. P2 requests R1, which is locked by P1. A) P2 releases R2. B) P1 requests R1 again. C) P1 requests R2, which is locked by P2. D) P2 releases R1.

C) P1 requests R2, which is locked by P2

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

C) locality of reference

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

D) Each program to be processed was loaded in its entirety into memory and allocated as much contiguous space in memory as it needed

Assume the following events and actions take place. Which of the following statements is true? Event Action 1 P1 requests and is allocated R1. 2 P2 requests and is allocated R2. 3 P3 requests and is allocated R3. 4 P1 requests R2. 5 P2 requests R3. 6 P3 requests R1. A) There is no deadlock. B) Event 4 caused deadlock. C) Event 5 caused deadlock. D) Event 6 caused deadlock.

D) Event 6 caused deadlock

The transition from ____ is initiated by the Job Scheduler according to some predefined policy. A) READY to RUNNING B) RUNNING to WAITING C) RUNNING back to READY D) HOLD to READY

D) HOLD to READY

____ is how memory is deallocated in a fixed partition scheme. A) Memory Manager releases the block and combines it with another free block. B) Memory Manager immediately gives memory to another program. C) Memory Manager adds block to free list and removes it from busy list. D) Memory Manager resets the status of the memory block where the job was stored to "free."

D) Memory Manager resets the status of the memory block where the job was stored to "free."

The source code of a Java program is first compiled into an intermediate language called Java ____, which are platform-independent. A) beans B) nibs C) bits D) bytecodes

D) bytecodes

The most common mechanism for implementing multiprogramming was the introduction of the ____ concept, which is when the CPU is notified of events needing operating systems services. A) paging B) sharing C) messaging D) interrupt

D) interrupt

Lock and key synchronization must take place within a single ____. A) instruction B) computer C) processor D) machine cycle

D) machine cycle

In the partition scheme, the table that the Memory Manager uses to keep track of jobs is composed of the ____. A) partition size, memory address, and status B) status, access, and memory address C) partition size, status, and access D) partition size, memory address, access, and status

D) partition size, memory address, access, and status

Context switching is required by all preemptive algorithms. A) True B) False

A) True

Each unit in the I/O subsystem can finish its operation independently from the others. A) True B) False

A) True

When using a semaphore, a value of ____ indicates that a critical region is in use. A) -100 B) 0 C) 100 D) 9999

B) 0

A DVD with a fast data transfer rate will drop fewer frames when playing back a recorded video segment than will a unit with a slower transfer rate. A) True B) False

A) True

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

A) True

____ contains information used mainly for billing purposes and performance measurement. A) Accounting B) Process State C) Process Identification D) Process Status

A) Accounting

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

A) Device Manager

When a computer evaluates the expression A = 3 * B * C + 4 / (D + E) ** (F - G), in a sequential manner, ____ is evaluated as a first step. A) F - G B) 3 * B C) C + 4 D) B * C

A) F - G

____ 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

A) Job scheduling

____ 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. A) Main memory B) Register content C) Process priority D) The process state

A) Main memory

____ allows a resource to be held by a process as long as it is needed. A) No preemption B) Circular wait C) Resource holding D) Mutual exclusion

A) No preemption

____ are self-contained modules (units of software) that provide models of the real world and can be reused in different applications. A) Objects B) Kernels C) Peripherals D) Threads

A) Objects

The two operations identified by Dijkstra to be performed on a semaphore are ____. A) P and V B) WAIT and SIGNAL C) test and set D) check and update

A) P and V

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.

A) There is no deadlock