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.

for Pa-Pb=0.1 deltah=1ft Asin((Pa-Pb)/(deltah*(gamma-gammaB)))
patm =gamma*h+pvapor
I_xc=PI*R^4/4 y_R=I_xc/(y_c*A)+y_C distance below the shaft to the center of the pressure is y_R-y_C M_C=0=F_R*(y_R-Y_C)
Example 2.8 A pressurized tank contains oil (SG = 0.90) and has a square, 0.6-m by 0.6-m plate bolted to its side. When the pressure gage on the top of the tank reads 50kPa, what is the magnitude and location of the resultant force on the attached plate? The outside of the tank is at atmospheric pressure. F_1=(P_s+gamma*h1)*A F_2=1/2*gamma(h2-h1)/A F_R=F_1+F_2 M_0=-F_R*y_0+F_1*.3
Example 2.9 The 6-ft-diameter drainage conduit is half full of water at rest. Determine the magnitude and line of action of the resultant force that the water exerts on a 1-ft length of the curved section BC of the conduit wall. F1=gamma*hc*A Weight=gamma*volume Fh=F1 Fv=Weight FR=sqrt(Fh^2+Fv^2)
Fbouyant=gamma*Volume Buoyant force passes through the centroid of the displaced volume. The point through which the buoyant force acts is called the center of buoyancy.
Dz/dy=-a_Y/(g+a_Z) Slope of line of constant pressure dp=0 Dp/dz=-rho(g+a_z,) a_y=0, az is not=0
Volume of fluid in tank remains constant V_i=V PI*R^2*H= PI*2*R4/(4*g)+PI*R2*h_0 H-h_0= Relationship 2*R4/(4*g) between depth and speed is not linear
A long vertical wall separates seawater from freshwater. If the seawater stands at a depth of 7m, what depth of freshwater is required to give a zero resultant force on the wall? When the resultant force is zero, will the moment due to the fluid forces be zero? Explain.
yR
I xc yc A
yc
Seawater: rho=1025kg/m^3, hsea=7m freshwater rho=998kb/m^3 hfresh=h Moment of Inertia Ixx about the center of gravity of a rectangular plate: 1/12 b L3; b = width, L = height of the plate Force = rho* g* hc* A For zero resultant force, FSW = FFW or Rho_SW*g*hSW*ASW = rhoFW*g*hFW*AFW For a unit length of the wall, (1025kg/m3) (9.81m/s2) (7/2 m) (7m x 1 m) = (998kg/m3) (9.81m/s2) (h/2 m) (h x 1 m) h = 7.11 m
In order for the moment to be zero, the two forces must be collinear. However, they will act at different heights, based on the respective centers of pressure.
Cable
8 ft Gate 6 ft 60o Hinge
A homogeneous 4-ft wide 8 ft-long rectangular gate weighing 800 lb is held in place by a horizontal flexible as shown in the figure. Water acts against the gate which is hinged at point A. Friction in the hinge is Negligible.
Specific weight of water = 62.4 lbf/ft3 Weight_gate=800lbf

**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:

University of Michigan - MECHENG - mecheng320

University of Michigan - MECHENG - mecheng320

