Chapter 4: Loaders & Linkers

Topics in this Chapter:

● What is a Loader?
o Basic Functions of a Loader
● What is a Linker?
o Functions of a Linker
● General schematic of Linking / Loading function
● Loading Schemes:
o Translate-and-go Loader
o Absolute Loader
o Relocation and Relocating Loaders
▪ Relocation Concept
▪ Relocation Bits
▪ Types of Programs w.r.t Relocation
▪ Relocating Loader
o Direct Linking Loader
● Loader Design Options
● Chapter Summary
● Expected Viva Questions

4.1 What is a Loader?

Exam Questions:
Q) What is a Loader? Explain the four basic functions of any loader. (Dec ‘04 [IT]
– 5M).

Q) What are the basic functions of a Loader? (May ‘05 [Comps] – 4M

[compulsory question]).

Q) What is a Loader? Explain its functionality and components in detail. (Dec ‘05
[Comps] – 10M).

Dr.Sharvari Govilkar TE COMP A Page 1

Loader is a system program that prepares an object program for execution, places it into
the main memory and initiates the execution.

Dr.Sharvari Govilkar TE COMP A Page 2

Following figure depicts the general working of a Loader:

Source
Program
4.1.1 Basic Functions of a Loader
Assemble
Object
r Code
A Loader performs four basic functions:

1. Allocation: Loader calculates the program size and co-ordinates Loader

with the OS to
get adequate space allocated in the main memory for the program

Final Machine
Code
2. Linking: A single program may include references between its different
Object Code
segments and may refer to external program data and subroutines as well.

Secondary Storage Memory

An important job of Loader is to resolve these inter-segment and inter-program
references (i.e.Fig.
link4.1:
them) and generate
General a single
Schematic continuous piece of code that
of a
can be directlyLoader
executed.

3. Relocation: As per its need, the OS may move (i.e. relocate) one or more
segments of the program from one are of the memory to another.

When the program gets relocated, instructions referring to code or data in these
relocated segments must also be changed. Such instructions which must be
changed when relocation occurs are called as “address sensitive” instructions.

The job of OS is to adjust addresses of all such address-sensitive instructions,

when OS relocated one or more program segments.

(Note: Relocation function must be carried out every time the OS relocates the
program segments; Relocation is often performed by a Linker for the Loader).

Dr.Sharvari Govilkar TE COMP A Page 3

 4. Loading: The Loader finally places the executable code in the main memory and
initiates the execution by transferring control to the starting location of program
in the memory.

4.2 What is Linker?

A Linker is a system program that resolves all address references within and among
several object modules of a program and combines them to produce a single
“monolithic” .exe file.

A Linker essentially performs linking and relocation functions for a Loader.

4.2.1 Functions of a Linker

A Linker basically performs following three functions:

1. Linking Object Files: A linker links multiple relocatable object files used by a
program and generates a single .exe file that can be loaded and executed by the
Loader.

2. Resolving External References : While linking those object files, the linker
resolves inter-segment and inter-program references to generate a single
continuous executable file.

3. Relocate Symbols: A linker relocates symbols from their relative locations in

input object files to new absolute positions in the executable file.

4.3 General Schematic of Linking / Loading

The following figure gives a general idea of a Linking / Loading scheme:

Dr.Sharvari Govilkar TE COMP A Page 4

 Obj: Main
Main

Obj: Search
Linker
Searc
h Assemble
r
Parent
Program Obj:
SQRT

SQRT

Obj:
COUNT
External Program 1

COUNT .exe

External Program 2

Final Executable
Program goes into Loader
Memory

Fig. 4.2: General Schematic of a Linking /

Loading

Dr.Sharvari Govilkar TE COMP A Page 5

4.4 Loading Schemes

There are 4 types of basic loading schemes:

1. Assemble (or Compile) – and – Go Loader

2. Absolute Loader
3. Relocating Loader
4. Direct Linking Loader (DLL)

4.4.1 Assemble (or Compile) – and – Go Loader

The Loader function here is simply an extension of Assembler. (Sometimes it’s also
called as Translate-and-Go Loader).

Following figure depicts the working of Assemble-and-Go Loader:

Source
Program Assemble

Loader

Final Machine
Code

Memory

Fig. 4.3: Assemble-and-Go Loader

Dr.Sharvari Govilkar TE COMP A Page 6

The address of storage in memory is decided by programmer and stays fixed (i.e. static).

The Loader simply takes each line of machine code generated by Assembler and places
it into the main memory at a fixed location. This process continues until all of machine
code has been placed into the memory.

