COMPUTER SCIENCE AND ENGINEERING
COMPILER DESIGN
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Can’t be made to execute in any are of storage other than the one designated for it at the time of its coding or translation
|
|
|
Consists of a program and relevant information for its relocation
|
|
|
Can be processed to relocate it to a desired area of memory
|
|
|
All the above
|
Detailed explanation-1: -Explanation: A relocatable program form is one which consists of a program and relevant information for its relocation. Using this information it is possible to relocate the program to execute from a storage area then the one designated for it at the time of its coding or translation.
Detailed explanation-2: -Definitions of relocatable program. a program that can be located in different parts of memory at different times. type of: computer program, computer programme, program, programme. (computer science) a sequence of instructions that a computer can interpret and execute.
Detailed explanation-3: -In computer programming, a self-relocating program is a program that relocates its own address-dependent instructions and data when run, and is therefore capable of being loaded into memory at any address. In many cases, self-relocating code is also a form of self-modifying code.
Detailed explanation-4: -Basically, “absolute” mode means that the code and RAM variables will be placed exactly where you tell the assembler it will be, while “relocatable” means the assembler builds code chunks and specifies RAM needs that can be placed wherever the linker finds room for them.
Detailed explanation-5: -A relocatable expression with a value that depends only on where a single control section is located in memory is called simply relocatable. A relocatable expression with a value that depends other run-time considerations is called complexly relocatable.