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 polymorpsim? what are its types?

Answer Posted / sandhya.v

when a base class has to be changed with some minor or
major changes, it can be done through two methods . The
first method is using the keyword "new" and the second
method is by using "Override",The concept of using this is
called of olymorphism , The types are ad hoc polymorphism
and parametrized polymorphism..

Is This Answer Correct ?    0 Yes 0 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

How to hide the base class functionality in Inheritance?

1185


How Do you Code Composition and Aggregation in C++ ?

25599


What is polymorphism explain?

1312


What are the benefits of oop?

1342


Why do we use encapsulation in oops?

1083


What is encapsulation in oops?

1067


what is the drawback of classical methods in oops?

3428


What is a superclass in oop?

1217


What is abstract class in oop?

1061


Why is oop better than procedural?

1132


What is the problem with multiple inheritance?

1228


What is oops with example?

1098


What is a null tree?

1192


Prepare me a program for the animation of train

2531


#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

2681