Diffrentiate between non-relocatable & relocatable programs, Computer Engineering

Assignment Help:

How non-relocatable programs are different from relocatable programs?

Non relocatable program: It is one that cannot be made to execute in any type of area of storage other than the one designated for this at the time of its translation or coding.

Relocatable program: It form is one that contains a program and relevant information for its relocation. By using this information this is possible to relocate the program to execute from a storage area after that the one designated for this at the time of its translation or coding.


Related Discussions:- Diffrentiate between non-relocatable & relocatable programs

Scope of expert system, The scope of the experts system is very limite...

The scope of the experts system is very limited. It cannot work outside the field it is being used. The users knowledge is required to adjust to new situation. To reduce

What is meant by refreshing of the screen, What is meant by refreshing of t...

What is meant by refreshing of the screen?  Some method is required for maintaining the picture on the screen. Refreshing of screen is completed by keeping the phosphorus glowi

What is view, What is View? A simple view can be thought of as a subset...

What is View? A simple view can be thought of as a subset of a table. It can be used for retrieving data, as well as updating or deleting rows. Rows updated or deleted in the v

Explain difference between dynamic and static binding, Explain difference b...

Explain difference between Dynamic and static binding. Dynamic and static binding: Dynamic binding is a binding performed after the execution of a program has immediately beg

Find out the hexadecimal sum, Find the hex sum of (93) 16 + (DE) 16 ? Ans...

Find the hex sum of (93) 16 + (DE) 16 ? Ans. Hex Sum of (93) 16 + (DE) 16 Convert Hexadecimal numbers 93 and DE to there binary equivalent demonstrated below:- Hence (9

Iterative deepening search, Iterative Deepening Search: So, breadth fi...

Iterative Deepening Search: So, breadth first search is always guaranteed to find a solution (if one exists), actually it eats all the memory. For the depth first search, ther

Implementation of 3 line to 8 line decoder, Implement the following functio...

Implement the following function using a 3 line to 8 line decoder. S (A,B,C) =   ∑ m(1,2,4,7) C (A,B,C) =  ∑ m ( 3,5,6,7)         Ans. Given function S (A,B,C) = m (1,2,4,7)

Determine the workarounds in multiple inheritances, What are several issues...

What are several issues for selecting best workarounds in multiple inheritances? Some restrictions methods are used. Use two approaches of delegations, which is an implementati

Or-introduction rule, Or-Introduction : Thus if we know about one thin...

Or-Introduction : Thus if we know about one thing is true, and also we know that a sentence when there thing is in a disjunction is true. Here if we consider example, like we

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