what is function over loading?
Answers were Sorted based on User's Feedback
Answer / dibyakishore pattanaik
Same function name can be used for different purpose
depending upon three factors i.e number of arguments, type
of arguments and order of arguments in the function
declaration. This is resolved at compile time by the
compiler.
| Is This Answer Correct ? | 24 Yes | 0 No |
Answer / abhishek singh
Same Function Name with Diffrent Parameters(argument)
called function over loading.
Ex-1
public Functin Sqlquery(by val user id as string,by val
passowrd as string)
public Functin Sqlquery(by val From as string,by val To as
string)
Here u can see same name of function with different
parameters
Thanks & Regards
Abhishek singh
09709109796
abhishek_singh156@yahoo.com
| Is This Answer Correct ? | 2 Yes | 0 No |
Answer / anjana
FUNCTION OVER LOADING:
*two or more function having same name they are said to be function over loading
| Is This Answer Correct ? | 1 Yes | 0 No |
Answer / prabhakar
defining a function with a same name with differ in number of arguments r return type r tpe of arguments in one class is called funstion overloading.
for example
class base
{
public:
fun(int a,int b);
fun(char a,char b);
}
above two functions are diffrer in type of arguments.
| Is This Answer Correct ? | 1 Yes | 0 No |
Answer / deepika sharma
when two functions with same name is used in java program
then this method is called as function overloading
| Is This Answer Correct ? | 3 Yes | 6 No |
#include <stdio.h> #include <alloc.h> #include <stdlib.h> #include <conio.h> 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.
Why do we use polymorphism in oops?
how to write a java program for an output ****0 ***01 **012 *0123 01234
What is class in oop with example?
What do you mean by public, private, protected and friendly?
Is react oop?
What is a linked list?
What is a friend function & its advantage?
Can we override main method?
How to hide the base class functionality in Inheritance?
What is a class oop?
what is an instance of a class