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
an electrical student designed a circuit in which the impedence in one part of a series circuit is 2+j8 ohms and the impedent is another part of the circuit is 4-j60 ohm mm program

A binary tree is a special tree where each non-leaf node can have atmost two child nodes. Most important types of trees which are used to model yes/no, on/off, higher/lower, i.e.,

Q. Write down the algorithm for binary search. Which are the conditions under which sequential search of a list is preferred over the binary search?

* Initialise d & pi* for each vertex v within V( g ) g.d[v] := infinity  g.pi[v] := nil g.d[s] := 0; * Set S to empty * S := { 0 }  Q := V(g) * While (V-S)

The complexity of searching an element from a set of n elements using Binary search algorithm is   O(log n)

Difference between array and abstract data types Arrays aren't abstract data types since their arrangement in the physical memory of a computer is an essential feature of their

Using the cohen sutherland. Algorithm. Find the visible portion of the line P(40,80) Q(120,30) inside the window is defined as ABCD A(20,20),B(60,20),C(60,40)and D(20,40)

Write an algorithm to print all even numbers in descending order and draw the flowchart

Warnock's Algorithm A divide and conquer algorithm Warnock (PolyList PL, ViewPort VP) If (PL simple in VP) then Draw PL in VP, else Split VP vertically and horiz

Enumerate about the Data structure An arrangement of data in memory locations to signify values of the carrier set of an abstract data type. Realizing computational mechanis