if, else if statement in C programming, Data Structure & Algorithms


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







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
Related Questions
Implement multiple queues in a single dimensional array. Write algorithms for various queue operations for them.

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? 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

Write an algorithm for compound interest.


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 Input and output indicated by the use of terms input number, print total, output total, print "result is" x and so on.

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

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

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