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
Indexed Sequential Files An index is inserted to the sequential file to provide random access. An overflow area required to be maintained to permit insertion in sequence. I

Explain in detail the algorithmic implementation of multiple stacks.

The most common way to insert nodes to a general tree is to first discover the desired parent of the node you desire to insert, and then insert the node to the parent's child list.

Q. Write down the recursive function to count the number of the nodes in the binary tree.    A n s . R ecursive Function to count no. of Nodes in Binary Tree is writt

need c++ algorithmic software program to derive one numerical outcome from 10 levels of variables with 135 combinations cross computed

Program will demonstrate the insertion of an element at desired position /* Inserting an element into contiguous list (Linear Array) at particular position */ /* contiguous_

/* the program accepts two polynomials as a input & prints the resultant polynomial because of the addition of input polynomials*/ #include void main() { int poly1[6][

In this sorting algorithm, multiple swapping occurs in one pass. Smaller elements move or 'bubble' up to the top of the list, so the name given to the algorithm. In this method,

Determine the Disjoint of division method A polygon is disjoint from the viewport if the x- and y-extents of the polygon do not overlap the viewport anywhere. In this case; reg

explain quick sort algorithm