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

Evaluate - 48 - 23 by using the 2's complement method, Perform the - 48 - 2...

Perform the - 48 - 23 operations using the 2's complement method. Ans. - 48 - 23 = - 48 + (-23)     -48     =  1 1 0 1 0 0 0 0     -23     =  1 1 1 0 1 0 0 1       = -71

Compare memory mapped i/o with i/o mapped i/o, Compare memory mapped I/O wi...

Compare memory mapped I/O with I/O mapped I/O. Memory Mapped I/O Scheme: In this scheme there is only one address space. Address space is stated as all possible addresses tha

Sap system-wide security settings, You are required to review the system-wi...

You are required to review the system-wide security settings on our SAP system. The data file RSPARAM contains an extract from the client's system. You are to produce a report (

Determine the channel of common channel signalling in ss7, Common channel s...

Common channel signalling in SS7 is (A) out band control channel. (B) In band control channel. (C) Speech control channel. (D) None of the above. Ans:

Describe all elements of a state-chart diagram, a. Initial State: The first...

a. Initial State: The first or the default state the object is in. It is indicated by a solid circle. b. State: All the states an object can go in are mentioned in this. It is

Routines which handle dynamic processes, Q. Routines which handle dynamic p...

Q. Routines which handle dynamic processes? number of routines which handle dynamic processes:  int pvm_joingroup( char *group ) Enrolls calling process in a na

Function makestk-predicate function emptystk, 1. Create the following ADTs....

1. Create the following ADTs. (a) Write the constructor function makestk, predicate function emptystk and mutator functions pushstk and popstk: i. makestk returns a new stack

Distinguish between combinational & sequential logic circuit, Distinguish b...

Distinguish between combinational logic circuits and sequential logic circuits. Ans: Combinational logic circuits:- (i) Outputs only depend upon present state of the i

Drawbacks to resolution theorem, Drawbacks to resolution theorem: Thus...

Drawbacks to resolution theorem: Thus the underlining here identifies some drawbacks to resolution theorem proving: It only works for true theorems that can be expresse

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