How an absolute partition scheme using re-locatable code is similar to a re-locatable partition scheme? Is there may difference between them?
Both the schemes use a single, partition. In both schemes, program code may be
loaded anywhere in memory. However, in an absolute partition scheme, the
addresses in the program code must be adjusted and bound to the actual memory
addresses at the time of program is loaded into memory. In the re-locatable
partition scheme, each address is bound to the actual memory location during
execution at the time the memory location is referenced.