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

What is called when a star connected intermediate exchange, A star connecte...

A star connected intermediate exchange is known as a? A star connected intermediate exchange is termed as a Hub exchange.

Explain concurrent sharing, Explain Concurrent sharing. Concurrent s...

Explain Concurrent sharing. Concurrent sharing: Some number of programs may share a file concurrently. While this is the case, this is essential to ignore mutual interferen

Uniform path cost search - artificial intelligence, Uniform Path Cost Searc...

Uniform Path Cost Search - artificial intelligence: A breadth first search will find the solution with the shortest path length from the initial state to the goal state. In fa

K-nearest neighbor for text classification, Assignment 2: K-nearest neighbo...

Assignment 2: K-nearest neighbor for text classification. The goal of text classification is to identify the topic for a piece of text (news article, web-blog, etc.). Text clas

Define security protocols used for e-commerce applications, Define various ...

Define various security protocols used for e-commerce applications. The e-commerce systems of today are composed of very many components as like: a commerce server, client soft

How to select valid lines for secondary list, How to select valid lines for...

How to select valid lines for secondary list? To stop the user from selecting invalid lines, ABAP/4 offers various possibilities. At the end of the processing block END-OF-SEL

Pipeline, where can I find detailed explanation of 6 stage and 7 stage pipe...

where can I find detailed explanation of 6 stage and 7 stage pipeline ??

Address phase timing - computer architecture, Address phase timing: On...

Address phase timing: On the rising edge of clock 0, the initiator notes IRDY # and FRAME# both high, and GNT# low, so it drives the command, address and asserts FRAME# in tim

Define bcd, Define BCD. A binary code that distinguishes between 10 ele...

Define BCD. A binary code that distinguishes between 10 elements must contain at least 4 bits, but 6 combinations will remain unassigned. Numerous dissimilar codes can be obtai

Overfitted the data, Overfitted the data: Moreover notice that as time...

Overfitted the data: Moreover notice that as time permitting it is worth giving the training algorithm the benefit of the doubt as more as possible. However that is, the error

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages