Register

GATE Overflow | Mock GATE | Test 1 | Question: 15

• edited by
1,230 views
3 votes
3 votes

The task of adjusting programs so that they may be placed in arbitrary core locations is called relocation. This task is often performed by the relocating loaders. Given below are the tasks performed by the relocating loaders. Identify the correct sequence in which the tasks need to be performed.
1. Resolve symbolic references between object decks
2. Allocate space in memory for the program
3. Physically place the machine instructions and data into the memory
4. Adjust all address dependent locations

  1. $1 \: 2 \: 3 \: 4$
  2. $2 \: 1 \: 3 \: 4$
  3. $3 \: 1 \: 4 \: 2$
  4. $2 \: 1 \: 4 \: 3$
• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1.7k
views
1 answers
4 votes
Ruturaj Mohanty asked Dec 27, 2018
1,664 views
GATE Overflow | Mock GATE | Test 1 | Question: 57
Which of the following statements on Viable Prefixes is incorrect?A viable prefix does not extend past the right end of the handleFor any context-free grammar, ... a parser has viable prefixes on the stack no parsing error has been detected
User Avatar
692
views
1 answers
0 votes
Ruturaj Mohanty asked Dec 27, 2018
692 views
GATE Overflow | Mock GATE | Test 1 | Question: 32
A sequential search operation is performed on an array $A$ for the key value of $'x'$ (ignore quotes). Consider the following piece of assembly language code that uses back patching ... from top to bottom?R T U PR U T PP U T RP T U R
User Avatar
9.0k
views
1 answers
28 votes
Kathleen asked Sep 25, 2014
9,019 views
GATE CSE 1998 | Question: 2.15
Faster access to non-local variables is achieved using an array of pointers to activation records called a stackheapdisplayactivation tree
User Avatar
Link Copied!