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 Dynamic Polymorphism?

Answer Posted / atul gaikwad

This polymorphism is also called as late binding.
Dynamic polymorphism can be achieved by using function overriding.
eg.for addition of numbers if we write function as
void add Numbers(int,int);
And this function is written in base class as well as derived class as it is then satisfies the function over-riding concept.

Is This Answer Correct ?    0 Yes 0 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

What is the importance of oop?

1099


What is coupling in oop?

1032


Which language is not a true object oriented programming language?

1136


Why is polymorphism needed?

1068


What is polymorphism and example?

1050


What is byval and byref? What are differences between them?

2220


What is use of overloading?

1147


What is abstraction in oops with example?

1293


Is enum a class?

1061


What are the 5 oop principles?

1127


What is constructor overloading in oop?

1137


What are oops functions?

1020


Explain virtual inheritance?

1204


Get me an image implementation program.

1985


#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

2627