Interested to Buy Any Domain ? << Click Here >> for more details...
What Is a Polymorphism? How many types of polymorphism and
whats that use in application?
- 2 Answers
- 4693 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / scarlet
the ability of general request to get different result is
polymorphism.the 3 types are function overloading,operator
overloading,virtual functions.application-allows object to
show different identities and results at run time.
| Is This Answer Correct ? | 2 Yes | 1 No |
Answer / khan
Poly mean many mphorm mean form, polymorphism mean use an entity in many forms. there are two types of polymorphism
1. Static Polymorphism
2. Dynamic Polymorphism
1. Static polymorphism is also called as Compile Time polymorphism. In Static polymorphism methods are overloaded with same name but having different signatures.So it is called as method overloading.
2.Dynamic polymorphism is also called as Run Time polymorphism. In this type of polymorphism methods have the same name, same signature but different in the implementation.
In Dynamic polymorphism methods are overridden so it also called as method overriding.
| Is This Answer Correct ? | 1 Yes | 0 No |
What is property in oops?
What exactly is polymorphism?
how do u initialize the constant variables
Will I be able to get a picture in D drive to the c++ program? If so, help me out?
what is different between oops and c++
how does a main() in C++ is different from main() in C?
#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.
What is the diamond problem in inheritance?
what about you? wahat is your object? introduce your self?
1 Answers Ajmal Perfumes, TCS,
What is the real life example of polymorphism?
different types of castings
whats the difference between c and c++
STL 