1.The pressure difference, P, across a partial 2. blockage in an artery (stenosis) is approximated by the equation:Make use of table 1.2 to express the following quantities in SI units: a) b) c) d) e) 10.2 in/min 4.81 slugs 3.02 lb 73.1 ft/s2 0.0234 (lb

UCLA - EE - 113D

EE113D Professor: Rajeev Jain TA: Rick Lan Project Report: Heap Sort Group Members: Shuofei Geng Michael Utanes Felix LuIntroduction: Our project revolved around the idea of sorting numbers. In our case the algorithm we specifically chose to implement is

UCLA - EE - 113D

Run Length Encoding/DecodingEE113D ProjectImran Hoque Yipeng Li Diwei ZhangIntroduction and BackgroundRun length encoding (RLE) is a simple technique to compress digital data by representing successive runs of the same value in the data as the value f

UCLA - EE - 113D

Run Length Encoding/DecodingEE113D ProjectImran Hoque Yipeng Li Diwei ZhangIntroduction and BackgroundRun length encoding (RLE) is a simple technique to compress digital data by representing successive runs of the same value in the data as the value f

UCLA - EE - 113D

Digital 5 Band EqualizerElectrical Engineering 113D Instructor: Professor Jain TA: Rick Lan Spring 2006 June 6, 2006 Authors Michael Kim 103109105 Gordon Tsui Introduction and Background Digital signal processing is widely used in audio processing, which

UCLA - EE - 113D

Introduction and Overview of TMS320C54xEE113D Week 1 Rick HuangWeek 1EE113D EE Dept UCLA (c) RL1Administrative StuffClass Organization Course reader Class mailing list Office hours Wait listed Agenda Reader pg1-44 C54x Architecture Programming Intro

UCLA - EE - 113D

DSP Programming by Algebraic AssemblyEE113D Week 2 Rick HuangAdministrative StuffGroups members Assignments Due today Agenda Reader pg71-78 Number Systems DSP Programming Homework 1Algebraic AssemblyDue next weekHomework 2 (soft copy for Prob 8)

UCLA - EE - 113D

Interfacing C542 DSP to Analog Interface CircuitEE113L Week 3 Rick HuangAdministrative StuffAssignments Due today Homework 2 Due next week Homework 3 Floppy Disk Graded Agenda Reader pg45-70,79-84 Analog Interface Circuit Anti-aliasing filter cutoff

UCLA - EE - 113D

Experiment 1 Frequency SynthesisEE113L Week 4 Rick HuangAdministrative StuffAssignments Due today Agenda Reader pg85-88 Waveform generation Lab report format Demo Homework 3 Experiment 1 ReportDue next week GradedHomework 2Week 4EE113D EE Dept UC

UCLA - EE - 113D

Experiment 2 Digital Filtering (FIR)EE113L Week 5 Rick HuangAdministrative StuffAssignments Due today Agenda Filtering lecture Experiment Experiment 1 Report Experiment 2 Report Project Proposal Homework 3Due next weekGradedWeek 5EE113L EE Dept U

UCLA - EE - 113D

UCLA Electrical Engineering EE 113DProfessor Jain TA Delbert HuangExperiment 1 Frequency SynthesisPurpose To implement a frequency synthesizer using a simple, modied, table look-up method. To modify the program to enable the generation of piecewise li

UCLA - EE - 113D

UCLA Electrical Engineering EE 113DProfessor Jain TA Delbert HuangExperiment 2 Digital Filtering (FIR)PurposeTo design a FIR lter in MATLAB and to implement and test it on the TMS320C542-based DSKplus board.IntroductionA lter is the one of the most

UCLA - EE - 113D

UCLA Electrical Engineering EE 113DProfessor Jain TA Delbert HuangExperiment 3 Modulation TechniquesPurpose To implement amplitude modulation and demodulation on the TMS320C542 DSKplus board. To investigate frequency modulation on the DSKplus board.I

UCLA - EE - 113D

UCLA Electrical Engineering EE 113DProfessor Jain TA Delbert HuangExperiment 4 Introduction to Speech SynthesisPurposeTo design a speech synthesizer that will produce vowel sounds on the TMS320C542 DSKplus board.IntroductionA Simple Vowel Synthesize

UCLA - EE - 113D

UCLA Electrical Engineering EE 113DProfessor Jain TA Delbert HuangExperiment 5 Fast Fourier TransformPurpose1. To understand how subroutines and function calls are used in the TMS320C542 assembly code. 2. To understand how the Fast Fourier Transform (

UCLA - CS - 31

FinalExamReviewTheFinalisTHISSaturday From36pm ChecktheCS31websitefordetailsonwheretogo!WhatDoesThisProgramPrint?int c; int bar() cfw_ static int x = 0; return(x+); main() cfw_ int a=0,b=1,c=2; if (a+ > 0 & -b = bar() c+; cout < a < b < c; if (a+ > 1

UCLA - CS - 31

ComputerScience31 IntroductionTo ComputerScienceLecture#1 MW10am12pm 2258AFranzHall CareyNachenbergWelcometoComputerScience31 CS31isanintroductiontoComputerScienceandprogramming intheC+language Workload:Between5and30hoursperweek: Homeworks(Take210hours

UCLA - CS - 31

Wednesday,Oct6thYouregonnalearnhowtoprogramtoday! (Ifyouveprogrammedbefore,thenponderonthisbrain teasertorelieveyourboredom).main() cfw_ int a = 5, b = 10; a = <fill this in>; b = <fill this in>; a = <fill this in>; Usingonlyadditionand subtraction,fil

UCLA - CS - 31

Monday,Oct11 QuestionsaboutProject#1? Week1reviewchallenge Apotpourriofnewtopics thMoreaboutvariables Newoperators(+=,+,etc.) Theifstatement StringvariablesReviewChallengeThisprogramcomputestheaverageof2numbersandprintstheresult.Find thesyntax&seman

UCLA - CS - 31

We sday, Octobe 13th dne rvie halle Re w C nge coping Rule s VariableS ontrol S tructure s C Thewhileloop Thedo-whileloop Moreon + and -Re w Challe vie ngeWhat doe thefollowing programprint out if theuse e rs 10? s r nte How about 3 and 6?int main(v

UCLA - CS - 31

Monday,October18 ReviewChallenge MoreControlStructures |and& Theforloop Theswitchstatement breakandcontinue NestedloopsthReview Challenge: It Prints What?#include <iostream> using namespace std; int main(void) cfw_ int drinks; cout < How many cokes?

UCLA - CS - 31

Wednesday,October20th ReviewChallenge Anewdatatype:bool ShortCircuiting IntroductiontoFunctionCallsReviewChallengeWriteaprogramthatreversesastringvoid main(void) cfw_ string s = a man a plan a canal panama; / write your code here to reverse the string

UCLA - CS - 31

Monday,October25 th FunctionReview MoreonFunctions PassingVariablesusingReferences FunctionOverloadingandDefaultParameters GlobalandStaticVariables Detectingerrorsinfunctionsint square(int x); int main(void) cfw_ int n;FunctionReview/ int square(int

UCLA - CS - 31

Wednesday, October 27 Function Re w vie ProgramDe and De position sign com Type casting I f wehavesom tim , we start AS e e ll CIIthFunction ReviewThef oo f unction com s the pute ave of two num rs and: rage be1. Re turns t hesumof thenum rs. be 1. S

UCLA - CS - 31

Monday, Nove be 1 mrC ode TheAS I I C Arrays, arrays, arraysstThem rmis NEXT We sday! idte dneBepre d to writecodeon your m rm pare idte !AS I I CQue stion: How do two spie transm a m ssageove a s it e r t e graph? le8 = .-. o = -. H = -. le -He 8

UCLA - CS - 31

Wednesday, November 3 Arrays,Part#2 SearchingThroughArrays DoubleDimensionalArraysrdArray Challengeint main(void) cfw_ const int NUM_STUDS = 3; int grades[NUM_STUDS] = cfw_0; int j=0; while(j+<NUM_STUDS) cfw_ cout < Enter grade < j < : ; cin > grades[

UCLA - CS - 31

Monday,November8 CStrings MidtermreviewthClassicCStringsSofar,wehaveusedC+stringvariablesintwoprogrammingprojects.main() cfw_ string s = hello; cout < s < world!\n; IfyouareprogramminginC,youcantusetheseC+stringvariables! Question:Sohowdoyoucreatest

UCLA - CS - 31

Monday, November 15 Nomidtermgradesyet Pointers,pointers,pointersthPointersareoneofthemostcomplextopicsinC/C+.Ifyou dontunderstandpointerswell,youllbetorturedbyhorrible bugs,sopayattention!AndnowforPointersEveryvariableinC+canbedescribedbyfive differ

UCLA - CS - 31

Wednesday,November17th BasicPointerReview PointersandArrays PointerArithmetic IteratingThroughanArrayW/Pointers PassingArraystoFunctions:TheTruth!PointerReviewWhatdoesthefollowingprogramprintout?main() cfw_ int i1 = 100, i2; int *pi; pi = & i1; cout <

UCLA - CS - 31

Monday,November22 PointerChallenge Structures Classes(ObjectOrientedProgramming)ndPointer Reviewvoid main(void) cfw_ int *ptr; int a[5] = cfw_0; ptr = &a[1]; *ptr = 3; ptr[1] = 4; *(ptr-1) = 5; ptr += 3; *ptr = 10; / what are the values? Whataretheva

UCLA - CS - 31

Wednesday, November 24th Str uctur e Revi ew M or e on Objects and Cl asses i n C+ A l i ttl e mor e on poi nter s: New and Del eteStructure Reviewruct PERSON string name; int age; ruct FAMILY PERSON PERSON PERSON string mother; father; child; last_nam

UCLA - CS - 31

Monday, November 29 ClassChallenge ClassConstructors ClassDestructors UsingnewanddeletewithclassesthClassChallengeConsideraclasscalledTrackthathasfollowingmethods: 1. AnInitmethodthatinitializestheclass 1. ASubmitmethodthatallowstheusertosubmitanewint

UCLA - CS - 31

Wednesday,December1 st ClassChallenges EnumeratedTypes ClassesbeforeC+ ClassesUnderTheHood Thethispointer OperatorOverloadingPartA:Whichofthefollowinglinesinourmainfunctionisinvalidgiven theRectclassbelow?class Rect cfw_ public: Rect(float x, float y

UCLA - CS - 32

OnMars,therearetwotypesofMartianstheOhms andtheVolts.Theyalllookalike.TheOhmscanonly lie.TheVoltscanonlytellthetruth. AnEarthlingvisitsMarsandmeets3Martians. HeasksMartian#1,"Whattypeareyou?".Martian#1 repliesinMartian. HeasksMartian#2,"Whatdidhesay?".Mar

UCLA - CS - 32

Wednesday,April5th CollectAcademicIntegrityForms Constructors Destructors ClassComposition CompositionwithInitializerListsConstructorsclass Circ cfw_ public: void Init(float x, float y, float r) cfw_ m_x = x; m_y = y; m_rad = r; float GetArea(void) cf

UCLA - CS - 32

Monday, April 10vie rs A Quick Re w of Pointe Ge tting theaddre of a variable ss De fining a pointe variable r De fe ncing a pointe variablewith the* ope re re r rator Pointe and arrays rs Pointe and structs/classe rs s Ne and De te w lethd I ntroduct

UCLA - CS - 32

Monday,April17 AssignmentOperators Stacks QueuesthTheAssignmentOperatorWejustlearnedhowtoinitializethevalueofanewclassvariabletothevalue ofanexistingvariable. Nowletslearnhowtosetthevalueofanexistingvariabletothevalueofan anotherexistingvariable.main

UCLA - CS - 32

Wednesday, Apr i l 19 I nher i tance Pol ymor phi smthPr oof that 1 = 2: Assume a = b2 2Then ab = a = b2 2+ 2So ab + (a 2ab) = a (a 2ab) Si mpl i fyi ng,2 2a ab = 2a 2ab Factor i ng, 2 Whats2 wr ong wi th thi s pr oof? 1(a ab) = 2(a ab)I nher i

UCLA - CS - 32

Monday,April24 Polymorphism VirtualFunctions VirtualDestructors PureVirtualFunctionsthPolymorphismConsiderafunctionthatacceptsa PersonasanargumentCanwealsopassaStudentasa parametertoit?void LemonadeStand(Person &p) cfw_ cout < Hello < p.getName(); c

UCLA - CS - 32

Recursion Recursion RecursionWednesday,April26thOneday Amadpoetwithlittletosay Gaveapoemaway Thatstarted: Oneday Amadpoetwithlittletosay Gaveapoemaway Thatstarted: Oneday etc MartinGardner(famousmathematician)Recursion!Beforewetalkaboutrecursion,its

UCLA - CS - 32

Monday,May1 st Templates STLIterators STLAlgorithms(findandfind_if)YourmidtermisnextMonday! Formorerecursionreview(hint!),goto:http:/www.sparknotes.com/cs/recursion/examples/summary.htmlRecursionChallengeThefollowingfunctioniterativelycomputesxn: in

UCLA - CS - 32

Wednesday, M ay 3 Object Or i ented Desi gn M i dter m Revi ewFa i r ga me on the mi dter m:th1. Cl asses 2. I nher i tance 3. V i r tual functi ons, A.B.C.s 4. Cl ass composi ti on 5. Poi nter s and r efer ences 6. D ynami c memor y al l ocati on (ne

UCLA - CS - 32

Wednesday,May10 AlgorithmicComplexity SortingAlgorithms,partIthAlgorithmicComplexityIncomputerscience,weneedtohaveawaytocomparealgorithmstoeach other:e.g.,whichalgorithmismostefficientforagivenproblemofagivensize.Typically,wemeasureanalgorithmseffici

UCLA - CS - 32

Monday,May15 SortingAlgorithms,partII: IntroductiontoTrees No midterms yet! Quicksort MergesortthDivideandConquerSortingThesesortingschemesgenerallyworkasfollows: 1. Dividetheelementstobesortedintotwogroupsofroughly equalsize. 2. Sorteachofthesesmall

UCLA - CS - 32

Wednesday,May17 BinaryTreeTraversals UsingBinaryTreestoEvaluateExpressions BinarySearchTrees BinarySearchTreeOperations Searchingforanitem Insertinganewitem Findingtheminimumandmaximumitems Printingouttheitemsinorder DeletingthewholetreethBinaryTreeTra

UCLA - CS - 32

We sday, May 24 dnes Tables Hash Table vie halle Re w C ngethBig-OH C razine ssC onside a binary se r arch tre t hat holds N stude re e nt cords, all inde d by xe t he nam . ir e Each stude re contains a linke nt cord d-list of theL classe t hat the

UCLA - CS - 32

Wednesday,May31 st RepresentingBinaryTreesUsingArrays CompleteBinaryTrees PriorityQueues Heapsofwhat? TheHeapSort ReviewChallengeAsweveseen,youcanrepresentabinarytreewithalinkedlistdata structure. Youcanalsorepresentabinarytreewithanarray! 1. Therooto

Delaware - MATH241 - 241

Sample Math Placement Exam Question solutions: Please note that many printers will not interpret some of the notation correctly so after you print this you may want to double check some of the answers. Algebra: 1. x =8 80 = 42 5 22. 2x(x-4)=0 or x=0 or

Delaware - MATH241 - 241

Cornell - ECE - 4110

LECTURE NOTES Course 6.041-6.431 M.I.T. FALL 2000Introduction to ProbabilityDimitri P. Bertsekas and John N. TsitsiklisProfessors of Electrical Engineering and Computer Science Massachusetts Institute of Technology Cambridge, MassachusettsThese notes

Cornell - ECE - 4110

Dow Jones Industrial AverageSMFact SheetStated ObjectiveTo represent large and well-known U.S. companies. Covers all industries with the exception of Transportation and Utilities.Key Features Components are selected at the discretion of The Wall Str

Cornell - ECE - 4110

ECE4110 Cornell UniversityHomework 1Fall 09 T.L. FineThis assignment is to be handed in at the end of class on Thursday, 3 September. 1. (a) Describe the ranges (sets of possible values) of the random variables cfw_Xt , t T and the index set T for the

Cornell - ECE - 4110

ECE4110 Cornell UniversityHomework 2Fall 09 T.L. FineThis assignment is to be handed in at the end of class on Thursday, 10 September. 1. A random process XT , T = N, has mutually independent random variables with common cdf F satisfying (x R) 1 > F (x

Cornell - ECE - 4110

ECE4110 Cornell UniversityGeneral InformationFall 2009 T.L.FineCATALOG DESCRIPTION: ECE 4110 Random Signals in Communications and Signal Processing Fall. 4 credits. Prerequisite: ECE 2200 and ECE 3100 or equivalent. Introduction to models for random si

Cornell - ECE - 4110

ECE4110 Cornell UniversityLecture: 27 AugFall 09 T.L. Fine1. Course Organization (1) Discuss the General Information handout with the class. (2) RH312 for oce hour from 4pm to 5pm on Wednesdaysjust prior to homeworks due on Thursday and prelims on Thur

Cornell - ECE - 4110

ECE4110 Cornell UniversityLectures: 1&3 SepFall 09 T.L. FineA second denition of a random process is perhaps more constructive in that it brings out a random process as a randomly selected function of its index parameter (e.g., time, space). Denition 1

Kentucky - EE - 599

EE599-003 Nanophotonics Instructor: Prof. Todd Hastings Research: nanofabrication methods, nanoscale electronics and photonics for biochemical sensing and communications Material: Nano- (and Micro-) PhotonicsAnnouncements Class will not meet on Monday

Kentucky - EE - 599

Exam 1 Review Exam will be on Friday Oct. 2, normal classroom It will cover material through September 23 (Lecture 9, uniform gratings) and Homework 3 You are allowed to bring 1 sheet of notes on a single sided, 8.5x11 sheet of paper Old exam posted on w

University of Adelaide - MATH - 814

Math 220A Complex Analysis Solutions to Homework #1 Prof: Lei Ni TA: Kevin McGownConway, Page 4, Problem 2. Basic geometry in R2 says that we have equality in the expression |z1 + + zn | |z1 | + + |zn | if and only if all the zi lie on the same ray with

University of Adelaide - MATH - 814

Homework IStephen Taylor April 28, 2005Page 3 : z 6. Let R(z ) be a rational function of z . Show that R(z ) = R() if all the coecients in R(z ) are real. Since R(z ) is a rational function of z it is in the form a0 + a1 z + + an z n b0 + b 1 z + + b m