Finally, the Loader initiates the execution by transferring control of execution to the
starting location of the program.

As seen in the figure, the Assemble-and-Go Loader does not generate an object file.

Advantage of such loading scheme is that is a very simple scheme to implement as the
only function of Loader is to place the object code in the memory and initiate the
execution.

Disadvantages are:
1. Since no object file is generated in this scheme, the program needs to be
assembled for every run, even if no change is made to the source code. Due to
this the execution time is high.

2. Relocation would require the programmer to change the start address of the
program (by using START pseudo-opcode) and re-assemble it in order to relocate
it. So, relocation is a tedious and time-consuming job.

3. Also, this loading scheme cannot handle multiple program segments and
subroutines in the program; the entire program must be written as a single piece
of code.

4.4.2 Absolute Loader

In this scheme, the assembler generates the object file which can be stored on
secondary storage instead of being directly loaded into the memory.

Dr.Sharvari Govilkar TE COMP A Page 7

Along with each object file, the assembler also gives information about starting address
and length of that object file.

Here, the programmer does the allocation and linking functions explicitly for the Loader
i.e. he must know where the program must be placed in the memory and must link the
subroutines explicitly and manually (by using the available instructions appropriately).

The loader simply does the task of loading the object file into the memory and initiating
the execution.

Following figure indicates general schematic of an Absolute Loader:

Segment
One major
1 Object
advantage of this scheme is that since the 1
assembler does not always reside
in the main memory, it leaves more main memory (core)
Start space
Addr:available to the user.
100
Assembler 100
Segment
2 Length: 40 Object 1
But its disadvantages are:
140
1. The programmer must do memory management since he explicitly does
Segment
Object 2
the allocation and linking for the Loader. 200
3
Start Addr:
200 Object 2
2. Relocation is a tedious and time-consuming 240 time for
job as every
Length: 40
relocation, the program must be re-assembled.
300

Object 3 Object 3
4.4.3 Relocation
Start Addr: 340
Exam Question: 300
Length:
Q) Explain the Relocation and Linking Concepts (May 40
‘04 [Comps] – 10M).
(For Linking, refer sections 4.1.1 and 4.2)

Main
Memory
Fig. 4.4: Absolute
Loader

Dr.Sharvari Govilkar TE COMP A Page 8

Relocation means replacing symbolic references or names of entities (names of
variables, procedures, subroutines etc.) with actual usable addresses in the memory
before running the program.

Relocation is first done at compile-time typically by a Linker. During execution, one or

more segments of the program may be placed to some other memory area (i.e.
relocated) by the OS. In such case, the loader performs relocation before the program is
executed.

An .exe file contains following information:

1. Machine code and data with relative address
2. Relocation Bits
3. Length of file

4.4.3.1 Relocation Bits

When relocation is to be performed, the ‘new’ starting location of the program is added
to relative address of all relocatable bytes.

To identify which byte of object file is relocatable and which is not, relocation bits are
used.

Typically, for each byte of machine code, we have a single bit that is set to 1 if it is
relocatable (i.e. if it’s an address-sensitive entity) or 0 if it is not relocatable.

There are two ways in which these relocation bits can be added to the object file in 2
ways:

1. At the end of each instruction – As shown in the following example:

Relative Instruction Machine Code Relocation Bits

Address Byte 1 Byte 2 Byte 1 Byte 2

Dr.Sharvari Govilkar TE COMP A Page 9

 00 LOAD A 08 07 0 1
02 ADD B 01 08 0 1
04 STORE C 09 09 0 1
06 STOP 12 - 0 -
07 A DB 09 07 - 0 -
08 B DB 18 06 - 0 -
09 A DW 0000 00 00 0 0

As we can see in above code, opcodes and data definitions are not relocatable since
they do not include any address-sensitive entities; only symbolic references, to variable
names or subroutine / procedure names (not in the example), are relocatable.

One drawback with this way to supplying relocation information is that storage and
retrieval becomes complex.

2. By using Relocation Bit Mask

A relocation bit is associated with each byte of object code and all such bits form a
relocation bit mask. This mask is appended at the end of machine code.

So, to retrieve this mask, length of machine code should be supplied in the header.

For example: Machine code of same source code as in the previous example can
now be added with relocation bit as follows:

Machine
Code 08 07 01 08 09 09 12 09 18 00 00
Relocation 0 1 0 1 0 1 0 0 0 0 0
Bit Mask

The advantage here is that storage and retrieval of relocation bits is simplified.

