Match List I with List II
| List I | List II |
|---|---|
| A. Overloading | I. Since function call is resolved during run time, the execution is slow. |
| B. Early binding | II. Since function call is resolved during compilation time, the execution is much faster. |
| C. Overriding | III. Supports compile-time polymorphism. |
| D. Late Binding | IV. Supports run-time polymorphism. |
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. A-III, B-II, C-IV, D-I
Explanation
Overloading supports compile-time polymorphism (A-III). Early binding resolves the call at compile time, so execution is faster (B-II). Overriding supports run-time polymorphism (C-IV). Late binding resolves the call at run time, so execution is slower (D-I).More Programming Languages and Computer Graphics questions
- Consider the following statements for XML (Extensible Markup Language): A. The number of tags decreases and users can define their own tags…
- Match List I with List IIList I List II A. Oblique Projection I. When the direction of projection is so chosen that the lines perpendicular…
- What will be the output of the following C programming code:void main() { int *i, a=12, b=2, c; c = (a=a+b, b=a/b, a=a*b, b=a-b); i = &c; p…
- Only legal pointer operations: A. pointer + number → pointer B. pointer − number → number C. pointer + pointer → pointer D. pointer − point…
- Consider the operators used in C Programming given below: A. && B. += C. >> D. >= E. ?: Choose the correct order of precedence of the opera…
- Consider the conditional statement if (m == 20 − 10 || n > 10). The order of execution of the following operations is A. == B. − C. || D. >…