Difference b/w non-relocatable and relocatable programs, Computer Engineering

Assignment Help:

Differentiate between non-relocatable and relocatable programs.

A non-relocatable program is one which cannot be executed in any memory area other than the area starting at its translated origin. For illustration a hand coded machine language program.

A relocatable program is one which can be processed to relocate it to a selected area of memory. For illustration an object module. The difference among a relocatable and a non-relocatable program is the availability of information relating to the address sensitive instructions in this. A self-relocating program is the one which can perform the relocation of its own address sensitive instructions.


Related Discussions:- Difference b/w non-relocatable and relocatable programs

What is divide overflow, What is divide overflow?  The division operati...

What is divide overflow?  The division operation might result in a quotient with an overflow. Overflow happens when the length of the registers is finite and will not hold a nu

An example of load-store optimization using expression trees, Give LOAD-STO...

Give LOAD-STORE optimization based on expression trees for the expression (A+B)/(C-D). LOAD-STORE optimization based on expression trees for the expression (A+B)/(C-D) is given

Evaluate expression by using convention , Evaluate x = A ‾.B + C ( ) usin...

Evaluate x = A ‾.B + C ( ) using the convention A = True and B = False. Ans. Simplify given expression x = A ‾ .B + C ( ) as = A ‾ B + C (A ‾ + D ‾ ) (As = A ‾ +D ‾ usin

Explain differences between folded and non-folded network, Explain differen...

Explain differences between folded and non-folded network. Folded network: While all the inlets/outlets are connected to the subscriber lines, the logical connection shows as

Explain documentation libraries, The documentation rules are almost exactly...

The documentation rules are almost exactly the similar as for Scripts "Documenting scripts". Although from a technical point of view it is feasible to place measures in libraries i

Explain sequential sharing, Explain Sequential sharing. Sequential s...

Explain Sequential sharing. Sequential sharing: In this technique of sharing, a file can be shared through only one program at a time, it is file accesses by P1 and P2 are

Computer graphics, source code for IMPLEMENTATION FOR ELECTROMAGNETIC INDUC...

source code for IMPLEMENTATION FOR ELECTROMAGNETIC INDUCTION

What are sequential algorithms, What are Sequential Algorithms? The cen...

What are Sequential Algorithms? The central assumption of the RAM model is that instructions are implemented one after   another, one operation at a time. Accordingly, algorith

# real life business subsystem, Is production, marketing, personal, materia...

Is production, marketing, personal, material, finance are the real life business subsystems? if yes, then how?

What is a deadlock, What is a Deadlock? Deadlock is a situation, in th...

What is a Deadlock? Deadlock is a situation, in that processes never complete executing and system resources are tied-up, preventing another job form starting. If the resou

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd