difference between the run time polymorphism and compile
time poly morphism and about virtual function.

Answers were Sorted based on User's Feedback



difference between the run time polymorphism and compile time poly morphism and about virtual funct..

Answer / sangita pradhan

Compile time polymorphism(Static polymorphism) means
basically those language structure which will cause the
compiler to produce code at the compile-time. That is, the
compiler is well aware that what code is to be generated at
the compile-time itself: Ex: overloading of operators,
functions.

Run time Polymorphism(Dynamic Polymorphism)means that the
compiler is unaware what code is to be generated so it binds
the possible code and let the program decide it at the
run-time itself.Ex: the virtualness of a class member or the
entire class itself.

Is This Answer Correct ?    79 Yes 7 No

difference between the run time polymorphism and compile time poly morphism and about virtual funct..

Answer / 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

More Data Structures Interview Questions

Define internal nodes?

0 Answers  


What is the order of b tree?

0 Answers  


Differentiate among cycle, path, and circuit?

0 Answers  


Define a binary search tree?

0 Answers  


which notations are used in evaluation of arithmetic expressions using prefix and postfix forms?

0 Answers  






input function and output function in c language

2 Answers   TCS,


Is null allowed in list?

0 Answers  


Can treemap have null values?

0 Answers  


1) Program A and B are analyzed and found to have worst- case running times no greater than 150nlog2n and n2 respectively.Answer the folloWing questions if possible.. i) which program has the better guarantee on the running time,for larger values of n(n>10000) ? ii) which program has the better guarantee on the running time,for small values of n(n<100) ? iii) which program will run faster on average for n =1000 2) wRite a program to compute the number of collisions required in a long random sequence of insertions using linear probing ,quadratic probing and double hashing 3) what is the optimal way to compute A1 A2 A3 A4 A5 A6 where the dimensions of the matrices are A1:10*20 A2 : 20 * 1 A3 : 1 * 40 A4 : 40*5 A5 : 5 * 30 A6 : 30 X 15

5 Answers   KPIT,


What is the difference between Array and Arraylist?

0 Answers  


Which is faster hashmap or hashset?

0 Answers  


How treemap orders the elements if the key is a string?

0 Answers  


Categories