# Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.

1 Page

### SpecialProblems24-25.._

Course: ME 200, Spring 2010
School: Purdue
Rating:

Word Count: 305

#### Document Preview

Problems Special for ME 200 Fall 2010 Special Problems 24 and 25 Due Friday, October 29, 2010 SP24: Consider a steam power cycle in which saturated water vapor at 25 bar (state 1) at the exit of the boiler enters a turbine and expands to 0.1 bar and 80% quality (state 2). Heat is rejected such that saturated liquid at 0.1 bar (state 3) exits the condenser. Water leaving the condenser is pumped to 25 bar and 46C...

Register Now

#### Unformatted Document Excerpt

Coursehero >> Indiana >> Purdue >> ME 200

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Problems Special for ME 200 Fall 2010 Special Problems 24 and 25 Due Friday, October 29, 2010 SP24: Consider a steam power cycle in which saturated water vapor at 25 bar (state 1) at the exit of the boiler enters a turbine and expands to 0.1 bar and 80% quality (state 2). Heat is rejected such that saturated liquid at 0.1 bar (state 3) exits the condenser. Water leaving the condenser is pumped to 25 bar and 46C (state 4) at the inlet of the boiler. (a) Draw a diagram showing all the components of the steam power cycle labeling the relevant states described above. (b) Is the Clausius inequality satisfied? Provide quantitative support for your answer. (c) Are the Carnot principles satisfied? Provide quantitative support for your answer. SP25: Consider a Carnot refrigeration cycle operating within the vapor dome. The cycle is executed in a steady-flow system using R-134a. The values of maximum and minimum temperatures in the cycle are 20C and -8C, respectively. enters R-134a as saturated vapor (state 3) and leaves as saturated liquid (state 4) in the reversible heat rejection process in the condenser; state 1 and state 2 correspond to the inlet and exit of the reversible heat addition process in the evaporator of the cycle. There is reversible, adiabatic compression from state 2 to state 3 and reversible, adiabatic expansion from state 4 to state 1. The quality of R-134 at state 1 is 17.5%. (a) Show the refrigeration cycle on T-s diagram. You must label states, show values of temperature and specific entropy, and indicate lines of constant pressure. (b) Calculate the heat addition (kJ/kg) in the cycle. (c) What is the quality (%) of R-134a at the exit (state 2) of the reversible heat addition process in the evaporator? (d) Determine the COP of the refrigeration cycle considering the relevant work and heat interactions. Find the COP of the refrigeration cycle considering that the cycle is Carnot (reversible) cycle.
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Purdue - ME - 200
Special Problems for ME 200 Fall 2010Special Problems 26, 27, and 28Due Friday, November 5, 2010SP26:A 50 kg block of iron initially at 227C is dropped into a large lake at 12C.(a) Calculate the amount of heat transfer (kJ).(b) What is the total ent
Purdue - ME - 200
Special Problems for ME 200 Fall 2010Special Problems 29, 30, and 31Due Friday, November 12, 2010SP29:Refrigerant 134a is throttled from 900 kPa and 34C to 200 kPa. Heat loss of 0.8 kJ/kgoccurs during the throttling process to surrounding at 25C.(a)
Purdue - ME - 200
Special Problems for ME 200 Fall 2010Special Problems 32, 33, and 34Due Friday, November 19, 2010SP32:Air is compressed adiabatically in steady-flow process from 1 bar and 17C to 6 bar. Theisentropic efficiency of the compressor is 82%.(a) What is t
Purdue - ME - 200
Special Problems for ME 200 Fall 2010Special Problems 35, 36, and 37Due Friday, December 3, 2010SP35:Consider a reheat Rankine cycle in which vapor at 14 MPa and 560C (state 1) isexpanded to 1.5 MPa (state 2) in a high-pressure turbine having isentro
Purdue - ME - 200
Special Problems for ME 200 Fall 2010Special Problems 38, 39, and 40Due Friday, December 10, 2010SP38:Consider a new piston-cylinder engine cycle that can be modeled as a cold air-standardcycle with the following four internally reversible processes.
Purdue - ME - 200
ME 200 Thermodynamics I Fall 2009Name: Naik (Last) Thermo Number: 1000Sameer (First)CIRCLE YOUR LECTURE BELOW Div. 1 8:30 am Naik Div. 2 10:30 am Lucht Div. 3 1:30 pm MongiaDiv. 4 3:30 pm KimDiv. 5 7:30 am HessEXAM 1INSTRUCTIONS This is a closed bo
Purdue - ME - 200
Chapter 2 (Elementary Thermodynamics: Naik) 2004Summary of Basic Thermodynamic Concepts(Types of Substances and Property Evaluation)Thermodynamics studies transformations of different forms of energy. Theconservation of energy principle along with con
Purdue - ME - 200
ME 200: Thermodynamics IExam 3 Review1Conceptual Question 1:An ideal gas flows through a turbine where thepressure is lowered at a constant temperature.Neglect kinetic and potential energy changes.Determine what happens to the following quantities
Purdue - ME - 200
Purdue - ME - 200
ME 200 Thermodynamics IName: _Fall 2009(Last)(First)Thermo Number: _CIRCLE YOUR LECTURE BELOWDiv. 1 8:30 amNaikDiv. 2 10:30 amLuchtDiv. 4 3:30 pmKimDiv. 3 1:30 pmMongiaDiv. 5 7:30 amHessFINAL EXAMINSTRUCTIONSThis is a closed book and cl
Purdue - ME - 200
ME 200 Final Exam Fall 2009 Answers1(a)Pressure Temperature(bar)(C)StateQuality(x)Specific Enthalpy Specific Entropy(kJ/kg)(kJ/kg-k)120212.412799.56.34092s0.145.810.75882007.486.340920.145.810.80852126.286.713830.145.81019
Purdue - ME - 200
ME 200 Final Exam Spring 2010 Answers1(a)StatePressure Temperature Specific Enthalpy(bar)(C)(kJ/kg)PhaseQuality (%)(If Applicable)1306003682.3SHVN/A2s0.145.812380.05SLVM91.4530.145.81191.83SL04s30194.85CLN/A(b) 0.002322(a
Purdue - ME - 200
BASIC EQUATIONS FOR ME 200(1)Work and Energy Relationsks 22(x 2 x 1 )2Wb = pdVWe = VItWrot = 2 nw cv = vdp + (V12 V22 ) / 2 + g(z1 z 2 )2KE = 0.5m ( V -V22(2)Wspring =211)PE = mg ( z 2 -z1 )Fspring = k s xFirst Law Relations and Mas
Purdue - ME - 200
Quiz86 April 2011Name:ME200 Spring 2011Part A)While completing one cycle, an irreversible heat engine receives heat input from two thermal reservoirs:1000 kJ from a thermal reservoir at 227C and 500 kJ from another thermal reservoir at 727C. Alsodu
Harvard - CS - 1
package simpledb;import java.io.*;/import java.util.ArrayList;import java.util.LinkedList;import java.util.List;/* * BufferPool manages the reading and writing of pages into memory from * disk. Access methods call into it to retrieve pages, and it
CNUAS - MATH - 111
Midterm Examination of Analytic Geometry and Matrix21 Oct 20112111. (25%) Let A =1122111121140and B =110210101011.(a) (10%) Find the reduced row echelon form of A and B by using row operations.2111122111121111
CNUAS - MATH - 111
31 3 , pp. 26-49 2.1. , : , , A. S F V , V F V S , S , S V : S V u + v S, u, v S, , F.(2.1.1), S , V S , (2.1.1); , V , ,
CNUAS - MATH - 111
4.14.24.34.44.54.64.74.8R skip 4.1 R (vector) (x1, x2)x(x1, x2) (ordered pair) x = (x1, x2) x1 x2 x (components) n n (ordered n-tuple) n n (n-sapace) R 4-2 u = (u1, u2, , un) v = (v1, v2, , vn) c
CNUAS - MATH - 111
Linear Algebra- Chapter 1 2008/09/23Linear AlgebraA set is a collection of objects, called elements of the set. If x is an element of the set A,then we write x A; otherwise, we write x A. Set Collection Set SetElementsMembers x A x A x A x A A B
CNUAS - MATH - 111
[10010CS 531200] Graph Theory: Autumn 20113.2 Homework Assignment1. (3.2.1) Using nonnegative edge weights, construct a 4-vertex weighted graph in whichthe matching of maximum weight is not a matching of maximum size.2. (3.2.2) Show how to use the Hun
CNUAS - MATH - 111
[10010CS 531200] Graph Theory: Autumn 20115.3 Homework Answer Correction1. (5.3.4)a) Prove that (Cn ; k ) = (k 1)n + (1)n (k 1).b) For H = G K1 , prove that (H ; k ) = k(G; k 1). From this and part (a),nd the chromatic polynomial of the wheel Cn K1 .
CNUAS - MATH - 111
[10010CS 531200] Graph Theory: Autumn 20113.1 Additional Homework Assignment1. (3.1.5) Prove that (G) n(G)(G)+1for every graph G.2. (3.1.9) Prove that every maximal matching in a graph G has at least (G)/2 edges.
CNUAS - MATH - 111
[10010CS 531200] Graph Theory: Autumn 20116.3 Homework Assignment1. (6.3.2) A graph G is k -degenerate if every subgraph of G has a vertex of degree atmost k . Prove that every k degenerate graph is k + 1-colorable.2. (6.3.4) Determine the crossing nu
CNUAS - MATH - 111
[10010CS 531200] Graph Theory: Autumn 20115.3 Homework Assignment1. (5.3.1) Compute the chromatic polynomials of the graphs below.2. (5.3.3) Prove that k 4 4k 3 + 3k 2 is not a chromatic polynomial.3. (5.3.4)a) Prove that (Cn ; k ) = (k 1)n + (1)n (k
CNUAS - MATH - 111
[10010CS 531200] Graph Theory: Autumn 20117.1 Homework Assignment1. (7.1.1) For each graph G below, compute (G).2. (7.1.18) Give an explicit edge-coloring to prove that (Kr,s ) = (Kr,s ).3. (7.1.19) Prove that for every simple bipartite graph G, there
CNUAS - MATH - 111
[CS 5312] Graph Theory: Autumn 20101st exam (close book)Examination Date: Oct. 25, 2010Time: 15:20-17:101. For each k &gt; 1, construct a k -regular simple graph having no 1-factor. (15%)2. Let the matrix shown below be the input of the Hungarian Algori
CNUAS - MATH - 111
[CS 5312] Graph Theory: Autumn 20101st exam (close book)Examination Date: Nov. 29, 2010Time: 15:20-17:101. Please answer the following questions. (60%)1) Why is the argument 2 in the proof of Theorem 1 correct?2) Why is the argument 4 in the proof o
CNUAS - MATH - 111
[CS 5312] Graph Theory: Autumn 2010Final Exam (close book)Examination Date: Jan. 10, 2011Time: 15:20-17:101. Please answer the following questions.1) Why is the argument 8 in the proof of Theorem 1 correct? (6%)2) Why do we need to put y at a point
CNUAS - MATH - 111
[10010CS 531200] Graph Theory: Autumn 20116.2 Homework Assignment1. (6.2.4) For each graph below, prove nonplanarity or provide a convex embedding.2. (6.2.5) Determine the minimum number of edges that must be deleted from the Petersen graph to obtain a
CNUAS - MATH - 111
[10010CS 531200] Graph Theory: Autumn 20115.1 Homework Assignment1. (5.1.2) Prove that the chromatic number of a graph equals the maximum of thechromatic numbers of its components.2. (5.1.7) Construct a graph G that is neither a complete graph nor an
CNUAS - MATH - 111
[10010CS 531200] Graph Theory: Autumn 20114.2 Homework Assignment1. (4.2.4) Prove or disprove: If P is a u, v -path in a 2-connected graph G, then there isa u, v -path Q that is internally disjoint from P .2. (4.2.12) Use Mengers Theorem to prove that
CNUAS - MATH - 111
[10010CS 531200] Graph Theory: Autumn 20114.1 Homework Assignment1. (4.1.2) Give a counterexample to the following statement, add a hypothesis to correctit, and prove the corrected statement: If e is a cut-edge of G, then at least oneendpoint of e is
CNUAS - MATH - 111
[100CS 531200] Graph Theory: Autumn 20111st exam (close book)Examination Date: Oct. 31, 2011Time: 09:30-12:001. Please answer the following questions.1) Find two errors in the proof of Theorem 1, and briey explain your reasons. (10%)2) Why is the ar
CNUAS - MATH - 111
[10010CS 531200] Graph Theory: Autumn 20115.2 Homework Assignment1. (5.2.2) Prove that a simple graph is a complete k -partite graph (k 2) if and only ifit has no 3-vertex induced subgraph with one edge.2. (5.2.5) Find a subdivision of K4 in the Grtzs
CNUAS - MATH - 111
[10010CS 531200] Graph Theory: Autumn 20116.1 Homework Assignment1. (6.1.1) Prove or disprove:a) Every subgraph of a planar graph is planar.b) Every subgraph of a nonplanar graph is nonplanar.2. (6.1.5) Prove or disprove: A plane graph has a cut-vert
CNUAS - MATH - 111
[10010CS 531200] Graph Theory: Autumn 20117.2 Homework Assignment1. (7.2.3) For n &gt; 1, prove that Kn,n has (n 1)!n!/2 Hamiltonian cycles.2. (7.2.5) Prove that every 5-vertex path in the dodecahedron lies in a Hamiltoniancycle.3. (7.2.12) Determine wh
CNUAS - MATH - 111
[10010CS 531200] Graph Theory: Autumn 20117.3 Homework Assignment1. (7.3.1) Prove that every Hamiltonian 3-regular graph has a Tait coloring.2. (7.3.3) Prove that every maximal plane graph other than K4 is 3-face-colorable.3. (7.3.5) Prove that a 2-ed
CNUAS - MATH - 111
CNUAS - MATH - 111
CNUAS - MATH - 111
CNUAS - MATH - 111
[10010CS 531200] Graph Theory: Autumn 20113.3 Homework Assignment1. (3.3.2) Exhibit a maximum matching in the graph below, and use a result in thissection to give a short proof that it has no larger matching.2. (3.3.7) For each k &gt; 1, construct a k -r
CNUAS - MATH - 111
Mycielskis Construction Mycielskis Construction: From a simple graph G,Mycielskis Construction produces a simple graph Gcontaining G. Beginning with G having vertex setcfw_v1, v2, ,vn, add vertices U=cfw_u1, u2, ,un and onemore vertex w. Add edges to
CNUAS - MATH - 111
Graph TheoryMing-Jer TsaiOutlineGraph Graph Theory GradesQ&amp;AGraphA triple consisting of a vertex set V(G), anedge set E(G), and a relation that associateswith each edge two vertices (not necessarydistinct) called its endpoints.xe1we3e6e2
CNUAS - MATH - 111
CNUAS - MATH - 111
Factor Factor: a spanning subgraph of graph G k-Factor: a spanning k-regular subgraph1-Factor of K62-Factor of K7Odd Component Odd component: a component of odd order o(H): the number of odd components of HTuttes Condition A graph G has 1-factor
CNUAS - MATH - 111
CNUAS - MATH - 111
[10010CS 531200] Graph Theory: Autumn 20113.1 Homework Assignment1. (3.1.1) Find a maximum matching in each graph below. Prove that it is a maximummatching by exhibiting an optimal solution to the dual problem (minimum vertexcover). Explain why this p
CNUAS - MATH - 111
Internally Disjoint Paths Internally Disjoint Paths : Two paths u to vare internally disjoint if they have no commoninternal vertex.Internally disjoint pathsuvCommon internal vertexuvTheorem 4.2.2A graph G having at least three vertices is 2con
CNUAS - MATH - 111
CNUAS - MATH - 111
CNUAS - MATH - 111
CNUAS - MATH - 111
CNUAS - MATH - 111
CNUAS - MATH - 111
CNUAS - MATH - 111
CNUAS - MATH - 111
CNUAS - MATH - 111
Matchings Matching: A matching in a graph G is a set ofnon-loop edges with no shared endpointsMaximal &amp; Maximum Matchings Maximal Matching: A maximal matching in a graphis a matching that cannot enlarged by adding an edge Maximum Matching: A maximum
CNUAS - MATH - 111
Theorem 6.3.1Every planar graph is 5-colorable.Proof. 1. We use induction on n(G), the number ofnodes in G.2. Basis Step: All graphs with n(G) 5 are 5-colorable.3. Induction Step: n(G) &gt; 5.4. G has a vertex, v, of degree at most 5because(Theorem 6
CNUAS - MATH - 111
Four Color TheoremEvery planar graph is 4-colorable.Proof of Four Color Theorem1. Since adding edges does not make ordinary coloringeasier, to prove the Four Color Theorem it sufficesto prove that all triangulations are 4-colorable.2. A triangulatio
CNUAS - MATH - 111