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 function overloading..?

Answer Posted / achal ubbott

Here i tell how function overloading works. The point is
name mangling. Each c++ compiler follows an algorithm
called Name Mangling algorithm. Its job is to create
different symbols for functions. The mangled name of the
function would depend upon number,type and order of
function arguments. You can see these mangled names in the
assembly code. But C does not mangle function Names.
Unfortunately there is no ISO standard for name mangling.
So most c++ compilers do that in a different way

Is This Answer Correct ?    1 Yes 2 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

What is polymorphism what is it for and how is it used?

1023


What is cohesion in oop?

1067


What is encapsulation in oop?

1060


Why do we use class?

1098


#include #include #include #include void insert(struct btreenode **, int); void inorder(struct btreenode *); struct btreenode { struct btreenode *leftchild; struct btreenode *rightchild; int data; }; main() { struct btreenode *bt; bt=(struct btreenode *)NULL; int req,i=1,num; clrscr(); printf("Enter number of nodes"); scanf("%d",&req); while(i<=req) { printf("Enter element"); scanf("%d",&num); insert(&bt,num); i++; } inorder(bt); } void insert(struct btreenode **sr, int num) { if(*sr==NULL) { *sr=(struct btreenode *)malloc (sizeof(struct btreenode)); (*sr)->leftchild=(struct btreenode *)NULL; (*sr)->rightchild=(struct btreenode *)NULL; (*sr)->data=num; return; } else { if(num < (*sr)->data) insert(&(*sr)->leftchild,num); else insert(&(*sr)->rightchild,num); } return; } void inorder(struct btreenode *sr) { if(sr!=(struct btreenode *)NULL) { inorder(sr->leftchild); printf("\n %d",sr->data); inorder(sr->rightchild); } else return; } please Modify the given program and add two methods for post order and pre order traversals.

3771


What are the three main types of variables?

1130


What is difference between oop and pop?

1172


What is polymorphism give a real life example?

1039


Give an example where we have to specifically use C programming language and C++ programming language cannot be used?

1641


What is interface in oop?

1135


Why we use classes in oop?

1048


Why is object oriented programming so hard?

1090


What is encapsulation example?

1066


Why is there no multiple inheritance?

1009


What are classes oop?

1041