Register

UGC NET CSE | December 2013 | Part 3 | Question: 15

• recategorized by
8,890 views

1 Answer

0 votes
0 votes

Ans is C

Ad-hoc polymorphism allows functions with the same name act differently for each type

In programming languages, ad hoc polymorphism is a kind of polymorphism in which polymorphic functions can be applied to arguments of different types, because a polymorphic function can denote a number of distinct and potentially heterogeneous implementations depending on the type of argument(s) to which it is applied.

User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
2 answers
1
go_editor asked Jul 27, 2016
1,109 views
UGC NET CSE | December 2013 | Part 3 | Question: 16
Match the following with respect to the programming language $:$ ... $\text{a-ii, b-iv, c-i, d-iii}$ $\text{a-ii, b-iii, c-iv, d-i}$
Match the following with respect to the programming language $:$$\begin{array}{} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{Structured language} &...
User Avatar
2 votes
2 votes
1 answer
2
go_editor asked Jul 27, 2016
1,941 views
UGC NET CSE | December 2013 | Part 3 | Question: 14
Which of the following concepts means adding new concepts to a program as it runs? Data hiding Dynamic loading Dynamic typing Dynamic binding
Which of the following concepts means adding new concepts to a program as it runs?Data hidingDynamic loadingDynamic typingDynamic binding
User Avatar
1 votes
1 votes
1 answer
3
Sanjay Sharma asked Jun 20, 2016
1,344 views
UGC NET CSE | December 2013 | Part 3 | Question: 34
______ comparisons are necessary in the worst case to find both the maximum and minimum of n numbers. 2n – 2 n + floor (lg n) – 2 floor ($\frac{3n}{2}$) – 2 2 lg n – 2
______ comparisons are necessary in the worst case to find both the maximum and minimum of n numbers.2n – 2n + floor (lg n) – 2floor ($\frac{3n}{2}$) – ...
User Avatar
3 votes
3 votes
2 answers
4
go_editor asked Jul 29, 2016
2,047 views
UGC NET CSE | December 2013 | Part 3 | Question: 75
Possible thread states in Windows 2000 operating system include: Ready, running and waiting Ready, standby, running, waiting, transition and terminated Ready, running, waiting, transition and terminated Standby, running, waiting, transition and terminated
Possible thread states in Windows 2000 operating system include:Ready, running and waitingReady, standby, running, waiting, transition and terminatedReady, running, waiti...
User Avatar
Link Copied!