2 Pages

brae 236 lab 1 bryce

Course: BRAE 433, Fall 2011
School: Cal Poly
Rating:
 
 
 
 
 

Word Count: 704

Document Preview

DaFonte 9/22/10 BRAE Bryce 236 Lab 1 Irrigation System Tour Station 1: Border Irrigation As a group we were asked to use a stopwatch and tape measure to measure and record the time it takes for water to advance down the field once one of the borders was turned on. At time = 0 seconds the border was turned on. We observed the following data: Distance Down Field (ft) Time (min:sec) 10 :45 20 1:35 30 2:40 40 3:56...

Register Now

Unformatted Document Excerpt

Coursehero >> California >> Cal Poly >> BRAE 433

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.
DaFonte 9/22/10 BRAE Bryce 236 Lab 1 Irrigation System Tour Station 1: Border Irrigation As a group we were asked to use a stopwatch and tape measure to measure and record the time it takes for water to advance down the field once one of the borders was turned on. At time = 0 seconds the border was turned on. We observed the following data: Distance Down Field (ft) Time (min:sec) 10 :45 20 1:35 30 2:40 40 3:56 50 5:20 Station 2: Furrow Irrigation The group was asked to set up the pipe by opening two gaps to two finger-widths each. We attached a dissipation sock to one gap and turned the system on. After the system ran for a couple minutes, we noticed that the furrow that was being hit by the non-dissipated gap of water was deteriorating as the high velocity water from the pipe was eroding the side of the furrow. However, the gap that had the dissipation sock connected to it dispensed water to the furrow that had a much lower velocity, thus reducing the amount of erosion greatly. We then turned the system, and put a dissipation sock on the second gap in the pipe for the second furrow. A dam was placed in one furrow a short distance from the head of field. The water in the dammed furrow rose to a higher level up the sides of the furrow, thus allowing the watering of the higher sections of the furrows. This creates less run off, and the longer the water sits in the furrow, the higher the furrow gets watered. The main differences between furrow irrigation and border strip irrigation is that the border strips are about 10-15 feet wide, while the furrows are only about 1 foot wide, thus specifying more precisely where you want the water to go. It is possible to use furrow irrigation to irrigate 1-inch during a single event by the use of a dam. Each person in the group also had to get a siphon to work. The group then had to measure the flow rate from one siphon tube by filling up a five gallon bucket and timing how long that process took. The the siphon filled five gallon bucket in 51 seconds, thus resulting in a flow rate of 5.88 gpm. Siphon tubes work by creating a vacuum in the tube that uses gravity to force the water from a higher location through the siphon tube and out to a location lower than the entrance of the tube. Station 3: Drip Irrigation The group then had to turn on a drip hose and not emitter spacing. We then measured the flow rate of 1 emitter. One emitter filled a container with 102 ml of water in 10 minutes, thus using dimensional analysis, the following flow rate can be found: (102 ml/10 min) x (60 min/1 hr) x (0.000264 gal/ml) = .16158 = .162 gal/hr We then had to cut apart one inline emitter and one online emitter. The inline emitters have the hoses, tapes and openings built into the tape. Once cutting open the tape, the locations of each of these was easily seen. The openings have a diameter of .5 mm, and the water coming in needs to be filtered to the opening no bigger than 1/10 the size of the opening. The online emitters are manufactured separately and then stuck into the hose through holes that are created by the user. The inside of the manufactured piece looks like a maze that the water must travel through and then make its way out the exit hole. This is possibly used to lower the velocity of the water entering the emitter to a speed that just drips out of the exit hole. A rough sketch of each is shown below, including arrows pointing where water enters and exits the emitter, as well as the path the water takes through the emitter. Station 4: Sprinkler Irrigation We had to set up and turn on a line of sprinklers, which included 4 separate pipes with one sprinkler located on each, and an end cap for the end pipe. We then measured the flow rate from one sprinkler by recording the time it took to fill up a five gallon bottle. The five gallon bottle took 1 minute and 3 seconds to fill, which results in a flow rate from one sprinkler of 4.76 gpm.
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:

