Explain the working of linker, Computer Engineering

Assignment Help:

Explain the Working of Linker?

Linker as well called as link editor and binder. A linker is the program that combines object modules to form an executable program. Several programming languages allow you to write different pieces of code called modules separately. This simplifies the programming task for the reason that you can break a large program into small, more manageable pieces. Ultimately, though, you need to put all the modules together this is the job of the linker.

851_Explain the Working of Linker.png


In addition to combining modules a linker as well replaces symbolic addresses with real addresses. Consequently you may need to link a program even if it contains only one module.


Related Discussions:- Explain the working of linker

Work systems framework - information system, The Work Systems Framework - I...

The Work Systems Framework - Information System Adler writing in 1992 used the phrase 'stumbling backwards into the future' to describe the neglect organisations at that time

What is branch prediction logic, What is Branch prediction logic Bran...

What is Branch prediction logic Branch prediction logic in Pentium: Pentium microprocessor uses branch prediction logic to decrease the time needed for a branch caused by in

What is port, What is port? What are the types of port available? An I/...

What is port? What are the types of port available? An I/O interface having of circuitry needed to connect an I/O device to computer bus. One side consists of a data path with

Desirable choice for the partitioning element in quick sort, A desirable ch...

A desirable choice for the partitioning element in quick sort is First element of the list.

Classification of pipeline processors, Classification of Pipeline Processor...

Classification of Pipeline Processors In this part, we explain various types of pipelining that can be useful in computer operations. These types depend on the following factor

Prove using boolean algebra, Q. Prove using Boolean Algebra 1. AB + AC ...

Q. Prove using Boolean Algebra 1. AB + AC + BC' = AC + BC' 2. (A+B+C) (A+B'+C') (A+B+C') (A+B'+C)=A 3. (A+B) (A'+B'+C) + AB = A+B 4. A'C + A'B + AB'C + BC = C + A'B

Write heterogeneous functions, Write "heterogeneous" functions If a pro...

Write "heterogeneous" functions If a program uses simulated, dynamically allocated multidimensional arrays, it becomes possible to write "heterogeneous" functions which don't h

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

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

Cheques vs credit cards, Cheques vs Credit Cards       E-cheques:  E-ch...

Cheques vs Credit Cards       E-cheques:  E-cheques are used for business dealing in e-commerce.  Transactions of these cheques take place on Internet. In this system the elect

Minimize the logic function using NAND gate, Minimize the logic function F(...

Minimize the logic function F(A, B, C, D) = ∑ m(1,3,5,8,9,11,15) + d(2,13) using NAND gate with help of K-map. Ans. Realization of given expression by using NAND gates:  In

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