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.
11 Pages
Fourth Grade School Horsepower - revised 11-19-2010
Course: BRAE 433, Fall 2011School: Cal Poly
Rating:
Document Preview
many Water H2O QUIZ How people are on Earth? a) 25,000 b) 36,000,000 c) 296,000,000 d) 6,500,000,000 Satellite Photo of the Earth at Night Answer: 6,500,000,000 QUIZ How many gallons of water to make a McDonalds Quarter Pounder? a) b) c) d) 1 60 600 6,000 Answer: 600 gallons It takes a lot of water to make hamburger California a Water North Horsepower - HP Water Engineering 101 Definition Horsepower -...
Unformatted Document Excerpt
Coursehero >> California >> Cal Poly >> BRAE 433Course 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.
many Water
H2O
QUIZ
How people are on Earth?
a)
25,000
b)
36,000,000
c) 296,000,000
d) 6,500,000,000
Satellite Photo of the Earth at Night
Answer: 6,500,000,000
QUIZ
How many gallons of water to make a
McDonalds Quarter Pounder?
a)
b)
c)
d)
1
60
600
6,000
Answer: 600 gallons
It takes a lot of water to make hamburger
California a Water
North
Horsepower - HP
Water Engineering 101
Definition
Horsepower - HP
A unit for measuring POWER
1 HP = 550 feet-pound/second
Horsepower Math
Water Pump Example:
HP = Flow Rate x Pressure
3960
Horsepower Math
HP = Flow Rate x Pressure
3960
HP = 4 GPM x 10 Feet = 0.01 HP
3960
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:
Below is a small sample set of documents:
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 - 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
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
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
Stanford - EE - 108A
EE108B: Digital Systems IIStanford UniversityMarch 18, 2004Winter 03/04EE108B FinalExam 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 - EE - 108A
EE108B: Digital Systems IIStanford UniversityMarch 18, 2004Winter 03/04EE108B Final SolutionsExam InstructionsAnswer each of the questions included in the exam. Write all of your answers directly on the examination paper, including any work thatyou
Stanford - EE - 108A
EE108BWinter 2003-2004Handout #5Homework #1Due Thurs. Jan 22, 5 PM in Gates 4081. The following code fragment processes an array and produces two values inregisters $v0 and $v1:addaddaddadd$a1,$a1,$v0,$t0,$a1, $a1$a1, $a1$zero,$zero,$ze
Stanford - EE - 108A
K. Olukotun / M.T. LeWinter 2003-2004Handout #13EE108bEE108b - Problem Set #1 Solutions (Total 20 points)1. (Total 10 points)The following code fragment processes an array and produces two values inregisters $v0 and $v1:addaddaddadd$a1,$a1,$
Stanford - EE - 108A
K. Olukotun / M.T. LeWinter 2003-2004Handout #12EE108bProblem Set #2Due Tues Feb 3, 5 PM in Gates 408 No Late Day1. The following C program is compiled into MIPS objects with no optimization andwith O2 optimization.int A[100], B[100];main() cfw_
Stanford - EE - 108A
EE108BWinter 2003-2004Handout #20EE108b Solution to Problem Set #2 (Total 56 points)Due Tues Feb 3, 5 PM in Gates 408 No Late Day1. (Total 11 points)The following C program is compiled into MIPS objects with no optimization andwith O2 optimization.
Stanford - EE - 108A
EE108BWinter 2003-2004Handout #21Homework #3Due Thu. Feb 19, 5 PM in Gates 4081. List two advantages and two disadvantages of fixed size instructions.2. Identify all of the data dependencies in the following code (accompanied by adiagram). Which de
Stanford - EE - 108A
EE108BWinter 2003-2004Handout #34Homework #3 (Total 140 points)Due Tues Feb 17, 5 PM in Gates 4081. (4 points) one point for each correct bullet.List two advantages and two disadvantages of fixed size instructions.Answer:Advantages: Next PC calcu
Stanford - EE - 108A
EE108BWinter 2003-2004Handout #29Homework #4Due Thurs Feb 26, 5 PM in Gates 4081. (Total 10 points)You are building a system around a processor that runs at 1.1 GHz and has a CPIof 0.7, which excludes loading from and saving to memory. The only ins
Stanford - EE - 108A
EE108BWinter 2003-2004Handout #35Homework #4 (Total 85 points)Due Thurs Feb 26, 5 PM in Gates 4081. (Total 10 points)You are building a system around a processor that runs at 1.1 GHz and has a CPIof 0.7, which excludes loading from and saving to me
Stanford - EE - 108A
EE108BWinter 2003-2004Handout #29Homework #5Due Tues Mar 9, 5 PM in Gates 4081. (5 points)memory, and the same am[5 points] The following simplified diagram shows twopotential ways of numbering the sectors of data on a disk (only two tracks are sho
Stanford - EE - 108A
EE108BWinter 2003-2004Handout #?Homework #5 (Total 105 points)Due Tues Mar 9, 5 PM in Gates 4081. (5 points)The following simplified diagram shows two potential ways of numbering thesectors of data on a disk (only two tracks are shown and each trac