Answer Posted / subhashish sen

I think the Question is wrong !!!!!The Question would have
been like this..

Why Function Overloading does not depend on the return type?

Ans : Function Overloading does not depend on the return
type but it depends on number, type and order of arguments
of function..

In this case Overloading Possible
-----------------------------------
Ex : int fun(int a,int b){}
int fun(int x,float y){}

In this case Overloading is not possible
---------------------------------------
int fun(int a,int b){}
float fun(int x,float y){}

The reason is..while invoking these function its not
necessary to get the return value always,means if you don't
get the return value it also works...But this wont be
possible for no,type or order of arguments..

If you need further clarification reply me....

Where You Can Use Interface in your Project

1939

---

What is the full form of oops?

1247

---

Write a program to implement OOPS concepts such as inheritance, polymorphism, friend function, operator overloading?

4805

---

Write a program to compute for numeric grades for a course. The course records are in a file that will serve as the input file. The input file is in exactly the following format: Each line contains a student's first name, then one space, then ten quiz scores all on one line. The quiz scores are in whole number and are separated by one space. Your program will take it input from this file and sends it output to a second file. The data in the output file will be exactly the same as the data in the input file except that there will be one additional number (of type double) at the end of each line. This number will be the average of the student's ten quiz scores. Use at least one function that has file streams as all or some of its arguments.

3132

---

What is pure oop?

1168

---

What is difference between inheritance and polymorphism?

1077

---

What is oops concept with example?

1084

---

what type of question are asked in thoughtworks pair programming round ?

2269

---

#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

2688

---

which feature are not hold visual basic of oop?

2237

---

What is difference between abstraction and encapsulation?

1136

---

How can you overcome the diamond problem in inheritance?

1228

---

What is interface in oop?

1187

---

What are main features of oop?

1180

---

What is class and object with example?

1225

---