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

Objectives of information distribution, Objectives After studying this ...

Objectives After studying this unit you should be able to: 1. list various types of reprographic methods, 2. describe uses of various kinds of typewriters, 3. explain

Flynn’s classification, Flynn's Classification Flynn's classification i...

Flynn's Classification Flynn's classification is based on multiplicity of data streams and instruction streams observed by the CPU during program execution. Let Ds and Is  are

What is visibility give uml notation, What is visibility give UML notation?...

What is visibility give UML notation? Visibility refers to the ability of a process to reference a feature from another class and has possible valued of public, private, protec

Drawbacks of specifying parameter assignments using defparam, The disadvant...

The disadvantages of specifying parameter assignments using defparam are: -  Parameter  is  essentially specified  by  the  scope  of  hierarchies  underneath  which  it exists

Determine the applications of recursion theorem, Applications of recursion ...

Applications of recursion theorem?  1.  ATM is undecidble.  2.  Fixed point theorem.  3. MINTM is not Turing recognisable

Paging, specification of paging ram size is 12 frames

specification of paging ram size is 12 frames

Example of assembly program, Sample Program In this program we only dis...

Sample Program In this program we only display: Line                             Offset Numbers                          -----------------Source Code-----------------

What is a heap, What is a heap? A complete binary tree, every of whose ...

What is a heap? A complete binary tree, every of whose elements contains a value that is  greater than or equal to the value of every of its children is known a Heap

Re:- exam help, Hello there i have 4 exams of ICT and i am after a tutor wh...

Hello there i have 4 exams of ICT and i am after a tutor who can help me in those 4 subjects. One hour for each subjects will be good for me as i have sample papers ready for all s

Syntax and semantics for first-order logic , Syntax and Semanticsx and Sema...

Syntax and Semanticsx and Semantics for First-order logic - artificial intelligence: Propositional logic is limited  in its expressiveness: it may just represent true and false

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