Dr.Sharvari Govilkar TE COMP A Page 10

4.4.3.2 Types of Programs w.r.t Relocation

Based on relocation, programs can be broadly classified as:

1. Non-relocatable Programs – These are static programs whose memory area is

fixed at the time of coding and remains static i.e. cannot be changed thereafter.
(For example, the OS)

2. Relocatable Programs – These programs can be relocated to different memory

areas as and when memory storage is needed by the OS.

With the help of relocation information in the .exe file, the linker (at compile
time) or relocating loader (at run time) will perform the functions needed to
relocate the program.

3. Self-relocatable Programs – Such programs have small part of code (or

subprograms) embedded in them which handle the operations needed to
relocate the program.

When OS relocates some (or all) part of code, control is transferred to the
“relocating subprogram” which adjusts addresses of its address sensitive
portions of the code.

4.4.3.3 Relocating Loaders

Exam Question:
Q) Differentiate Absolute Loader vs. Relocation Loader stating who performs
which function in the particular loading scheme. (Dec ‘04 [IT] – 5M).

Dr.Sharvari Govilkar TE COMP A Page 11

In all the previous loading schemes, allocation and linking had to be done explicitly and
manually by the programmer. Also, relocation would require re-assembling of all
segments (even if one segment is changed).

To overcome this problem, a general class of relocating loaders was introduced which
allows multiple procedure segments and one data segments shared by all.

For each program, the assembler produces following information to be used by the
Relocating Loader:

1. Assembled version (machine code) of all segments

2. Inter-segment Reference (if needed)
3. Relocation Information
4. Length of Program
5. Transfer Vector

Transfer Vector (TV) is a global table for entire program; it contains list of external
subroutines referenced by the program.

Structure of Transfer Vector as follows:

Subroutine Name Transfer Instruction

. .
. .
. .

For each subroutine, the transfer vector contains a transfer instruction that branches
the execution flow to the start address of subroutine in the memory.

The Assembler replaces call to each subroutine in the program with a branch to its
corresponding entry in the Transfer Vector.

Dr.Sharvari Govilkar TE COMP A Page 12

After machine code and TV have been loaded into the memory, the loader loads all the
subroutines in the memory.

Source Object Code Transfer

Program Vector
. . SQRT Memory Location
So, for executing
. the call to a subroutine, .first its corresponding entry in TV is referred
of SQRT
and from there,. a branch is taken to actual
. location of the subroutine in the main
. . Memory Location
memory. SEARCH
. . of SEARCH
CALL SQRT
.
This “double-branch” is needed because. TV is generated byCOUNT Memory
Assembler, but the Location
of COUNT
. .
assembler doesn’t know beforehand where the subroutines will be loaded in the
CALL SEARCH
memory. . .
. . Filled by Loader
CALL COUNT
So, it simply replaces the call to subroutines with a branch to its corresponding location
in TV and Loader fills the corresponding entry in TV with the actual address where
Fig.
Done by 4.5
subroutine is stored in the memory. Assembler

Fig. 4.5: Relocating

In short, we can say a relocating loader uses:
Loader
● Program Length – For Allocation
● Relocation Bits – For performing Relocation
● Transfer Vector (TV) – For Linking (by “double-branch”)

Use of Transfer Vector has following advantages for relocating loader:

1. Any change in program size can be taken care of dynamically

2. Only the required subroutines can be kept in main memory rather than keeping
all subroutines at the same time.

But the relocating loader has some disadvantages too:

Dr.Sharvari Govilkar TE COMP A Page 13

1. The Transfer Vector (TV) based approach is suitable for resolving external subroutine
linkages and not references to external program data.

2. If there are several subroutine linkages in the program, size of TV (and therefore the
object code) increases. So, it occupies more space, as TV is always needed in the main
memory.

4.4 Direct-Linking Loader (DLL)

Exam Questions:
Q) Explain the design of Direct-Linking Loader (DLL) (Dec ‘04 [Comps] – 10M,
May ‘06 [Comps] – 10M, Dec ‘06 [Comps] – 10M, May ‘07 [Comps] – 10M, Dec ‘07
[Comps] – 10M, Dec ‘07 [IT] – 10M, June ‘08 [Comps] – 10M, Dec ‘08 [Comps] –
10M).

Q) Describe the working of Direct-Linking Loader (DLL). Explain in detail the

various data structures used. (May ‘04 [IT] – 10M, Dec ‘05 [IT] – 10M, Dec ‘04 [IT]
– 9M).

