Chapter 2 OSC

Attempt 1

1.

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

A) sequentially
B) intermittently
C) randomly
D) in order of longest job to shortest job

Points Earned:	1.0/1.0
Correct Answer(s):	A

2.

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

Points Earned:	0.0/1.0
Correct Answer(s):	True

3.

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

Points Earned:	1.0/1.0
Correct Answer(s):	True

4.

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

Points Earned:	1.0/1.0
Correct Answer(s):	True

5.

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

Points Earned:	1.0/1.0
Correct Answer(s):	True

6.

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

Points Earned:	0.0/1.0
Correct Answer(s):	D

7.

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

Points Earned:	1.0/1.0
Correct Answer(s):	A

8.

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

Points Earned:	1.0/1.0
Correct Answer(s):	A

9.

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

Points Earned:	1.0/1.0
Correct Answer(s):	C

10.

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

11.

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

Points Earned:	0.0/1.0
Correct Answer(s):	C

12.

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

Points Earned:	1.0/1.0
Correct Answer(s):	B

Attempt 2

1.

Research continues to focus on finding the optimum allocation scheme.

A) True
B) False

Points Earned:	1.0/1.0
Correct Answer(s):	True

2.

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

A) An inefficient fit
B) Indirect partitioning
C) External fragmentation
D) Internal fragmentation

Points Earned:	0.0/1.0
Correct Answer(s):	C

3.

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

Points Earned:	1.0/1.0
Correct Answer(s):	D

4.

The first attempt to allow for multiprogramming used fixed partitions.

A) True
B) False

Points Earned:	1.0/1.0
Correct Answer(s):	True

5.

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

Points Earned:	1.0/1.0
Correct Answer(s):	B

6.

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

Points Earned:	1.0/1.0
Correct Answer(s):	True

7.

For a fixed partition system, memory deallocation is quite complex.

A) True
B) False

Points Earned:	1.0/1.0
Correct Answer(s):	False

8.

Research continues to focus on finding the optimum allocation scheme.

A) True
B) False

Points Earned:	1.0/1.0
Correct Answer(s):	True

9.

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

Points Earned:	1.0/1.0
Correct Answer(s):	False

10.

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

Points Earned:	1.0/1.0
Correct Answer(s):	A

11.

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

Points Earned:	1.0/1.0
Correct Answer(s):	C

12.

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

Points Earned:	1.0/1.0
Correct Answer(s):	True

Chapter 1 OSC

Attempt 1

1.

Onboard systems are computers placed inside other products to add features and capabilities.

A) True
B) False

Points Earned:	1.0/1.0
Correct Answer(s):	False

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

Points Earned:	0.0/1.0
Correct Answer(s):	False

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

Points Earned:	1.0/1.0
Correct Answer(s):	True

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

Points Earned:	0.0/1.0
Correct Answer(s):	False

5.

A supercomputer can perform ____ floating-point operations per second.

A) 240 million
B) 2.4 billion
C) 2.4 trillion
D) 24 trillion

Points Earned:	1.0/1.0
Correct Answer(s):	C

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

Points Earned:	0.0/1.0
Correct Answer(s):	A

7.

The primary distinguishing characteristic of modern computers is ____.

A) memory capacity
B) processor capacity
C) disk space
D) physical size

Points Earned:	1.0/1.0
Correct Answer(s):	B

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

Points Earned:	1.0/1.0
Correct Answer(s):	A

9.

The File Manager is responsible for data files but not program files.

A) True
B) False

Points Earned:	1.0/1.0
Correct Answer(s):	False

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

Points Earned:	1.0/1.0
Correct Answer(s):	True

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

Points Earned:	1.0/1.0
Correct Answer(s):	A

12.

Powerful microcomputers developed for use by commercial, educational and government enterprises are called ____.

A) supercomputers
B) minicomputers
C) terminals
D) workstations

Points Earned:	1.0/1.0
Correct Answer(s):	D

Attempt 2

1.

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

Points Earned:	1.0/1.0
Correct Answer(s):	False

2.

Since the mid-1970s rapid advances in computer technology have blurred the distinguishing characteristics of early machines.

A) True
B) False

Points Earned:	1.0/1.0
Correct Answer(s):	True

3.

Few major advances were made in data management during the 1960s.

A) True
B) False

Points Earned:	0.0/1.0
Correct Answer(s):	True

4.

Second-generation computers were developed to meet the needs of ____.

A) home users
B) businesses
C) secondary education
D) online users

Points Earned:	1.0/1.0
Correct Answer(s):	B

5.

____ means that several logical records are grouped within one physical record.

A) Grouping
B) Fixing
C) Combining
D) Blocking

Points Earned:	0.0/1.0
Correct Answer(s):	D

6.

____ 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

Points Earned:	1.0/1.0
Correct Answer(s):	B

7.

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

A) True
B) False

Points Earned:	1.0/1.0
Correct Answer(s):	True

8.

The overwhelming demand for ____ capability in the mid-1990s sparked the proliferation of networking capability.

A) e-mail
B) processing
C) Internet
D) FTP

Points Earned:	1.0/1.0
Correct Answer(s):	C

9.

Vacuum tube computers were used during the period of ____.

A) 1920s-1930s
B) 1935-1945
C) 1940-1955
D) 1945-1960

Points Earned:	1.0/1.0
Correct Answer(s):	C

10.

____ 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

Points Earned:	1.0/1.0
Correct Answer(s):	C

11.

____ 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

Points Earned:	0.0/1.0
Correct Answer(s):	A

12.

The minicomputer of the 1970s was smaller than the microcomputer.

A) True
B) False

Points Earned:	1.0/1.0
Correct Answer(s):	False

Attempt 3

1.

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

Points Earned:	1.0/1.0
Correct Answer(s):	True

2.

A typical ____ computer houses devices to perform audio, video, and graphic creation and editing.

A) multiprocessor
B) multimedia
C) networked
D) PDA

Points Earned:	1.0/1.0
Correct Answer(s):	B

3.

The ____ is unique to each operating system.

A) User Interface
B) Process Manager
C) Memory Manager
D) File Manager

Points Earned:	1.0/1.0
Correct Answer(s):	A

4.

The name for the nucleus of an operating system is the ____.

A) manager
B) center
C) core
D) kernel

Points Earned:	1.0/1.0
Correct Answer(s):	D

5.

____ 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

Points Earned:	0.0/1.0
Correct Answer(s):	A

6.

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

Points Earned:	0.0/1.0
Correct Answer(s):	B

7.

Few major advances were made in data management during the 1960s.

A) True
B) False

Points Earned:	1.0/1.0
Correct Answer(s):	True

8.

____ 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

Points Earned:	1.0/1.0
Correct Answer(s):	B

9.

The high-level portion of the Process Manager is called the Process Scheduler.

A) True
B) False

Points Earned:	1.0/1.0
Correct Answer(s):	False

10.

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

Points Earned:	1.0/1.0
Correct Answer(s):	True

11.

The overwhelming demand for ____ capability in the mid-1990s sparked the proliferation of networking capability.

A) e-mail
B) processing
C) Internet
D) FTP

Points Earned:	1.0/1.0
Correct Answer(s):	C

12.

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

Points Earned:	1.0/1.0
Correct Answer(s):	A