Study your flashcards anywhere!

Download the official Cram app for free >

  • Shuffle
    Toggle On
    Toggle Off
  • Alphabetize
    Toggle On
    Toggle Off
  • Front First
    Toggle On
    Toggle Off
  • Both Sides
    Toggle On
    Toggle Off
  • Read
    Toggle On
    Toggle Off

How to study your flashcards.

Right/Left arrow keys: Navigate between flashcards.right arrow keyleft arrow key

Up/Down arrow keys: Flip the card between the front and back.down keyup key

H key: Show hint (3rd side).h key

A key: Read text to speech.a key


Play button


Play button




Click to flip

18 Cards in this Set

  • Front
  • Back
a number that designates a particular memory location
a main memory allocation scheme that considers all free blocks and selects for allocation the one that will result in the least amount of wasted space
Best Fit Memory Allocation
a register used to store the highest location in memory legally accessible by each program
Bounds Register
process of collecting fragments of available memory space into contiguous blocks by moving programs and data in a computer's memory or disk. Also called Garbage Collection.
process of freeing an allocated resource, whether memory space, a device, a file, or a CPU.
a memory allocation scheme in which jobs are given as much memory as they request when they are loaded for processing, thus creating their own partitions in memory.
Dynamic Partitions
a situation in which the dynamic allocation of memory creates unusable fragments of free memory between blocks of busy, or allocated, memory.
External Fragmentation
a non-preemptive process scheduling policy that handles jobs according to their arrival tine; the first job in the READY queue is processed first.
First Come First Served (FCFS)
a main memory allocation scheme that searches from the beginning of the free block list and selects for allocation the first block of memory large enough to fulfill the request.
First Fit Memory Allocation
a memory allocation scheme in which main memory is sectioned off, with portions assigned to each job.
Fixed Partitions
a situation in which a fixed partition is only partially used by the program; the remaining space within the partition is unavailable to any other job and is therefore wasted.
Internal Fragmentation
a unit of memory or storage space equal to 1,024 bytes or 2 to the tenth power
the unit that works directly with the CPU and in which the data and instructions must reside in order to be processed. Also called Random Access Memory (RAM), Primary Storage, or Internal Memory.
Main Memory
an empty entry in a list
Null Entry
a memory allocation scheme in which the system relocates programs in memory to gather all of the empty blocks and compact them to make one block of memory that's large enough to
Relocatable Dynamic Partitions
1) the process of moving a program from one area of memory to another; or (2) the process of adjusting address references in a program, by either software or hardware means, to allow the program to execute correctly when loaded in different sections of memory.
a register that contains the value that must be added to each address referenced in the program so that it will be able to access the correct memory address after relocation.
Relocation Register
another term for fixed partitions
Static Partitions