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

Soundness - artificial intelligence, Soundness - artificial intelligence: ...

Soundness - artificial intelligence: You may see in some application domains-for example automated theorem proving - that your search is "sound and complete". The soundness in

What is drive, Any data storage device. This having of  your CD-ROM drive, ...

Any data storage device. This having of  your CD-ROM drive, hard disk drive and floppy disk drive.

What is stack addressing, Q. What is Stack Addressing? In this addressi...

Q. What is Stack Addressing? In this addressing technique operand is implied as top of stack. It isn't explicit however implied. It employs a CPU Register known as Stack Pointe

Define input-output interface, Define Input-Output Interface. I/O inter...

Define Input-Output Interface. I/O interface gives a method for transferring information among internal storage and external I/O devices

Compare putchar function with the getchar function, Normal 0 fa...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Copy file from a floppy disk to the hard disk, Q. Copy file from a floppy d...

Q. Copy file from a floppy disk to the hard disk? While using a PC, often you need to copy file from a floppy disk to the hard disk or vice-versa.  For instance, you buy some s

Example of unification, Example of Unification: Let now here, assume i...

Example of Unification: Let now here, assume instead that we had these two sentences as:  knows(john,X) → hates(john, X)  knows(jack, mary)  Thus here the predicate n

Which gates are called universal gates, Q. What is Gate? Explain Basic gat...

Q. What is Gate? Explain Basic gates with truth table and necessary circuits. Q. Which gates are called Universal Gates? Why? Q. Give the Dual of the rule 17. Q. Realize

Explain about integration levels, Q. Explain about Integration Levels? ...

Q. Explain about Integration Levels? Initially only few gates were integrated consistently on a chip. This initial integration was termed as small-scale integration (SSI). With

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