A. | 0 or 1 |
B. | -1,0 or 1 |
C. | a character |
D. | nothing |
Option: A Explanation : Click on Discuss to view users comments. |
A. | max(max(a,b),max (a,c)) |
B. | max(max(a,b),max (b,c)) |
C. | max(b,max (a,c)) |
D. | All of these |
Option: D Explanation : Click on Discuss to view users comments. |
A. | One throw |
B. | One throw of each scale type |
C. | One throw of each programmerdefined type |
D. | As many throws of as many types as necessary |
Option: D Explanation : Click on Discuss to view users comments. |
Consider the function
find ( int x, int y)
{
return (( x < y ) ? 0 : ( x - y ));
}
Let a, b be two non-negative integers.
The call find{ a, find(a, b)} can be used to find the
A. | maximum of a, b |
B. | positive difference of a, b |
C. | sum of a, b |
D. | minimum of a, b |
Option: D Explanation : Click on Discuss to view users comments. |