Difference between non-relocatable self relocatable programs, Computer Engineering

Assignment Help:

Differentiate between non-relocatable self 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 self-relocating program can execute into any area of memory. It is very significant in time-sharing operating system where load address of a program is likely to be different for various executions.


Related Discussions:- Difference between non-relocatable self relocatable programs

Explain about combinational circuits, Q. Explain about Combinational Circui...

Q. Explain about Combinational Circuits? Combinational Circuit is one of the models for parallel computers. In interconnection networks, different processors correspond with ea

Basic software, Basic Software: The basic software is also referred to...

Basic Software: The basic software is also referred to as utilities. Basic software packages are available for performing operations such as data entry and validation, sorting

Operating system, what is batch system?how the disadvantage of batch system...

what is batch system?how the disadvantage of batch system are overcome in multi-programming operating system?also describe how multi-programmed operating system is milestone in dev

Explain about interrupt procedure, Q. Explain about Interrupt Procedure? ...

Q. Explain about Interrupt Procedure? The interrupt procedure uses request header to conclude the function requested by DOS. It also performs all functions for device driver. T

Explain characteristics in java for e-commerce applications, Explain the ch...

Explain the characteristics and utilities available into java that makes it appropriate for developing e-commerce applications. Following are the characteristics and utilities

Find the conversion time & conversion rate of A/D converter, Find the conve...

Find the conversion time of a Successive Approximation A/D converter which uses a 2 MHz clock and a 5-bit binary ladder containing 8V reference. What is the Conversion Rate? An

Average number of instructions, Consider a processor with a 4-stage pipelin...

Consider a processor with a 4-stage pipeline. Each  time a conditional branch is encountered, the pipeline must be flushed (3 partially completed instructions are lost). Determine

Unification, Unification: As just above this we have said that the rul...

Unification: As just above this we have said that the rules of inference for propositional logic detailed in the last lecture can also be required in first-order logic. Moreov

What is a 3-d accelerator, What is a 3-D Accelerator?  3-D Accelerator...

What is a 3-D Accelerator?  3-D Accelerator is no magic technology. It is merely an accelerator chip which has built-in ability to perform the mathematics and algorithms neede

Recurrence relation, Take the following recurrence relation consider only f...

Take the following recurrence relation consider only for n = 2k for integers k ≥ 1: T(2) = 9, and for n ≥ 4, T(n) = n + T(n /2). Three students were working together in a stu

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