difference between the run time polymorphism and compile
time poly morphism and about virtual function.
Answer Posted / sitaram
The object can be binded at the time of compiling is known
as compiletime polymorphism
The object can be binded at the time of running is known as
running polymorphism
| Is This Answer Correct ? | 10 Yes | 0 No |
Post New Answer View All Answers
Can we change load factor of hashmap?
How to do the intersection of two sorted arrays?
Why hashmap is faster than hashset?
Define a right-skewed binary tree?
Which interfaces are implemented by abstractsequentiallist?
Can binary tree have 1 child?
What can be stored in an arraylist?
Which is faster array or list?
Is red black tree balanced?
Why do we need linked list?
How do I sort hashset?
What is Storage Structures and File Structures? Can you show their relation? What are the examples of each? Thanks
What is the Difference between sax and dom parser?
Explain how to find 3rd element from end in a linked list in one pass?
Is quicksort faster than merge sort?