Direct-Linking Loader is the most widely used loading scheme; it belongs to the class of
relocating loaders i.e. it performs all four main functions of a loader (allocation, linking,
relocation, loading)

It has two significant advantages over the general Relocating Loader scheme:
1. It allows use of multiple program segments as well as multiple data
segments.

2. External program references i.e. references to data (and subroutines)

defined in other programs can also be resolved.

The Assembler generates following information for every program segment and passes
on to the DLL:

Dr.Sharvari Govilkar TE COMP A Page 14

 1. Machine Code
2. Relocation Information
3. Length of each segment
4. PUBLIC Table – includes name, type and (relative) definition addresses of
symbols defined by a current program that can also be referred by other
program segments (i.e. symbols specified by PUBLIC keyword).

Structure of PUBLIC Table:

Symbol Name Type Definition Address

. .
. .
. .

5. EXTERN Table – includes name, type and (relative) usage addresses of symbols
used by a current program that has been defined externally in some other
program (i.e. symbols specified by EXTERN keyword).

Structure of EXTERN Table:

Symbol Name Type Usage Address

. .
. .
. .

(Note that all above mentioned entities are generated by Assembler separately
for each program segment)

The addresses in these PUBLIC and EXTERN keywords are all relative to the starting
location from where their respective program is loaded in the main memory.

Dr.Sharvari Govilkar TE COMP A Page 15

DLL will concatenate machine code of all program and data segments and generate a
single “load module”.

So, the basic tasks of DLL can be given as follows:

1. Replacing the relative addresses in PUBLIC and EXTERN tables with their actual
(offset) locations within the concatenated load module.

2. While object modules are being concatenated, DLL also replaces all external
references in machine code of the program with their actual (offset) locations
within the load module.

3. Finally, load the concatenated load module.

DLL works on a Two-pass Algorithm:

Purpose of Pass 1 is to construct a Global External Symbol Table (GEST) by gathering

all externally referenced symbols.

Purpose of Pass 2 is to use GEST and generate a single concatenated load module.

4.4.1 Basic Data Structures of DLL

DLL uses following data structures:

1. PUBLIC and EXTERN Tables for every program segment (supplied by Assembler)
2. Global External Symbol Table (GEST)

The structure of GEST is as follows:

Symbol Name Type Usage Address Definition Address

Dr.Sharvari Govilkar TE COMP A Page 16
 . .
. .
. .

GEST is simply a global collection of external references that gathers all symbols
from all PUBLIC an EXTERN tables into one table.

3. Intermediate Load Module (ILM) – Pass 1 of DLL dumps machine code of all
input object modules into ILM and reads only PUBLIC and EXTERN tables of each
program segment to construct GEST. These ILM and GEST are then passed onto
pass 2 which actually performs relocation.

Apart from these data structures, DLL uses following pointers:

1. GEST_PTR – To keep track of location being read from GEST (in pass 1) or
being written into GEST (in pass 2).

2. Location Counter (LC) – To keep a track of location being written into the
Intermediate Load Module i.e. ILM (in pass 1) or into main memory (in pass
2).

4.4.2 Pass 1 of DLL Algorithm

Initializations in Pass 1:
1. Open the Source Object Files in Read mode and Intermediate Load Module (ILM)
in Write mode.
2. Setup GEST.
3. Initialize GEST_PTR to first entry of GEST.

Working of DLL Pass 1:

Step 1: After initializations, read the main module
Step 2: Read the length of module

Dr.Sharvari Govilkar TE COMP A Page 17

 Copy all code statements to Intermediate Load Module (ILM) till end of machine
code
Step 3: Read PUBLIC table
3.1 🡪 Read a record of PUBLIC table.
3.2 🡪 Search the symbol in GEST.
3.3 🡪 If found, add current LC to definition address and update the new
(modified) definition address in the corresponding GEST entry.
3.4 🡪 If not found, first copy its entry from PUBLIC table to GEST, then add
current LC to definition address and update the new definition address in
corresponding GEST entry; only the usage address is not updated here.
3.5 🡪 Is END of PUBLIC table reached?
If NO, then Increment GEST_PTR and repeat from Step 3.1.
If YES, then continue.
Step 4: Read EXTERN table
4.1 🡪 Read a record of EXTERN table.
4.2 🡪 Search the symbol in GEST.
4.3 🡪 If found, add current LC to usage address and update the new
(modified) usage address in the corresponding GEST entry.
4.4 🡪 If not found, first copy its entry from EXTERN table to GEST, then add
current LC to usage address and update the new usage address in
corresponding GEST entry; only the definition address is not updated here.
4.5 🡪 Is END of EXTERN table reached?
If no, then increment GEST_PTR and repeat from Step 4.1.
If yes, then continue.
Step 5: Is END of all source files (i.e. END of input object module) reached?
If NO, then repeat from Step 2.
If YES, then go to Pass 2

