Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...

What is late bound function call and early bound function
call? Differentiate.

Answer Posted / svlsr2000

Functions are boud to there address so that they could be
executed. if the address of the functions are known durning
compile time the compiler binds it, this kind of binding is
known as compile time binding or early binding. Where as
when we dont know which function needs to be exucuted
during compile time (as in case of dynamic polymorphism),
compiler uses mechaninsm of virtual table and binds the
function address during runtime. this is known as runtime
binding or late binding.

Is This Answer Correct ?    24 Yes 1 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

Is abstract thinking intelligence?

1046


What are the types of abstraction?

1071


hi, this is raju,iam studying b.tech 2nd year,iam want know about group1 and group2 details, and we can studying without going to any instutions? please help me.

1949


Which type does string inherit from?

1101


There are two base class B1,B2 and there is one class D which is derived from both classes, Explain the flow of calling constructors and destructors when an object of derived class is instantiated.

1990


What does sksksk mean in text slang?

2112


What is overloading in oops?

1156


What is and I oop mean?

1195


What is multilevel inheritance explain with example?

1143


#include #include #include #include void insert(char *items, int count); int main(void) { char s[255]; printf("Enter a string:"); gets(s); insert(s, strlen(s)); printf("The sorted string is: %s.\n", s); getch(); return 0; } void insert(char *items, int count) { register int a, b; char t; for(a=1; a < count; ++a) { t = items[a]; for(b=a-1; (b >= 0) && (t < items[b]); b--) items[b+1] = items[b]; items[b+1] = t; } } design an algorithm for Insertion Sort

2615


What is overriding in oops?

1102


write knight tour problem which is present in datastructure

2649


What are different oops concepts?

1057


Why is oop better than procedural?

1074


Is data hiding and abstraction same?

1016