Interested to Buy Any Domain ? << Click Here >> for more details...
9. Read the function conv() given below
conv(int t)
{
int u;
u=5/9 * (t-32);
return(u);
}
What is returned
(a) 15 (b) 0 (c) 16.1 (d) 29
- 2 Answers
- 9586 Views
- TCS, I also Faced
- E-Mail Answers
Answer Posted / ankush deshmukh
0 is the answer
The division of 5/9 is 0.5
Then 0.5*(t-32) is -31.5
So roundup of this is 0.
| Is This Answer Correct ? | 2 Yes | 0 No |
Post New Answer View All Answers
what is difference between input parameter and output parameter.
how do i add a column dynamically in a table by using java application?
what is the certificates in biztalk?
How will you prove that java swing is multithreaded?
what is technical system, business system, logical system in sap pi7.0
How do you initialize a static member of a class with return value of some function?
Difference between views and index in sas programming
In an customer exit (include Z) program, only the last record is getting fetched. The exit is getting called after pressing save button. What to write for fetching the first record ? Before saved to a SAP table how can i call all these records in an itab in the exit ?
in cobol,wat is the difference in using 'set index in occurs clause' ....and 'occurs depending-on clause'
My Qualification is MCA.My interview is on 5th may.They may ask q as------AS u r MCA...Why u r not tring anywhere else? What can be the ans?
What is the merger sort principle and its time complexity.
For a binary tree with n nodes, How many nodes are there which has got both a parent and a child?
Hi..Am done with my Masters recently..Am planning to learn TIBCO.. could anyone suggest me about how the job market will be and Is there any course necessary to learn prior to Tibco..i mean any prerequisite. I dnt have any knowledge on PL/SQL thats it... Plz suggest me in a best way...
You are given some denominations of coins in an array (int denom[])and infinite supply of all of them. Given an amount (int amount), find the minimum number of coins required to get the exact amount. What is the method called?
Given an array all of whose elements are positive numbers, find the maximum sum of a subsequence with the constraint that no 2 numbers in the sequence should be adjacent in the array. So 3 2 7 10 should return 13 (sum of 3 and 10) or 3 2 5 10 7 should return 15 (sum of 3, 5 and 7)