4.4.3 Flowchart for Pass 1 of DLL

X
4.4.4 START
Pass 2 :ofPass 1
DLL Algorithm

Dr.Sharvari Govilkar TE COMP A Page 18

Read a record from
Initializations EXTERN table
 Read ‘Main’ Object
File
R NO
Symbol
Read length of the object present in
file 2:
Initializations in Pass GEST?
1. Open the Intermediate Load Module (ILM) in Read mode and Final Load Module
Copy entry
Copy all machine from EXTERN
(FLM) in Write mode.
code statements to YES
table to GEST
ILM
2. Re-initialize GEST_PTR to first entry of GEST.

Add Current LC
Read next record to Usage
Working
from of DLL Pass
PUBLIC 2:
table Address
Step 1: Copy all machine code statements from ILM to FLM.
Step 2: Read GEST Update Usage
Address in GEST
🡪 Read a record of GEST entry
NO
Symbol
🡪 Copy definition address of the record to all usage addresses of current
present in X
GEST entry.
GEST?
End of
🡪 Is END of GEST reached?
Copy entry EXTERN
If NO, then increment
from GEST_PTR
PUBLIC and repeat from Step 2.1/ Table?
YES NO
table
If YES, then initiate to GEST
execution R to start of final load
by transferring the control
module in the memory. YES
Add Current LC
to Definition
(Note that if control is transferred to some otherRead Next in the memory
program
Address NO Object File
from the loader, it means that the loader itself has stopped executing. So, no
need of explicitly mentioning STOP in the algorithm).
End of
Update Definition PUBLIC
Address in GEST End of
4.4.5 Flowchart for Pass 2 of DLL Table? all
entry
object
NO files?
YES Fig. 4.7: DLL Pass
START : Pass YES 2
4.5 Loader Flowchart
2 Design Options
X
Fig. 4.6: DLL Pass 1 Flowchart GOTO : Pass 2
Copy all machine code
Loading schemes describe
statements from ILMhow to the functions of a loader can be accomplished; Loader
FLM
Design Options refers to the timing of using a loader.
Increment
Read record of GEST_PTR
Loader can be used as per following design options:
GEST
NO
Copy definition address
of the record to all of its YES
END
usage addresses of
Dr.Sharvari Govilkar TE COMP A Page 19
GEST
? Initiate
Execution
 1. Linking Loader – It performs linking and relocation at run time and loads the
linked program directly into memory for execution; no “executable image” is
generated.
It is more suitable in a program development and testing environment (where
size of programs being executed is comparatively small), as it avoids steps of
reading and writing the linked program into an executable image.

2. Linkage Editor – It performs all linking and (some) relocation prior to load time
and writes the linked program into an “executable image”.
This approach is suitable when the program has to be re-executed many times
without being re-assembled.
(The basic difference between Linking Loader and Linkage Editor is analogous to
the difference between Assemble-and-Go Loader and Absolute Loader)

3. Dynamic Linking – Linking function is performed at run time and facilities of the
OS are used to load and link subprograms at the time when they are first called.
Dynamic Linking is often used to allow several executing programs to share one
copy of a subroutine through a library; all supporting run-time routines common
to a set of executing programs (e.g. programs of same language) can be packed
into a single “library” of subroutines, which is shared by all programs.
Dynamic Linking avoids the necessity of loading the entire library for each
execution; subroutines in the library can be loaded only when required.

4.5.1 Comparison: Linking Loader vs. Linkage Editor

Q) Differentiate between Linking Loader and Linkage Editor (May ‘06 [Comps] –
Following
8M, Dec figure describes
‘07 [Comps] the difference between a Linking Loader and a Linkage Editor:
– 10M).

Object
Object Program(s)
Program(s)

Dr.Sharvari Govilkar TE COMP A Page 20

Linkage
Linking Editor
Loader Library
 Memory
The differences between a Linking Loader and a Linkage Editor can be described in detail
as follows: Executabl
e Image

Relocating
Loader

Memory

Fig. 4.8: Linking Loader vs. Linkage

Editor

Dr.Sharvari Govilkar TE COMP A Page 21

 Linking Loader Linkage Editor
