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 the kernel, What is the kernel?          A more common definiti...

What is the kernel?          A more common definition is that the OS is the one program running at all times on the computer ,usually  known as the kernel, with all else being

Higher order predicate logic, Higher Order Predicate Logic : In the v...

Higher Order Predicate Logic : In the very first order predicate logic, we are only allowed to quantify over objects. If we are considered to allow ourselves to quantify over

What is assembly, What is assembly Assemblies are the building blocks o...

What is assembly Assemblies are the building blocks of .NET Framework applications; they variety the fundamental unit of deployment, version control, reuse, activation scoping,

How do you save data in bdc tables, How do you save data in BDC tables? ...

How do you save data in BDC tables? The data in BDC tables is saved by using the field name 'BDC_OKCODE' and field value of '/11'.

What are the advantages of segmentation, What are its advantages? How is se...

What are its advantages? How is segmentation implemented in typical microprocessors? The first benefit that memory segmentation has is that only 16 bit registers are necessary

Learning weights in perceptrons, Learning Weights in Perceptrons: Furt...

Learning Weights in Perceptrons: Furthermore details are we will look at the learning method for weights in multi-layer networks next lecture. Thus the following description o

An example of the subscriber traffic in erlangs, A subscriber makes three p...

A subscriber makes three phone calls of 3 minutes, 4 minutes and 2 minutes duration in a one hour period. Calculate the subscriber traffic in erlangs, CCS and CM. Subscriber tr

Describe functions of data flow diagram, Describe functions of data flow di...

Describe functions of data flow diagram After you have roughly designed data flow diagram, you could write a description of each function and you could describe the function i

What is page frame, What is page frame? An area in the main memory that...

What is page frame? An area in the main memory that can hold single page is called as page frame.

Explain about common addressing modes, Q. Explain about common addressing m...

Q. Explain about common addressing modes? Most of machines use a set of addressing modes. The following tree displays common addressing modes: Figure: Common Addres

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