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

Explain the term heuristics searching, (a) Discuss the role played by Busin... (a) Discuss the role played by Business Intelligence Systems in giving companies strategic advantage. (b) Explain the term heuristics searching . (c) With the use of an appr

Explain thread, Thread By changing the NULL lines in a binary tree to ... Thread By changing the NULL lines in a binary tree to special links known as threads, it is possible to perform traversal, insertion and deletion without using either a stack

Creation of a linked list, Program: Creation of a linked list In the ne... Program: Creation of a linked list In the next example, wewill look to the process of addition of new nodes to the list with the function create_list(). #include #includ

Four applications or implementation of the stack, Q. Write down any four ap... Q. Write down any four applications or implementation of the stack.                                     Ans. (i)       The Conversion of infix to postfix form (ii)

Searhing and sorting algorithms, how I can easily implement the bubble,sele... how I can easily implement the bubble,selection,linear,binary searth algorithms?

Determine the greatest common divisor, Determine the greatest common diviso... Determine the greatest common divisor (GCD) of two integers, m & n. The algorithm for GCD might be defined as follows: While m is greater than zero: If n is greater than m, s

Make adjacency matrix for un-directed graph, Q. Describe the adjacency matr... Q. Describe the adjacency matrix and make the same for the given undirected graph.    Ans: The representation of Adjacency Matrix: This representation consists of

Recursion, differences between direct and indirect recursion differences between direct and indirect recursion

C++, #What is the pointer #What is the pointer

Multiplication, Implement multiple stacks in a single dimensional array. Wr... Implement multiple stacks in a single dimensional array. Write algorithms for various stack operations for them.