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 | |
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 | |
No comments:
Post a Comment