1. A linking loader performs linking and A Linkage Editor performs linking
relocation at run time and directly loads the and (some) relocation operations
linked program into the memory. prior to load time and writes the
linked program to a file for later
execution.
2. It resolves external references and performs External references are resolved
library searching every time the program is and library searching is performed
executed. only once
3. Executable image is not generated; the linked The linked program is written into
program is directly loaded into memory. an executable image, which is later
given to a relocating loader for
execution.
4. It is more suitable for program development It is suitable when the program has
and testing environment where the size of to be re-executed many times
the program is comparatively smaller. without being re-assembled.

Example: Direct-Linking Loader Example: MS-DOS Linker

4.5.2 Bootstrap Loader

A Bootstrap (or Boot) Loader is a program that resides in the computers EPROM, ROM,
or other non-volatile memory that is automatically executed by the processor when the
computer is turned on.
The bootstrap loader reads the Master Boot Record (MBR) from the boot sector (which
is the first sector) of hard drive.
The MBR provides information about the drive's partitions and also tells the computer
where to find and how to load the operating system.
So, in short, a Bootstrap Loader loads the MBR from first sector of the hard drive and
the MBR causes the OS to get loaded into main memory from the secondary memory.

Dr.Sharvari Govilkar TE COMP A Page 22

4.6 Chapter Summary

● Loader is a system program that prepares an object program for execution,

places it into the memory and initiates the execution.
● Four basic functions of a Loader are:
o Allocation – allocate space in the memory for object programs.
o Linking – Resolve symbolic references between object files.
o Relocation – Address all address sensitive location to correspond to the
allocated space.
o Loading – Physically place the machine code and data into the memory.

● Linker is a system program that resolves all address references within and
among several object modules of a program and combines them to produce a
single .exe file.
● Functions of a Linker include:
o Linking Object Files.
o Resolve inter-segment and inter-program references.
o Relocate symbols

● Loading Schemes:

⮚ Assemble-and-Go Loader – Assembles each machine code statement and

loads them one-by-one directly into the main memory. Loader does only
the basic loading function.

⮚ Absolute Loader – Assembler generates object files and loader loads

them into the main memory. Programmer does the allocation and linking
for the loader.

⮚ Relocating Loader – Here, Relocation means replacing symbolic

references with actual usable memory addresses.
Relocating Loaders is a general class of loaders that takes care if
relocation problem. It uses relocation bits to decide Relocatability of

Dr.Sharvari Govilkar TE COMP A Page 23

 symbols and Transfer Vector (TV) for linking (by “double-branch”). For
calling a subroutine, it branches to corresponding entry in TV and from
there another branch is taken to actual location. It allows multiple
program segments but only one data segment shared by all.

⮚ Direct-Linking Loader (DLL) – It is a relocation loader that allows multiple

program segments as well as multiple data segments.
Assembler passes PUBLIC and EXTERN tables for each program segment.
It uses a two-pass approach. In Pass 1, it collects all externally referenced
symbols from PUBLIC and EXTERN tables into GEST (Global External
Symbol Table). In Pass 2, it uses GEST to resolve all external references
and generates a single concatenated “load module”.

● Loader Design Options – It is concerned with timing of using the loader function.
o Linking Loader generates a linked program and loads it directly into
memory for execution; no “executable image” is generated here.
o Linkage Editor writes the linked program into an .exe file which can then
be loaded into the memory and executed repeatedly.
o Dynamic Linking – The linking function is performed at run time and
facilities of the OS are used to load and link subprograms at the time
when they are first called.
● Bootstrap Loader loads the MBR from first sector of the hard drive and the MBR
causes the OS to get loaded into main memory from the secondary memory.

4.7 Expected Viva Questions

Q.1.) Explain what a Loader does to “prepare” a program for execution.

(Hint: Explain Relocation and Linking functions in short)
Q.2.) What is the difference between a Linker and a Loader?
(Hint: Linker can be called as a sub-function or subset of Loader, often
implemented separately from [and executed before] the loader)

Dr.Sharvari Govilkar TE COMP A Page 24

Q.3.) What is the basic difference between Assemble-and-Go Loader and Absolute
Loader?
Q.4.) How are relocation loaders different from Assemble-and-Go and Absolute
Loaders?
Q.5.) What is DLL? How is it different from general class of relocating loaders?
Q.6.) What is Dynamic Linking? What is a “Bootstrap” loader?

Dr.Sharvari Govilkar TE COMP A Page 25