Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 6186769
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 24, 20262026-05-24T01:56:41+00:00 2026-05-24T01:56:41+00:00

From wikipedia: Dynamic loading is a mechanism by which a computer program can, at

  • 0

From wikipedia:

Dynamic loading is a mechanism by which a computer program can, at run time, load a library (or other binary) into memory, retrieve the addresses of functions and variables contained in the library, execute those functions or access those variables, and unload the library from memory.

Late binding is a computer programming mechanism in which the method being called upon an object is looked up by name at run-time.


In my opinion,

A similarity is they are both mechanisms in which methods are looked up at run-time.

A difference is dynamic loading does not need to use a linker after loading the library at run-time but late binding always need a linker.

I’m not sure if I am correct, especially the difference part. I would like to learn more from your analysis.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-24T01:56:42+00:00Added an answer on May 24, 2026 at 1:56 am

    Late binding, much like overcommit, is a hack to squeeze out some extra benefit (performance / memory allowance) at the expense of correctness and possible late catastrophic failure.

    Without late binding, dynamic loading of modules will succeed only if all symbols needed for relocation can be resolved at load time, and you get a meaningful error from which you can recover if they can’t be resolved. With late binding, dynamic loading virtually always “succeeds”, then can crash your program later when the dynamic loaded module tries to reference a symbol that can’t be resolved.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

From Wikipedia : Generic programming is a style of computer programming in which algorithms
From Wikipedia, the free encyclopedia: Closure (computer science) In computer science, a closure is
From wikipedia: the cross product is a binary operation on two vectors in a
The image above is from Wikipedia's entry on AVL trees which Wikipedia indicates is
For some reason, I can't get this program to work. I've had other CS
I've read conflicting things on this. From Wikipedia: Controller Processes and responds to events,
From the wikipedia entry on NP-Complete: The easiest way to prove that some new
From http://en.wikipedia.org/wiki/AJAX , I get a fairly good grasp of what AJAX is. However,
More information from the Perl 6 Wikipedia entry Junctions Perl 6 introduces the concept
Ever wonder what wikipedia's database schema looks like? I recently read this thread from

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.