1. Start
2. Get h
3. If h < 11000 then
T=288.15+(h*-0.0065)
4. else if h < 20000 then
T=216.65
5. else if h < 32000 then
T=216.65+(h*0.001)
6. else if h < 47000 then
T=228.65+(h*0.0028)
7. else if h < 51000 then
T=270.65
8. else if h < 71000 then
T=270.65+(h*-0.0028)
9. else T= 214.65+(h*-0.0028)
Show h and T
10. Stop

Posted Date: 10/6/2012 8:03:00 AM | Location : United States

Ask an Expert

Related Discussions:- if, else if statement in C programming, Assignment Help, Ask Question on if, else if statement in C programming, Get Answer, Expert's Help, if, else if statement in C programming Discussions

Write discussion on if, else if statement in C programming
Your posts are moderated

Write your message here..

Related Questions

Multiple Queues in a single dimension array, Implement multiple queues in a... Implement multiple queues in a single dimensional array. Write algorithms for various queue operations for them.

Big o notation, This notation gives an upper bound for a function to within... This notation gives an upper bound for a function to within a constant factor. Given Figure illustrates the plot of f(n) = O(g(n)) depend on big O notation. We write f(n) = O(g(n))

What do you mean by hash clash, What do you mean by hash clash? Hashing... What do you mean by hash clash? Hashing is not perfect. Occasionally, a collision occurs when two different keys hash into the same hash value and are assigned to the same arra

Algorithm, Write an algorithm for compound interest. Write an algorithm for compound interest.

Midsquare hash method, I want to example for midsquare method I want to example for midsquare method

Graphs with negative edge costs, We have discussed that the above Dijkstra'... We have discussed that the above Dijkstra's single source shortest-path algorithm works for graphs along with non-negative edges (like road networks). Given two scenarios can emerg

Explain th term input and output- pseudocode, Explain th term input and ou... Explain th term input and output-  Pseudocode Input and output indicated by the use of terms input number, print total, output total, print "result is" x and so on.

Write the algorithm of the quick sort, Ans. An algorithm for the quick... Ans. An algorithm for the quick sort is as follows: void quicksort ( int a[ ], int lower, int upper ) { int i ; if ( upper > lower ) { i = split ( a, lower, up

Graph, For the following graph find the adjacency matrix and adjacency list... For the following graph find the adjacency matrix and adjacency list representation of the graph.

Steps of pre-order traversal, Pre-order Traversal The method of doing a... Pre-order Traversal The method of doing a pre-order traversal iteratively then has the several steps(suppose that a stack is available to hold pointers to the appropriate nodes