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

Explain dns, DNS is The horizontal naming system.

DNS is The horizontal naming system.

Linux, Explain about unix file system architecture

Explain about unix file system architecture

Explain cause effect graphing, Explain cause effect graphing . Cause-ef...

Explain cause effect graphing . Cause-effect graphing is a test case design method that gives a concise representation of logical conditions and corresponding actions.  The

Explain about the value chain for a manufactured product, Explain about the...

Explain about the value chain for a manufactured product. The products sold in shops and purchased for use within organizations are the result of a complicated web of relations

Illustrate the logical view of a system, Illustrate the Logical view of a s...

Illustrate the Logical view of a system The Logical view of a system serves to describe existence and meaning of key abstractions and mechanism which form problem space, or wh

Why does ftp use two standard ports, Why does FTP use two standard ports wh...

Why does FTP use two standard ports whereas other protocols, in general use only one port? Justify. File transfer protocol uses a control connection just to send commands and r

Speed up factor, Remember, the value of α is between 0 and 1. Now, let us p...

Remember, the value of α is between 0 and 1. Now, let us put some values of α and compute the speed up factor for increasing values of number of processors.  We get that the S(N) k

Determine the boolean expression using k-map, Reduce the following equation...

Reduce the following equation using k-map Y = BC‾D‾ + A‾BC‾D + ABC‾D + A‾BCD + ABCD Ans. Multiplying the first term with (A+A') Y = A'BC'D' + ABC'D' + A'BC'D + ABC'D + A'BCD +

Compare pre-emptive and non-preemptive scheduling policies, Compare pre-emp...

Compare pre-emptive and non-preemptive scheduling policies. We preempt the currently executing process in preemptive scheduling. In non-preemptive we permit the current process

Design a logic circuit, Ask questDesign a logic circuit with 4 inputs A, B,...

Ask questDesign a logic circuit with 4 inputs A, B, C & D that will produce output ‘1’ only whenever two adjacent input variables are 1’s. A & D are also to be treated as adjacent,

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