Cal Poly - BRAE - 433
RPMTorque(Ft-lbs)0.2517850.517760.751766117551.2517471.517351.751720217102.2517002.516752.7516573162618001750170016501600155015000.250.50.7511.251.51.7522.252.52.753
Cal Poly - BRAE - 433
Bryce DaFonte9/22/10BRAE 236 Lab 1Irrigation System TourStation 1: Border IrrigationAs a group we were asked to use a stopwatch and tape measure to measure and record the time ittakes for water to advance down the field once one of the borders was t
Cal Poly - BRAE - 433
Bryce DaFonteBRAE 23610/13/10Lab 3 - Basic Pipeline HydraulicsThe lab assignment for this basic pipeline hydraulic lab was to create a simulated PVCwater supply using the PVC pipe and fittings supplied. We had certain guidelines for theassembly, how
Cal Poly - BRAE - 433
Bryce DaFonte10/29/10BRAE 236Field Trip Lab Write-upDuring the lab onPoly campus forWednesday October 20, 2010 the BRAE 236 lab departed Calan all day field trip of tours to various farms, ranches, facilities and locationsaround Monterey and Salin
Cal Poly - BRAE - 433
Soil 1CumulativeTimeDepth Infmin1210143642506012018030040050070012001440in0.050.080.260.340.690.770.881.011.692.283.354.154.96.319.4310.81Soil 2CumulativeIntakeRatein/hr2.14961.79921.19031.09180.85680.82350
Cal Poly - BRAE - 433
Bryce DaFonteBRAE 236HW 2211/17/2010Given: The following soils data.Find:a) The depth infiltrated curve equationb) K and n for each soilc) Intake rate curve and equation for each soild) Which soil would be better suited for border strip irrigatio
Cal Poly - BRAE - 433
Bryce DaFonteBRAE 236HW 23-2412/1/2010Energy Cost Efficiency EvaluationInitial Costs for Changes:New Pump: $30,000New Motor: $5,000DU to 0.95: $1,000/ac = 80 AC * 1,000 = $80,000Cost to switch to time of use: $300Total Initial Cost: $116,300The
Cal Poly - BRAE - 433
Level GroundValveP u/ sP d/ sP outQP u/ sP d/ spsipsigpsgpmfeetfeetLavender252312 psi1.557.553.1Orange2310.554 sec/ 5 gal5.653.124.3Blue21447 sec/ 5 gal6.448.59.3Note: the readings for the blue nozzle are too low becaus
Cal Poly - BRAE - 433
Level GroundValveLavenderOrangeBlueP u/spsi252321P d/spsi2310.54P outgps12 psi54 sec/5 gal47 sec/5 galQgpm1.55.66.4P u/sfeet57.553.148.5P d/sfeet53.124.39.3Level SystemElevated System12121010PP re srsur e+ esE
Cal Poly - BRAE - 433
Pumping Plant Efficiency EvaluationFlowRateQ (gpm)23002000180014001200800500100LiftL (ft)11.611.611.611.611.611.611.611.6DischargeTDHHeadH (ft)(ft)1.1612.84.6216.232.343.941.653.246.257.864.776.383.294.894.7106.3
Cal Poly - BRAE - 433
Discussion Questions:1. What are the basic criteria for selecting the proper pump for a project?The first step is to determine the required pressure and flow rate for the project. Thesecond step is to find the pump that provides the required pressure a
Cal Poly - BRAE - 433
Pumping Plant Efficiency EvaluationFlowRateQ (gpm)23002000180014001200800500100LiftL (ft)11.611.611.611.611.611.611.611.6DischargeHeadH (ft)1.164.6232.341.646.264.783.294.7TDH Output(ft)Hp12.87.4116.28.1943.919.95
Cal Poly - BRAE - 433
Source: MCWRADate: May 2006Note: The scale andconfiguration of allinformation shown hereonare approximate and arenot intended as a guide fordesign or survey work.Source: MCWRADate: May 2006Note: The scale andconfiguration of allinformation sho
Cal Poly - BRAE - 433
WaterH2OQUIZHow many people are on Earth?a)25,000b)36,000,000c) 296,000,000d) 6,500,000,000Satellite Photo of the Earth at NightAnswer: 6,500,000,000QUIZHow many gallons of water to make aMcDonalds Quarter Pounder?a)b)c)d)1606006,000
Cal Poly - BRAE - 433
BRAE 433Example Problem from Class for a 2-Way TableNon-Reinforced Concrete Beamininl ength of beam (ft)ftpsi (compressive strength)psi (modulus of rupture)in#/ft3 - pcf#/ft#/ft#ft-#P = (M wL^2/8)/(L/4)#(MSteps1 Create the equations for
Cal Poly - BRAE - 433
BRAE 433ABCDEFGHIJKL1) Given:Concrete with unit weight from 80 lb/ft^3 to 150 lb/ft^3 and f'c from 3000 psi to 7000 psi.Required:Develop a spreadsheet that will display in a table the values of Ec. Round Ec to the nearest ksi.1234580
Cal Poly - BRAE - 433
BRAE 433HW 810/7/2011Bryce DaFonte 11) Given:Concrete with unit weight from 80 lb/ft^3 to 150 lb/ft^3 and f'c from 3000 psi to 7000 psi.Required:Develop a spreadsheet that will display in a table the values of Ec. Round Ec to the nearest ksi.Ec =
Cal Poly - BRAE - 433
Bryce DaFonte11/9/11BRAE 433Lab 3/7The purpose of having two different labs for this report was to determine the 28 day fc valuethat we have been using throughout the duration of the class. During the lab on 10/3/2011 (Lab3) the class split into thr
Stanford - CS - 161
Comprehensive Exam: Algorithms and Concrete MathematicsAutumn 2000This is a one hour closed-book exam and the point total for all questions is 60.All of the intended answers may be written within the space provided. If necessary, you mayuse the back o
Stanford - CS - 161
Comprehensive Exam: Algorithms and Concrete MathematicsAutumn 2001This is a one hour closed-book exam and t he point total for all questions is 60.Al of the intended answers may be written within the space provided. If necessary, you mayluse t he bac
Stanford - CS - 161
Comprehensive Exam: Algorithms and Concrete MathematicsAutumn 2 002This is a one hour closed-book exam and the point total for all questions is 100.1. (10 p oints) Let f (n) = 2Jl0gn a nd g (n) = n e, for some constantfollowing claims is true:E.Whic
Stanford - CS - 161
Comprehensive Exam: Algorithms and Concrete Mat hematicsAutumn 2003+1 . [ lo pts] Prove a tight asymptotic bound on the behavior of T(71) = T (n/3) + T(n/9)n3, where T (n) 5 b for n < no, where no and b are some given constants. For simplicity,solve
Stanford - CS - 161
Stanford - EE - 282
Computer Science Comprehensive ExaminationComputer Architecture[60 points]This examination is open book. Please do all of your work on these sheets. Do not do your work in a bluebook.Number:SProblemMax Score342422100TOTALYour ScoreIThe fo
Stanford - EE - 282
Computer Science Comprehensive Examination SolutionComputer ArchitectureAutumn 2001(Total time = 60 minutes, Total Points = 60)Magic Number:Solution SetIn recognition of and in the spirit of the Stanford University Honor Code, I certifythat I will
Stanford - EE - 282
Computer Science Comprehensive ExaminationComputer Architecture[60 points]This examination is open book. Please do all of your work on these sheets. Do not do your work in a bluebook.By placing your number below you indicate that you agree in the spi
Stanford - EE - 282
uter Science Comprehensive xaminationomputer ArchitectureThis examination is open book. Please do all of your work on these sheets. Do not do your work in a bluebook.Number:Problem ( Max Score11 333TOTAL1 341 1001 Your ScoreIIProblem 1: Mem
Stanford - EE - 282
Computer Science Comprehensive ExaminationComputer Architecture[100 points]This examination is open book. Please do all of your work on these sheets. Do not do your work in a bluebook.Number: _Problem123TOTALMax Score333334100Your ScorePr
Stanford - EE - 282
Computer Science Comprehensive ExaminationComputer Architecture[60 points]This examination is open book. Please do all of your work on these sheets. Do not do your work in a bluebook.Number: _Problem123TOTALAutumn 2004Max Score20202060Pag
Stanford - EE - 282
Computer Science Comprehensive ExaminationComputer Architecture[60 points]This examination is open book. Please do all of your work on these sheets. Do not do your work in a bluebook.Number: _Problem123TOTALAutumn 2004Max Score20202060Pag
Stanford - EE - 282
Stanford University10 November 2005Computer Architecture Comprehensive ExamExam InstructionsAnswer each of the questions included in the exam. Write all of your answers directly on the examination paper, including any work thatyou wish to be consider
Stanford - EE - 282
Stanford University10 November 2005Computer Architecture Comprehensive Exam SolutionsExam InstructionsAnswer each of the questions included in the exam. Write all of your answers directly on the examination paper, including any work thatyou wish to b
Stanford - CS - 154
Comprehensive Exam:Autumn 2000-01Automata and Formal Languages ( 60 points)Problem 1. [ lo p oints]Consider the language L defined by the regular expression 00'10. Provide a PDA M for thislanguage using as few states as possible. Note that there is a
Stanford - CS - 154
Comprehensive Exam:Autumn 2000-01Automata and Formal Languages (60 points)Sample SolutionsProblem 1. [ lo points]Consider the language L defined by the regular expression 00*10. Provide a PDA M for thislanguage using a s few states as possible. N ot
Stanford - CS - 154
Salutione comprehemive exam Automata aad Formal LanguagesOctober 31, 2001+1 . Dmw a n ondetministie jinite automaton without &-moues ( ~cceptkghe language (ab)* e.t3. Consider the following pmblern: Given descriptions of two &ring machines M and N ov
Stanford - CS - 154
Comprehensive Exam:Autumn 2002-03Automata and Formal Languages (60 points)Problem 1. [10 points]Recall that a string x is called a substring of another string w if x appears consecutivelywithin w (i.e. w =yxz for some strings y,z).1. [3 points] Give
Stanford - CS - 154
Comprehensive Exam:Autumn 2002-03Automata and Formal Languages (60 points)Sample SolutionsProblem 1. [10 points]Recall that a string x is called a substring of another string w if x appears consecutivelywithin w (i.e. w =yxz for some strings y,z).1
Stanford - CS - 154
Comprehensive Exam SolutionsAutumn 2003-04Automata and Formal Languages (60 points)Problem 1. [ lo points]Consider the following grammar G over the alphabet C = cfw_0,1, where S is the startsymbol of the grammar.S -+&IOTIlUT -+ OTI 1su -+ 0 s1.
Stanford - CS - 154
Automata and Formal Languages Comprehensive ExamFall 2004Problem 1 (10 points)Give context-free grammars generating the following languages over the alphabet cfw_ O,1) (you need not provethe correctness of your grammm):(a) cfw_aida*j+kb'6 : i,j, k>
Stanford - CS - 242
Relational DatabasesMost DBMSs more or less use the relational model,where a user can think of data as stored in tables.SQLTo make a table:CREATE TABLE PhdStudents (sidINTEGER, name CHAR(30), officenumINTEGER)SID12345881226267267890Look up In
Stanford - CS - 242
Comprehensive Exam-P rogramming languagesFall 2000P roblem 1 - Activation records (8 p oints)You want t o modify your compiler to support dynamically-sized, stack-allocated variables.Assuming a traditional machine architecture, explain what complica
Stanford - CS - 242
Comprehensive Exam: Programming Languages Autumn 2001This is a 30-minute closed-book exam and the point total for all questions is 30.AU of the intended answers may be written within the space provided. You may use theback of the preceding page for scr
Stanford - CS - 242
Comprehensive Exam: Programming Languages Autumn 2002This is a 30-minute closed-book exam and the point total for all questions is 30.All of the intended answers may be written within the space provided. You may use theback of the preceding page for sc
Stanford - CS - 242
Comprehensive Exam: P rogramming Languages Autumn 20021. (7 points) Type Inference(a) ( 3 points) This part of the question asks you to write the ML type of an ML function.Recall that an ML function that takes two integer arguments and returns a Boolea
Stanford - CS - 242
Comprehensive Exam: Programming Languages Autumn 2003This is a 30-minute closed-book exam and the point total for all questions is 30.All of the intended answers may be written within the space provided. (Do not use aseparate blue book.) Succinct answe
Stanford - CS - 242
Comprehensive Exam: Programming Languages Autumn 2004This is a 30-minute closed-book exam and the point total for all questions is 30.All of the intended answers may be written within the space provided. (Do not use aseparate blue book.) Succinct answe
Stanford - EE - 108A
EE108B: Digital Systems IIStanford UniversitySpring 03/04June 4th, 2004EE108B Final ExamExam InstructionsAnswer each of the questions included in the exam. Write all of your answers directly on the examination paper, including any work thatyou wish
Stanford - EE - 108A
EE108B: Digital Systems IIStanford UniversitySpring 03/04June 4th, 2004EE108B Final ExamExam InstructionsAnswer each of the questions included in the exam. Write all of your answers directly on the examination paper, including any work thatyou wish
Stanford - EE - 108A
EE108BSpring 2003-2004Prof. KozyrakisHandout #5Homework #1Due Thurs. Apr. 15, 5 PM in Gates 310Work in groups of 3 students, but turn in only one HW per group.This homework assignment helps you to be familiar with MIPS assembly language. Afull ref
Stanford - EE - 108A
EE108BSpring 2003-2004Prof. KozyrakisHomework #1Due Thurs. Apr. 15, 5 PM in Gates 310Work in groups of 3 students, but turn in only one HW per group.This homework assignment helps you to be familiar with MIPS assembly language. Afull reference guid
Stanford - EE - 108A
EE108BSpring 2003-2004Prof. KozyrakisEE108b - Problem Set #1 Solutions (Total 100 points)This homework assignment helps you to be familiar with MIPS assembly language. Afull reference guide for MIPS instructions is available in section A.10 (Appendix
Stanford - EE - 108A
EE108BSpring 2003-2004Prof. KozyrakisHomework #2Due Tues. April 27, 5 PM in Gates 310Work in groups of 3 students, but turn in only one HW per group.1. (11 points) The following C program is compiled into MIPS objects with nooptimization and with O
Stanford - EE - 108A
EE108BSpring 2003-2004Prof. KozyrakisHomework #2 Solution1.a. (5 points)Copy propagation (1 point):Instructions 0x40, 0x54 and 0x7c are removed.Arithmetic identity/Algebraic simplification (1 point):Since (i+1)*4 = (i*4)+4, instructions 0x40 and
Stanford - EE - 108A
EE108BSpring 2003-2004Prof. KozyrakisHomework #3Due Thursday, May 13, 5 PM in Gates 310Work in groups of 3 students, but turn in only one HW per group.1. (15 points) Consider the following snippet of code:lworilwaddulwlwsubusw$2,$2,$3,$4
Stanford - EE - 108A
EE108BSpring 2003-2004Prof. KozyrakisHomework #3 Solution1. a)lw$2, 0($1)ori$2, $2, 0xfffflw$3, 4($1)addu $4, $2, $3lw$5, 0($4)lw$6, 8($1)subu $7, $5, $6sw$7, 0($4)RAW, WAR hazard ($2)RAW hazard ($2, $3)RAW hazard ($4)RAW hazard ($6)
Stanford - EE - 108A
EE108BSpring 2003-2004Prof. KozyrakisHomework #4Due Thursday, May 20, 5 PM in Gates 310Work in groups of 3 students, but turn in only one HW per group.1. (Total 10 points) You are building a system around a processor that runs at 2.1GHz and has a C
Stanford - EE - 108A
EE108BSpring 2003-2004Prof. KozyrakisHomework #4 Solution1.a.(2 points)AMATinst =AMATL2 ===Therefore,AMATinst ==b.c.(2 points)AMATdataread(2 points)AMATdatawriteHitTimeL1 + MissRateL1 (AMATL2)HitTimeL2+ MissRateL2[MemAccessTime + Dirt
Stanford - EE - 108A
EE108BSpring 2003-2004Prof. KozyrakisHomework #5Due Tuesday, June 1, 5 PM in Gates 310 NO LATE DAY!Work in groups of 3 students, but turn in only one HW per group.1. (20 points) In 64-bit machines, sometimes only part of the possible virtual address
Stanford - EE - 108A
EE108BSpring 2003-2004Prof. KozyrakisHomework #5 Solution1. Each virtual byte address is a 42-bit address consisting of the virtual pagenumber and the virtual page offset.Each physical byte address is a 40-bit address consisting of the physical page
Stanford - EE - 108A
EE108B: Digital Systems IIStanford UniversitySpring 03/04April 29, 2004EE108B Midterm ExamExam InstructionsAnswer each of the questions included in the exam. Write all of your answers directly on the examination paper, including any work thatyou wi