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 Virtual Keyword?

Answer Posted / p.madhupriya

virtual keyword we can call all the funtion of
same name used in different class by creating pointer of
the base class

Is This Answer Correct ?    0 Yes 1 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

Are polymorphisms mutations?

1166


Is abstract thinking intelligence?

1054


What is the fundamental idea of oop?

1141


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

1638


What is the real life example of polymorphism?

1177


What are the components of marker interface?

1063


write a program to find 2 power of a 5digit number with out using big int and exponent ?

2388


What is the difference between procedural programming and oops?

1137


What language is oop?

1014


What is polymorphism in oop example?

1031


what is different between oops and c++

2552


Which is better struts or spring?

1060


Where You Can Use Interface in your Project

1893


Is this job good for future? can do this job post grduate student?

2166


#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

2628