COIS 3620H - Chapter 2

1. 1Single-user systems in a non-networked environment allocate, to each user, access to all available main memory for each job, and jobs are processed sequentially, one after the other.

   1. ARichtig
   2. BFalsch
2. 2A single-user system supports multiprogramming.

   1. ARichtig
   2. BFalsch
3. 3The first attempt to allow for multiprogramming used fixed partitions.

   1. ARichtig
   2. BFalsch
4. 4Single-user contiguous allocation schemes have the problem of partition intrusion..

   1. ARichtig
   2. BFalsch
5. 5The algorithm used to store jobs into memory in a fixed partition system requires a few more steps than the one used for a single-user system because the size of the job must be matched with the size of the partition to make sure it fits completely

   1. ARichtig
   2. BFalsch
6. 6The 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.

   1. ARichtig
   2. BFalsch
7. 7The 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.

   1. ARichtig
   2. BFalsch
8. 8In 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.

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

   1. ARichtig
   2. BFalsch
10. 10A large job can have problems with a first-fit memory allocation scheme.

    1. ARichtig
    2. BFalsch

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

    1. ARichtig
    2. BFalsch
12. 12One 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.

    1. ARichtig
    2. BFalsch
13. 13Research continues to focus on finding the optimum allocation scheme.

    1. ARichtig
    2. BFalsch
14. 14For a fixed partition system, memory deallocation is relatively complex

    1. ARichtig
    2. BFalsch
15. 15In 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.

    1. ARichtig
    2. BFalsch
16. 16In 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.

    1. ARichtig
    2. BFalsch
17. 17Memory defragmentation is performed by the operating system to reclaim fragmented space.

    1. ARichtig
    2. BFalsch
18. 18After relocation and compaction, both the free list and the busy list are updated.

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

    1. ARichtig
    2. BFalsch
20. 20Compaction should always be performed only when there are jobs waiting to get in.

    1. ARichtig
    2. BFalsch
21. 21Main memory is also known as ____.

    1. Asingle-user memory
    2. Brandom access memory
    3. Cfinite memory
    4. Dvirtual memory
22. 22In a single-user system, jobs are processed ____.

    1. Asequentially
    2. Bintermittently
    3. Crandomly
    4. Din order of longest job to shortest job
23. 23Fixed partitions are also called ____ partitions.

    1. Acomplete
    2. Bstatic
    3. Cdirect
    4. Dsized
24. 24In the fixed-partition memory management scheme, the table that the Memory Manager uses to keep track of jobs is composed of the ____.

    1. Apartition size, memory address, and status
    2. Bstatus, access, and memory address
    3. Cpartition size, status, and access
    4. Dpartition size, memory address, access, and status
25. 25The fixed partition scheme works well when ____.

    1. Aall jobs are of similar size
    2. Bjobs have different sizes
    3. Cjob sizes are not known in advance
    4. Dall jobs are under 100K
26. 26The phenomenon of less-than-complete use of memory space in a fixed partition is called ____.

    1. Adynamic fragmentation
    2. Binternal fragmentation
    3. Cexternal fragmentation
    4. Dfixed fragmentation
27. 27____ consists of fragments of free memory between blocks of allocated memory.

    1. AAn inefficient fit
    2. BIndirect partitioning
    3. CExternal fragmentation
    4. DInternal fragmentation
28. 28The ____ method keeps the free/busy lists organized by memory locations, from low-order memory to high-order memory.

    1. Afixed partition allocation
    2. Bfirst-fit memory allocation
    3. Cdynamic fit memory allocation
    4. Dbest-fit memory allocation
29. 29The goal of the ____ memory allocation algorithm is to find the smallest memory block into which a job will fit.

    1. Asmallest-fit
    2. Bfirst-fit
    3. Cdynamic-fit
    4. Dbest-fit
30. 30The release of memory space by the Memory Manager is called ____.

    1. Afragmentation
    2. Brelocation
    3. Cfree memory
    4. Ddeallocation
31. 31A(n) ____ in the busy list occurs when a memory block between two other busy memory blocks is returned to the free list.

    1. Ablank line
    2. Bnull entry
    3. Cjoined entry
    4. Dempty entry
32. 32____ of memory is performed by the operating system to reclaim fragmented sections of the memory space.

    1. ADeallocation
    2. BRedirection
    3. CCompaction
    4. DReallocation
33. 33Memory compaction is also referred to as ____.

    1. Adefragmentation
    2. Bcollection
    3. Creallocation
    4. Ddynamic allocation
34. 34Single-user, fixed partition, and dynamic partition memory schemes share unacceptable fragmentation characteristics that were resolved with the development of ____.

    1. Adeallocation
    2. Bbest-fit algorithms
    3. Crelocatable dynamic partitions
    4. Dnull entry accounting
35. 35When reading an instruction, the operating system can tell the ____ of each group of digits by its location in the line and the operation code.

    1. Afunction
    2. Bvalue
    3. Corder
    4. Dassignment
36. 36In a relocatable dynamic partition scheme, the ____ ensures that, during execution, a program won’t try to access memory locations that don’t belong to it.

    1. Arelocation register
    2. Bload register
    3. Ccompaction register
    4. Dbounds register
37. 37In a relocatable dynamic partition scheme, the ____ contains a value that must be added to each address referenced in a program so that the system will be able to access the correct memory addresses after relocation.

    1. Abounds register
    2. Bload register
    3. Crelocation register
    4. Dcompaction register
38. 38By compacting and relocating, the Memory Manager optimizes the use of memory and thus improves throughput. However, it also requires more ____ than the other memory allocation schemes discussed in this chapter.

    1. Anull entries
    2. Bsegmentation
    3. Cmain memory
    4. Doverhead
39. 39One approach to performing compaction is to do it when a certain ____ of memory becomes busy.

    1. Abyte
    2. Bpercentage
    3. Cbit
    4. Darea
40. 40The four memory management techniques presented in this chapter share the requirement that the entire program being executed must be ____.

    1. Aloaded into memory
    2. Bstored on disk
    3. Cwritten in a single language
    4. Drelocatable

Beschreibung

Computer Science Quiz am COIS 3620H - Chapter 2, erstellt von Jareed Brown am 20/10/2017.

Autor

Jareed Brown

Sprache

English

Aufrufe

0

Verlauf

Erstellt am 20 Okt 2017 · aktualisiert am 20 Okt 2017

Schlagwörter

computer science

Bewertung

Noch keine Bewertungen

Bewerte dieses Quiz

Bewerte dieses Quiz

Mehr zu Memory Management