4.2 The Derivative. f(x + h) f(x) lim
|
|
- Chester Sims
- 5 years ago
- Views:
Transcription
1 4.2 Te Derivative Introduction In te previous section, it was sown tat if a function f as a nonvertical tangent line at a point (x, f(x)), ten its slope is given by te it f(x + ) f(x). (*) Tis is potentially very powerful information about te function f. For example, places were a tangent line as slope 0 often correspond to maximum or minimum values of a function. Also, te slope of te tangent line at (x, f(x)) tells ow te function values f(x) are canging at te instant one is passing troug te point (x, f(x)): weter te grap is rising or falling, and ow quickly. Because of te importance of tis slope information, te it ( ), wen it exists, is given a special name: it is called te derivative of f at x, and denoted by f (x) (read f prime of x ). Tis is summarized below. DEFINITIONS differentiable at x; te derivative of f at x; differentiation For a given function f and x D(f), if te it f(x + ) f(x) exists, ten one says tat f is differentiable at x, and writes f (x) := 0 f(x + ) f(x) Te number f (x) is called te derivative of f at x. Te process of finding f (x) is called differentiation.. 193
2 194 copyrigt Dr. Carol JV Fiser Burns ttp:// DEFINITION f, te derivative function Given a function f, we now ave a way to construct a new function, named f. Tis function f is called te derivative of f. Te domain of f is te set of all x D(f) for wic te it f(x + ) f(x) exists. If f is differentiable at every point in its domain, ten D(f ) = D(f). However, f may not be differentiable at every point in its domain. So, te domain of f may be smaller tan te domain of f. In general, all tat can be said is tat D(f ) D(f). Te derivative f takes an input x, and gives as an output te slope of te tangent line to te grap of f at te point (x, f(x)). differentiating f(x) = 2x + 1 Let f be defined by f(x) = 2x + 1. Te grap of f is a line L wit slope 2. At any point on tis line, te tangent line is te line L itself. So, at every point, te slope of te tangent line is 2. Tus, te function f as te same domain as f, and is defined by f (x) = 2. One usually abbreviates te problem as follows: PROBLEM: Differentiate f(x) = 2x + 1. SOLUTION: f (x) = 2. For example, f (0) = 2, f (π) = 2, and f ( ) = 2. differentiating a function tat is defined piecewise PROBLEM: Differentiate { 1 for x 0 f(x) = 1 for x > 0. SOLUTION: For all positive and negative x, tangent lines exist and ave slope zero. However, f is not differentiable at 0. Intuitively, tis is clear; tere is no obvious way to draw a tangent line at te point (0, 1). Tis conclusion is confirmed by investigating te rigt-and it at x = 0: f(0 + ) f(0) 1 ( 1) 2 = =, wic does not exist. Tus, te two-sided it does not exist. Summarizing, { 0 for x 0 f (x) = not defined for x = 0. For example, f (.1) = 0, f (.001) = 0, and f (0) does not exist. In tis example, D(f) = R, and D(f ) = {x x 0}. Using interval notation, one can alternately write D(f ) = (, 0) (0, ). Unfortunately, bot of tese are pretty long expressions for te domain of f. Tere is a simpler expression, tat makes use of set subtraction, discussed next.
3 copyrigt Dr. Carol JV Fiser Burns ttp:// 195 DEFINITION set subtraction Let A and B be sets. Define a new set, denoted by A B, and read as A minus B, by A B := {x x A and x / B}. Tus, te set A B consists of all te elements of A tat are not elements of B. (In oter words, take A and subtract off any elements of B.) set subtraction For example, if ten A = R and B = [1, 2), A B = (, 1) [2, ) and B A =. If A = {1, 2, 3} and B = {3, 4, 5} ten A B = {1, 2} and B A = {4, 5}. Tis notation gives an easier way to describe te domain of f in te previous example: D(f ) = R {0}. EXERCISE 1 1. Wy is it incorrect to say D(f ) = R 0? For eac of te following sets A and B, find bot A B and B A. Be sure to answer using complete matematical sentences. 2. A = R, B = (, 2] 3. A = ( 3, 3], B = [ 1, 4) 4. A = R, B is te set of irrational numbers Find sets A and B so tat S = A B. (Tere is not a unique correct answer.) 5. S = ( 1, 0) (0, 1] 6. S = {1, 2, 3}
4 196 copyrigt Dr. Carol JV Fiser Burns ttp:// differentiating f(x) = x ; a function tat is continuous at a point, but not differentiable tere Consider te function f(x) = x. For x > 0, f(x) = x = x is certainly differentiable wit derivative f (x) = 1. For x < 0, f(x) = x = x is also differentiable wit derivative f (x) = 1. Wen x = 0, tere is no tangent line. In tis case, bot one-sided its exist, but do not agree: f(0 + ) f(0) 0 = = = 1 and = 0 0 = 0 = 1. Since te one-sided its do not agree, te two-sided it does not exist, and f is not differentiable at x = 0. Summarizing, EXERCISE 2 Let f(x) = 3x 1. 1 for x > 0 f (x) = not defined for x = 0 1 for x < 0. Tus, for example, f (1.7) = 1, f ( 4/3) = 1, and f (0) does not exist. 1. Grap f. Wat is D(f)? 2. Wat is te function f? In particular, wat is D(f )? Now, let f(x) = x Give a piecewise description for f. 4. Grap f. Wat is D(f)? 5. For x > 3, wat is f (x)? 6. For x < 3, wat is f (x)? 7. Sow tat f is not defined at x = 3, by investigating te its f(3 + ) f(3) and f(3 + ) f(3) Write down a piecewise description of f. 9. Grap f.
5 copyrigt Dr. Carol JV Fiser Burns ttp:// 197 a patced togeter function tat IS differentiable at te patcing point PROBLEM: Is te function { x 2 x 1 f(x) = 2x 1 x < 1 differentiable at x = 1? SOLUTION: Note tat f(1) = 1 2 = 1. Investigate bot one-sided its: f(1 + ) f(1) (1 + ) 2 1 = = (2 + ) = = 2 and f(1 + ) f(1) (2(1 + ) 1) 1 2 = = = 2. Since bot one-sided its agree, f(1 + ) f(1) exists and equals 2. Tus, f is differentiable at 1, and f (1) = 2. Tat is, te tangent line to te grap of f at te point (1, 1) as slope 2. EXERCISE 3 Let f be defined by 1. Grap f. Wat is D(f)? { x 2 for x 1 f(x) = 2x 1 for x > Does f (x) exist for x < 1? If so, wat is it? 3. Does te it x 1 f (x) exist? If so, wat is it? 4. Does f (x) exist for x > 1? If so, wat is it? 5. Investigate two appropriate one-sided its to decide if f ( 1) exists. If it does, wat is it? 6. Is tere a tangent line to te grap of f at te point wit x-value 1? If so, wat is its slope? 7. Grap f. Wat is D(f )?
6 198 copyrigt Dr. Carol JV Fiser Burns ttp:// a function tat is differentiable at an endpoint of its domain PROBLEM: Consider te function f : [1, 2] R, f(x) = 1 x. Is f differentiable at x = 1? SOLUTION: Note tat f(1) = 1 1 = 1. For f to be differentiable at x = 1, te it f(1 + ) 1 must exist. Does it? Remember tat to investigate tis it, one only considers values of tat are close to 0 and in te domain of te function f(1+) 1. Wen is in te domain of f(1+) 1? Only wen 1+ D(f). And for tis function, 1 + D(f) only wen > 0. Here, te two-sided it is identical to te rigt-and it. Wen a function is only defined on one side of a point, te two-sided it is actually just a one-sided it. Tus, one as f(1 + ) f(1) = 0 + = (line 1) (line 2) 1 1 = (1 + ) (line 3) 1 = = (line 4) Tus, f is differentiable at x = 1, and f (1) = 1. EXERCISE 4 1. Give a reason (or reasons) for eac line of te preceding display. Te lines are numbered for easy reference. Consider te function f : [0, 4] R given by f(x) = (x 1) Grap f. 3. Is f differentiable at x = 0? Tat is, does te it f(0 + ) f(0) exist? Justify your answer. Be sure to write complete matematical sentences.
7 copyrigt Dr. Carol JV Fiser Burns ttp:// 199 a function tat is not differentiable at an endpoint of its domain Let f(x) = x. For all x > 0 one as f(x + ) f(x) x + x = x + x = = 0 (x + ) x ( x + + x) x + + x x + + x (line 2) (line 1) (line 3) 1 = (line 4) 0 x + + x = 1 2. (line 5) x Tus, at eac point (x, x) for x > 0, te tangent line exists and as slope 1 2 x. EXERCISE 5 Give a reason (or reasons) for eac line in te display above. Te lines are numbered for easy reference. Now tink about wat appens wen x = 0. In tis case, te it is actually a rigt-and it, and reduces to For > 0, we can write = ( ) 2, so tat = 0 + = ( ) = But as 0 +, 1 does not approac a specific real number. It gets arbitrarily large. Tere is a vertical tangent line at te point (0, 0), and a vertical line as no slope. So f is not differentiable at 0. Caution! no slope versus zero slope Every orizontal line as zero slope. Coosing any two points on te line, and traveling from one point to te oter via te rule rise, ten run yields rise run = 0 some nonzero number = 0. Every vertical line as no slope; tat is, te slope is undefined. For if any two points are cosen on te line, computation of te slope yields rise some nonzero number = run 0 and division by zero is undefined. Tus, no slope and zero slope ave entirely different meanings. Tis can be confusing, because in Englis, te words no and zero are often used as synonyms.,
8 200 copyrigt Dr. Carol JV Fiser Burns ttp:// reading info from a grap Consider te function f wose grap is sown below: Read te following information from te grap, if possible. If a quantity does not exist, so state. f( 1), f ( 1), f ( 1.5), f (1.5), f (2), f(4), f (6), f (7) SOLUTION: f( 1) = 1 f ( 1) does not exist f ( 1.5) = 0 f (1.5) = 2 (Use te known points (1, 1) and (2, 1) to compute te slope.) f (2) does not exist f(4) = 2 f (6) = 0 f (7) > 0; one migt estimate tat f (7) 1 Now, answer te following questions about f: Wat is D(f)? Wat is R(f)? Were is f continuous? Were is f differentiable? Wat is {x f(x) > 0}? Wat is {x f(x) [ 1, 1]}? Wat is {x f(x) = 1}?
9 copyrigt Dr. Carol JV Fiser Burns ttp:// 201 SOLUTION: For all tese answers, te assumption is made tat te patterns indicated at te four borders of te grap continue. D(f) = R R(f) = R f is continuous at all x in te set (, 1) ( 1, 4) (4, ). A simpler notation for tis set is R { 1, 4}. f is differentiable at all x in te set R { 1, 1, 2, 4}. Some approximation is necessary ere. {x f(x) > 0} = (, 1] (1.5, 3.5) [4, 10) Some approximation is necessary ere. {x f(x) [ 1, 1]} = (, 3.8) {6} (9.5, 10.5) Some approximation is necessary ere. {x f(x) = 1} = (, 1] {2, 6, 9.5} EXERCISE 6 Consider te function f wose grap is sown below. Read te following information from te grap, if possible. Approximate, wen necessary. If a quantity does not exist, so state. Be sure to write complete matematical sentences. 1. f(0), f(1), f (1), f (2), f (1.34), f(3), f(4), f (π), f (1000) 2. Wat is D(f)? 3. Wat is D(f )? 4. Wat is R(f)? 5. Were is f continuous? Classify any discontinuities. 6. Wat is {x f(x) 0}? 7. Wat is {x f (x) < 0}?
10 202 copyrigt Dr. Carol JV Fiser Burns ttp:// reconstructing a function from its derivative Suppose tat a function f as derivative f wose grap is sown below. Wat, if anyting, can be said about te grap of f? SOLUTION: For x < 0, te tangent lines to te grap of f must all ave slope 1. For 0 < x < 1, te tangent lines to te grap of f must all ave slope 0. For x > 1, te tangent lines to te grap of f must all ave slope 1. Tere is not a unique function f tat satisfies tese requirements. For example, any of te following graps would produce te specified derivative: EXERCISE 7 Suppose tat a function f as derivative f wose grap is sown below: 1. Wat, if anyting, can be said about te grap of f? 2. Grap tree different functions f tat could ave te specified derivative.
11 copyrigt Dr. Carol JV Fiser Burns ttp:// 203 QUICK QUIZ sample questions 1. Give a precise definition of f (x). 2. Wat is te difference between f and f (x)? 3. If A = [0, 4) and B = {0, 2, 4}, find A B and B A. 4. For te function given below, find and grap f. 5 TRUE or FALSE: If f is differentiable at x, ten f is defined at x. KEYWORDS for tis section Differentiable at x, f (x) is te derivative of f at x, differentiation, f is te derivative function, finding derivatives using te definition, set subtraction. END-OF-SECTION EXERCISES For eac function f listed below, do te following: Grap f. Wat is D(f)? Find f. Wen necessary, use te definition of derivative. Grap f. Wat is D(f )? 1. f(x) = x 2 { 2 for 3 < x 0 2. f(x) = 1 x for 0 < x < 4 { x 2 for x 1 3. f(x) = 2x for x > 1 Use te definition of te derivative to find f (c) for eac function f and number c D(f). 4. f(x) = 3x 2 1, c = 2 5. f(x) = 1 x 1, c = 2 6. f(x) = x + 1, c = 4 Find te equation of te tangent line to te grap of te function f at te specified point. Feel free to use any earlier results. Te point-slope form may be useful: remember tat y y 1 = m(x x 1 ) is te equation of te line tat as slope m and passes troug te point (x 1, y 1 ). 7. f(x) = x 2, c = 3 8. f(x) = x, c = 0 9. f(x) = (x + 2) 2 + 1, c = 2
4.1 Tangent Lines. y 2 y 1 = y 2 y 1
41 Tangent Lines Introduction Recall tat te slope of a line tells us ow fast te line rises or falls Given distinct points (x 1, y 1 ) and (x 2, y 2 ), te slope of te line troug tese two points is cange
More information2.8 The derivative as a function
CHAPTER 2. LIMITS 56 2.8 Te derivative as a function Definition. Te derivative of f(x) istefunction f (x) defined as follows f f(x + ) f(x) (x). 0 Note: tis differs from te definition in section 2.7 in
More informationMATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2
MATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2 Note: Tere will be a very sort online reading quiz (WebWork) on eac reading assignment due one our before class on its due date. Due dates can be found
More informationSection 1.2 The Slope of a Tangent
Section 1.2 Te Slope of a Tangent You are familiar wit te concept of a tangent to a curve. Wat geometric interpretation can be given to a tangent to te grap of a function at a point? A tangent is te straigt
More information2 The Derivative. 2.0 Introduction to Derivatives. Slopes of Tangent Lines: Graphically
2 Te Derivative Te two previous capters ave laid te foundation for te study of calculus. Tey provided a review of some material you will need and started to empasize te various ways we will view and use
More informationMore on Functions and Their Graphs
More on Functions and Teir Graps Difference Quotient ( + ) ( ) f a f a is known as te difference quotient and is used exclusively wit functions. Te objective to keep in mind is to factor te appearing in
More information3.6 Directional Derivatives and the Gradient Vector
288 CHAPTER 3. FUNCTIONS OF SEVERAL VARIABLES 3.6 Directional Derivatives and te Gradient Vector 3.6.1 Functions of two Variables Directional Derivatives Let us first quickly review, one more time, te
More informationSection 2.3: Calculating Limits using the Limit Laws
Section 2.3: Calculating Limits using te Limit Laws In previous sections, we used graps and numerics to approimate te value of a it if it eists. Te problem wit tis owever is tat it does not always give
More information8/6/2010 Assignment Previewer
Week 4 Friday Homework (1321979) Question 1234567891011121314151617181920 1. Question DetailsSCalcET6 2.7.003. [1287988] Consider te parabola y 7x - x 2. (a) Find te slope of te tangent line to te parabola
More informationLesson 6 MA Nick Egbert
Overview From kindergarten we all know ow to find te slope of a line: rise over run, or cange in over cange in. We want to be able to determine slopes of functions wic are not lines. To do tis we use te
More informationLinear Interpolating Splines
Jim Lambers MAT 772 Fall Semester 2010-11 Lecture 17 Notes Tese notes correspond to Sections 112, 11, and 114 in te text Linear Interpolating Splines We ave seen tat ig-degree polynomial interpolation
More information19.2 Surface Area of Prisms and Cylinders
Name Class Date 19 Surface Area of Prisms and Cylinders Essential Question: How can you find te surface area of a prism or cylinder? Resource Locker Explore Developing a Surface Area Formula Surface area
More informationMaterials: Whiteboard, TI-Nspire classroom set, quadratic tangents program, and a computer projector.
Adam Clinc Lesson: Deriving te Derivative Grade Level: 12 t grade, Calculus I class Materials: Witeboard, TI-Nspire classroom set, quadratic tangents program, and a computer projector. Goals/Objectives:
More informationCHAPTER 7: TRANSCENDENTAL FUNCTIONS
7.0 Introduction and One to one Functions Contemporary Calculus 1 CHAPTER 7: TRANSCENDENTAL FUNCTIONS Introduction In te previous capters we saw ow to calculate and use te derivatives and integrals of
More information13.5 DIRECTIONAL DERIVATIVES and the GRADIENT VECTOR
13.5 Directional Derivatives and te Gradient Vector Contemporary Calculus 1 13.5 DIRECTIONAL DERIVATIVES and te GRADIENT VECTOR Directional Derivatives In Section 13.3 te partial derivatives f x and f
More information1 Finding Trigonometric Derivatives
MTH 121 Fall 2008 Essex County College Division of Matematics Hanout Version 8 1 October 2, 2008 1 Fining Trigonometric Derivatives 1.1 Te Derivative as a Function Te efinition of te erivative as a function
More informationHaar Transform CS 430 Denbigh Starkey
Haar Transform CS Denbig Starkey. Background. Computing te transform. Restoring te original image from te transform 7. Producing te transform matrix 8 5. Using Haar for lossless compression 6. Using Haar
More information12.2 Investigate Surface Area
Investigating g Geometry ACTIVITY Use before Lesson 12.2 12.2 Investigate Surface Area MATERIALS grap paper scissors tape Q U E S T I O N How can you find te surface area of a polyedron? A net is a pattern
More informationMTH-112 Quiz 1 - Solutions
MTH- Quiz - Solutions Words in italics are for eplanation purposes onl (not necessar to write in te tests or. Determine weter te given relation is a function. Give te domain and range of te relation. {(,
More informationPiecewise Polynomial Interpolation, cont d
Jim Lambers MAT 460/560 Fall Semester 2009-0 Lecture 2 Notes Tese notes correspond to Section 4 in te text Piecewise Polynomial Interpolation, cont d Constructing Cubic Splines, cont d Having determined
More information1.4 RATIONAL EXPRESSIONS
6 CHAPTER Fundamentals.4 RATIONAL EXPRESSIONS Te Domain of an Algebraic Epression Simplifying Rational Epressions Multiplying and Dividing Rational Epressions Adding and Subtracting Rational Epressions
More information12.2 Techniques for Evaluating Limits
335_qd /4/5 :5 PM Page 863 Section Tecniques for Evaluating Limits 863 Tecniques for Evaluating Limits Wat ou sould learn Use te dividing out tecnique to evaluate its of functions Use te rationalizing
More informationBounding Tree Cover Number and Positive Semidefinite Zero Forcing Number
Bounding Tree Cover Number and Positive Semidefinite Zero Forcing Number Sofia Burille Mentor: Micael Natanson September 15, 2014 Abstract Given a grap, G, wit a set of vertices, v, and edges, various
More information12.2 TECHNIQUES FOR EVALUATING LIMITS
Section Tecniques for Evaluating Limits 86 TECHNIQUES FOR EVALUATING LIMITS Wat ou sould learn Use te dividing out tecnique to evaluate its of functions Use te rationalizing tecnique to evaluate its of
More information, 1 1, A complex fraction is a quotient of rational expressions (including their sums) that result
RT. Complex Fractions Wen working wit algebraic expressions, sometimes we come across needing to simplify expressions like tese: xx 9 xx +, xx + xx + xx, yy xx + xx + +, aa Simplifying Complex Fractions
More informationNotes: Dimensional Analysis / Conversions
Wat is a unit system? A unit system is a metod of taking a measurement. Simple as tat. We ave units for distance, time, temperature, pressure, energy, mass, and many more. Wy is it important to ave a standard?
More information6 Computing Derivatives the Quick and Easy Way
Jay Daigle Occiental College Mat 4: Calculus Experience 6 Computing Derivatives te Quick an Easy Way In te previous section we talke about wat te erivative is, an we compute several examples, an ten we
More informationLimits and Continuity
CHAPTER Limits and Continuit. Rates of Cange and Limits. Limits Involving Infinit.3 Continuit.4 Rates of Cange and Tangent Lines An Economic Injur Level (EIL) is a measurement of te fewest number of insect
More informationYou Try: A. Dilate the following figure using a scale factor of 2 with center of dilation at the origin.
1 G.SRT.1-Some Tings To Know Dilations affect te size of te pre-image. Te pre-image will enlarge or reduce by te ratio given by te scale factor. A dilation wit a scale factor of 1> x >1enlarges it. A dilation
More informationMAC-CPTM Situations Project
raft o not use witout permission -P ituations Project ituation 20: rea of Plane Figures Prompt teacer in a geometry class introduces formulas for te areas of parallelograms, trapezoids, and romi. e removes
More informationz = x 2 xy + y 2 clf // c6.1(2)contour Change to make a contour plot of z=xy.
190 Lecture 6 3D equations formatting Open Lecture 6. See Capter 3, 10 of text for details. Draw a contour grap and a 3D grap of z = 1 x 2 y 2 = an upper emispere. For Classwork 1 and 2, you will grap
More informationCubic smoothing spline
Cubic smooting spline Menu: QCExpert Regression Cubic spline e module Cubic Spline is used to fit any functional regression curve troug data wit one independent variable x and one dependent random variable
More informationYou should be able to visually approximate the slope of a graph. The slope m of the graph of f at the point x, f x is given by
Section. Te Tangent Line Problem 89 87. r 5 sin, e, 88. r sin sin Parabola 9 9 Hperbola e 9 9 9 89. 7,,,, 5 7 8 5 ortogonal 9. 5, 5,, 5, 5. Not multiples of eac oter; neiter parallel nor ortogonal 9.,,,
More informationChapter K. Geometric Optics. Blinn College - Physics Terry Honan
Capter K Geometric Optics Blinn College - Pysics 2426 - Terry Honan K. - Properties of Ligt Te Speed of Ligt Te speed of ligt in a vacuum is approximately c > 3.0µ0 8 mês. Because of its most fundamental
More informationNumerical Derivatives
Lab 15 Numerical Derivatives Lab Objective: Understand and implement finite difference approximations of te derivative in single and multiple dimensions. Evaluate te accuracy of tese approximations. Ten
More informationThe Euler and trapezoidal stencils to solve d d x y x = f x, y x
restart; Te Euler and trapezoidal stencils to solve d d x y x = y x Te purpose of tis workseet is to derive te tree simplest numerical stencils to solve te first order d equation y x d x = y x, and study
More information2.3 Additional Relations
3 2.3 Additional Relations Figure 2.3 identiies additional relations, indicating te locations o te object and image, and te ratio o teir eigts (magniication) and orientations. Ray enters te lens parallel
More informationAreas of Triangles and Parallelograms. Bases of a parallelogram. Height of a parallelogram THEOREM 11.3: AREA OF A TRIANGLE. a and its corresponding.
11.1 Areas of Triangles and Parallelograms Goal p Find areas of triangles and parallelograms. Your Notes VOCABULARY Bases of a parallelogram Heigt of a parallelogram POSTULATE 4: AREA OF A SQUARE POSTULATE
More informationCSE 332: Data Structures & Parallelism Lecture 8: AVL Trees. Ruth Anderson Winter 2019
CSE 2: Data Structures & Parallelism Lecture 8: AVL Trees Rut Anderson Winter 29 Today Dictionaries AVL Trees /25/29 2 Te AVL Balance Condition: Left and rigt subtrees of every node ave eigts differing
More information3.5 Indeterminate Forms. Consider the function given by the rule f(x) = Whenever direct substitution into lim x c f(x) yields a 0 0
3.5 Indeterminate Forms Introduction; Consider the function given by the rule f() = ; its graph is shown below. 0 0 situations Clearly, = 3. Note, however, that if one merely tried to plug in 0 for when
More informationeach node in the tree, the difference in height of its two subtrees is at the most p. AVL tree is a BST that is height-balanced-1-tree.
Data Structures CSC212 1 AVL Trees A binary tree is a eigt-balanced-p-tree if for eac node in te tree, te difference in eigt of its two subtrees is at te most p. AVL tree is a BST tat is eigt-balanced-tree.
More information2.5 Evaluating Limits Algebraically
SECTION.5 Evaluating Limits Algebraically 3.5 Evaluating Limits Algebraically Preinary Questions. Wic of te following is indeterminate at x? x C x ; x x C ; x x C 3 ; x C x C 3 At x, x isofteform 0 xc3
More informationVOLUMES. The volume of a cylinder is determined by multiplying the cross sectional area by the height. r h V. a) 10 mm 25 mm.
OLUME OF A CYLINDER OLUMES Te volume of a cylinder is determined by multiplying te cross sectional area by te eigt. r Were: = volume r = radius = eigt Exercise 1 Complete te table ( =.14) r a) 10 mm 5
More informationClassify solids. Find volumes of prisms and cylinders.
11.4 Volumes of Prisms and Cylinders Essential Question How can you find te volume of a prism or cylinder tat is not a rigt prism or rigt cylinder? Recall tat te volume V of a rigt prism or a rigt cylinder
More informationAreas of Parallelograms and Triangles. To find the area of parallelograms and triangles
10-1 reas of Parallelograms and Triangles ommon ore State Standards G-MG..1 Use geometric sapes, teir measures, and teir properties to descrie ojects. G-GPE..7 Use coordinates to compute perimeters of
More information5.4 Sum and Difference Formulas
380 Capter 5 Analtic Trigonometr 5. Sum and Difference Formulas Using Sum and Difference Formulas In tis section and te following section, ou will stud te uses of several trigonometric identities and formulas.
More informationAnnouncements. Lilian s office hours rescheduled: Fri 2-4pm HW2 out tomorrow, due Thursday, 7/7. CSE373: Data Structures & Algorithms
Announcements Lilian s office ours resceduled: Fri 2-4pm HW2 out tomorrow, due Tursday, 7/7 CSE373: Data Structures & Algoritms Deletion in BST 2 5 5 2 9 20 7 0 7 30 Wy migt deletion be arder tan insertion?
More informationInterference and Diffraction of Light
Interference and Diffraction of Ligt References: [1] A.P. Frenc: Vibrations and Waves, Norton Publ. 1971, Capter 8, p. 280-297 [2] PASCO Interference and Diffraction EX-9918 guide (written by Ann Hanks)
More informationCE 221 Data Structures and Algorithms
CE Data Structures and Algoritms Capter 4: Trees (AVL Trees) Text: Read Weiss, 4.4 Izmir University of Economics AVL Trees An AVL (Adelson-Velskii and Landis) tree is a binary searc tree wit a balance
More information( )( ) ( ) MTH 95 Practice Test 1 Key = 1+ x = f x. g. ( ) ( ) The only zero of f is 7 2. The only solution to g( x ) = 4 is 2.
Mr. Simonds MTH 95 Class MTH 95 Practice Test 1 Key 1. a. g ( ) ( ) + 4( ) 4 1 c. f ( x) 7 7 7 x 14 e. + 7 + + 4 f g 1+ g. f 4 + 4 7 + 1+ i. g ( 4) ( 4) + 4( 4) k. g( x) x 16 + 16 0 x 4 + 4 4 0 x 4x+ 4
More information15-122: Principles of Imperative Computation, Summer 2011 Assignment 6: Trees and Secret Codes
15-122: Principles of Imperative Computation, Summer 2011 Assignment 6: Trees and Secret Codes William Lovas (wlovas@cs) Karl Naden Out: Tuesday, Friday, June 10, 2011 Due: Monday, June 13, 2011 (Written
More informationOur Calibrated Model has No Predictive Value: An Example from the Petroleum Industry
Our Calibrated Model as No Predictive Value: An Example from te Petroleum Industry J.N. Carter a, P.J. Ballester a, Z. Tavassoli a and P.R. King a a Department of Eart Sciences and Engineering, Imperial
More informationANTENNA SPHERICAL COORDINATE SYSTEMS AND THEIR APPLICATION IN COMBINING RESULTS FROM DIFFERENT ANTENNA ORIENTATIONS
NTNN SPHRICL COORDINT SSTMS ND THIR PPLICTION IN COMBINING RSULTS FROM DIFFRNT NTNN ORINTTIONS llen C. Newell, Greg Hindman Nearfield Systems Incorporated 133. 223 rd St. Bldg. 524 Carson, C 9745 US BSTRCT
More informationMeasuring Length 11and Area
Measuring Lengt 11and Area 11.1 Areas of Triangles and Parallelograms 11.2 Areas of Trapezoids, Romuses, and Kites 11.3 Perimeter and Area of Similar Figures 11.4 Circumference and Arc Lengt 11.5 Areas
More informationFault Localization Using Tarantula
Class 20 Fault localization (cont d) Test-data generation Exam review: Nov 3, after class to :30 Responsible for all material up troug Nov 3 (troug test-data generation) Send questions beforeand so all
More informationPLK-B SERIES Technical Manual (USA Version) CLICK HERE FOR CONTENTS
PLK-B SERIES Technical Manual (USA Version) CLICK ERE FOR CONTENTS CONTROL BOX PANEL MOST COMMONLY USED FUNCTIONS INITIAL READING OF SYSTEM SOFTWARE/PAGES 1-2 RE-INSTALLATION OF TE SYSTEM SOFTWARE/PAGES
More informationAll truths are easy to understand once they are discovered; the point is to discover them. Galileo
Section 7. olume All truts are easy to understand once tey are discovered; te point is to discover tem. Galileo Te main topic of tis section is volume. You will specifically look at ow to find te volume
More informationThe (, D) and (, N) problems in double-step digraphs with unilateral distance
Electronic Journal of Grap Teory and Applications () (), Te (, D) and (, N) problems in double-step digraps wit unilateral distance C Dalfó, MA Fiol Departament de Matemàtica Aplicada IV Universitat Politècnica
More informationData Structures and Programming Spring 2014, Midterm Exam.
Data Structures and Programming Spring 2014, Midterm Exam. 1. (10 pts) Order te following functions 2.2 n, log(n 10 ), 2 2012, 25n log(n), 1.1 n, 2n 5.5, 4 log(n), 2 10, n 1.02, 5n 5, 76n, 8n 5 + 5n 2
More informationMulti-Stack Boundary Labeling Problems
Multi-Stack Boundary Labeling Problems Micael A. Bekos 1, Micael Kaufmann 2, Katerina Potika 1 Antonios Symvonis 1 1 National Tecnical University of Atens, Scool of Applied Matematical & Pysical Sciences,
More informationWrap up Amortized Analysis; AVL Trees. Riley Porter Winter CSE373: Data Structures & Algorithms
CSE 373: Data Structures & Wrap up Amortized Analysis; AVL Trees Riley Porter Course Logistics Symposium offered by CSE department today HW2 released, Big- O, Heaps (lecture slides ave pseudocode tat will
More informationTHANK YOU FOR YOUR PURCHASE!
THANK YOU FOR YOUR PURCHASE! Te resources included in tis purcase were designed and created by me. I ope tat you find tis resource elpful in your classroom. Please feel free to contact me wit any questions
More informationNOTES: A quick overview of 2-D geometry
NOTES: A quick overview of 2-D geometry Wat is 2-D geometry? Also called plane geometry, it s te geometry tat deals wit two dimensional sapes flat tings tat ave lengt and widt, suc as a piece of paper.
More informationSection 3. Imaging With A Thin Lens
Section 3 Imaging Wit A Tin Lens 3- at Ininity An object at ininity produces a set o collimated set o rays entering te optical system. Consider te rays rom a inite object located on te axis. Wen te object
More informationAnnouncements SORTING. Prelim 1. Announcements. A3 Comments 9/26/17. This semester s event is on Saturday, November 4 Apply to be a teacher!
Announcements 2 "Organizing is wat you do efore you do someting, so tat wen you do it, it is not all mixed up." ~ A. A. Milne SORTING Lecture 11 CS2110 Fall 2017 is a program wit a teac anyting, learn
More informationEXERCISES 6.1. Cross-Sectional Areas. 6.1 Volumes by Slicing and Rotation About an Axis 405
6. Volumes b Slicing and Rotation About an Ais 5 EXERCISES 6. Cross-Sectional Areas In Eercises and, find a formula for te area A() of te crosssections of te solid perpendicular to te -ais.. Te solid lies
More informationHash-Based Indexes. Chapter 11. Comp 521 Files and Databases Fall
Has-Based Indexes Capter 11 Comp 521 Files and Databases Fall 2012 1 Introduction Hasing maps a searc key directly to te pid of te containing page/page-overflow cain Doesn t require intermediate page fetces
More information( ) ( ) Mat 241 Homework Set 5 Due Professor David Schultz. x y. 9 4 The domain is the interior of the hyperbola.
Mat 4 Homework Set 5 Due Professor David Scultz Directions: Sow all algebraic steps neatly and concisely using proper matematical symbolism. Wen graps and tecnology are to be implemented, do so appropriately.
More informationMean Waiting Time Analysis in Finite Storage Queues for Wireless Cellular Networks
Mean Waiting Time Analysis in Finite Storage ueues for Wireless ellular Networks J. YLARINOS, S. LOUVROS, K. IOANNOU, A. IOANNOU 3 A.GARMIS 2 and S.KOTSOOULOS Wireless Telecommunication Laboratory, Department
More informationWhen a BST becomes badly unbalanced, the search behavior can degenerate to that of a sorted linked list, O(N).
Balanced Binary Trees Binary searc trees provide O(log N) searc times provided tat te nodes are distributed in a reasonably balanced manner. Unfortunately, tat is not always te case and performing a sequence
More informationHash-Based Indexes. Chapter 11. Comp 521 Files and Databases Spring
Has-Based Indexes Capter 11 Comp 521 Files and Databases Spring 2010 1 Introduction As for any index, 3 alternatives for data entries k*: Data record wit key value k
More informationAffine and Projective Transformations
CS 674: Intro to Computer Vision Affine and Projective Transformations Prof. Adriana Kovaska Universit of Pittsburg October 3, 26 Alignment problem We previousl discussed ow to matc features across images,
More informationCESILA: Communication Circle External Square Intersection-Based WSN Localization Algorithm
Sensors & Transducers 2013 by IFSA ttp://www.sensorsportal.com CESILA: Communication Circle External Square Intersection-Based WSN Localization Algoritm Sun Hongyu, Fang Ziyi, Qu Guannan College of Computer
More informationCoarticulation: An Approach for Generating Concurrent Plans in Markov Decision Processes
Coarticulation: An Approac for Generating Concurrent Plans in Markov Decision Processes Kasayar Roanimanes kas@cs.umass.edu Sridar Maadevan maadeva@cs.umass.edu Department of Computer Science, University
More informationWhen the dimensions of a solid increase by a factor of k, how does the surface area change? How does the volume change?
8.4 Surface Areas and Volumes of Similar Solids Wen te dimensions of a solid increase by a factor of k, ow does te surface area cange? How does te volume cange? 1 ACTIVITY: Comparing Surface Areas and
More informationTHE POSSIBILITY OF ESTIMATING THE VOLUME OF A SQUARE FRUSTRUM USING THE KNOWN VOLUME OF A CONICAL FRUSTRUM
THE POSSIBILITY OF ESTIMATING THE VOLUME OF A SQUARE FRUSTRUM USING THE KNOWN VOLUME OF A CONICAL FRUSTRUM SAMUEL OLU OLAGUNJU Adeyemi College of Education NIGERIA Email: lagsam04@aceondo.edu.ng ABSTRACT
More informationLocal features and image matching May 8 th, 2018
Local features and image matcing May 8 t, 2018 Yong Jae Lee UC Davis Last time RANSAC for robust fitting Lines, translation Image mosaics Fitting a 2D transformation Homograpy 2 Today Mosaics recap: How
More informationThe impact of simplified UNBab mapping function on GPS tropospheric delay
Te impact of simplified UNBab mapping function on GPS troposperic delay Hamza Sakidin, Tay Coo Cuan, and Asmala Amad Citation: AIP Conference Proceedings 1621, 363 (2014); doi: 10.1063/1.4898493 View online:
More informationIntroduction to Computer Graphics 5. Clipping
Introduction to Computer Grapics 5. Clipping I-Cen Lin, Assistant Professor National Ciao Tung Univ., Taiwan Textbook: E.Angel, Interactive Computer Grapics, 5 t Ed., Addison Wesley Ref:Hearn and Baker,
More informationFast Calculation of Thermodynamic Properties of Water and Steam in Process Modelling using Spline Interpolation
P R E P R N T CPWS XV Berlin, September 8, 008 Fast Calculation of Termodynamic Properties of Water and Steam in Process Modelling using Spline nterpolation Mattias Kunick a, Hans-Joacim Kretzscmar a,
More informationTilings of rectangles with T-tetrominoes
Tilings of rectangles wit T-tetrominoes Micael Korn and Igor Pak Department of Matematics Massacusetts Institute of Tecnology Cambridge, MA, 2139 mikekorn@mit.edu, pak@mat.mit.edu August 26, 23 Abstract
More informationA geometric analysis of heuristic search
A geometric analysis of euristic searc by GORDON J. VANDERBRUG University of Maryland College Park, Maryland ABSTRACT Searc spaces for various types of problem representations can be represented in one
More informationImplementation of Integral based Digital Curvature Estimators in DGtal
Implementation of Integral based Digital Curvature Estimators in DGtal David Coeurjolly 1, Jacques-Olivier Lacaud 2, Jérémy Levallois 1,2 1 Université de Lyon, CNRS INSA-Lyon, LIRIS, UMR5205, F-69621,
More informationInvestigating an automated method for the sensitivity analysis of functions
Investigating an automated metod for te sensitivity analysis of functions Sibel EKER s.eker@student.tudelft.nl Jill SLINGER j..slinger@tudelft.nl Delft University of Tecnology 2628 BX, Delft, te Neterlands
More informationVector Processing Contours
Vector Processing Contours Andrey Kirsanov Department of Automation and Control Processes MAMI Moscow State Tecnical University Moscow, Russia AndKirsanov@yandex.ru A.Vavilin and K-H. Jo Department of
More informationAVL Trees Outline and Required Reading: AVL Trees ( 11.2) CSE 2011, Winter 2017 Instructor: N. Vlajic
1 AVL Trees Outline and Required Reading: AVL Trees ( 11.2) CSE 2011, Winter 2017 Instructor: N. Vlajic AVL Trees 2 Binary Searc Trees better tan linear dictionaries; owever, te worst case performance
More informationEfficient and Not-So-Efficient Algorithms. NP-Complete Problems. Search Problems. Propositional Logic. DPV Chapter 8: NP-Complete Problems, Part 1
Efficient and Not-So-Efficient Algoritms NP-Complete Problems DPV Capter 8: NP-Complete Problems, Part 1 Jim Royer EECS November 24, 2009 Problem spaces tend to be big: A grap on n vertices can ave up
More informationSymmetric Tree Replication Protocol for Efficient Distributed Storage System*
ymmetric Tree Replication Protocol for Efficient Distributed torage ystem* ung Cune Coi 1, Hee Yong Youn 1, and Joong up Coi 2 1 cool of Information and Communications Engineering ungkyunkwan University
More information1 Copyright 2012 by Pearson Education, Inc. All Rights Reserved.
CHAPTER 20 AVL Trees Objectives To know wat an AVL tree is ( 20.1). To understand ow to rebalance a tree using te LL rotation, LR rotation, RR rotation, and RL rotation ( 20.2). To know ow to design te
More informationRead pages in the book, up to the investigation. Pay close attention to Example A and how to identify the height.
C 8 Noteseet L Key In General ON LL PROBLEMS!!. State te relationsip (or te formula).. Sustitute in known values. 3. Simplify or Solve te equation. Use te order of operations in te correct order. Order
More informationMAPI Computer Vision
MAPI Computer Vision Multiple View Geometry In tis module we intend to present several tecniques in te domain of te 3D vision Manuel Joao University of Mino Dep Industrial Electronics - Applications -
More informationNonlinear Control(FRTN05)
Nonlinear Control(FRTN05) troduction to Simulink Last updated: Spring of 204 Contents Te exercise is intended as an introduction into Simulink and te Control System Toolbox. It can be performed in Matlab
More informationM2TECH HIFACE DAC 384KHZ/32BIT DIGITAL-TO-ANALOG CONVERTER USER MANUAL
M2TECH HIFACE DAC 384KHZ/32BIT DIGITAL-TO-ANALOG CONVERTER USER MANUAL REV. 1.1 5/2013 Warning! Canges or modifications not autorized by te manufacturer can invalidate te compliance to CE regulations and
More informationBinary Search Tree - Best Time. AVL Trees. Binary Search Tree - Worst Time. Balanced and unbalanced BST
AL Trees CSE Data Structures Unit Reading: Section 4.4 Binary Searc Tree - Best Time All BST operations are O(d), were d is tree dept minimum d is d = log for a binary tree N wit N nodes at is te best
More informationFourth-order NMO velocity for P-waves in layered orthorhombic media vs. offset-azimuth
Fourt-order NMO velocity for P-waves in layered orrombic media vs. set-azimut Zvi Koren* and Igor Ravve Paradigm Geopysical Summary We derive te fourt-order NMO velocity of compressional waves for a multi-layer
More informationSORTING 9/26/18. Prelim 1. Prelim 1. Why Sorting? InsertionSort. Some Sorting Algorithms. Tonight!!!! Two Sessions:
Prelim 1 2 "Organizing is wat you do efore you do someting, so tat wen you do it, it is not all mixed up." ~ A. A. Milne SORTING Tonigt!!!! Two Sessions: You sould now y now wat room to tae te final. Jenna
More informationDerivatives and Graphs of Functions
Derivatives and Graphs of Functions September 8, 2014 2.2 Second Derivatives, Concavity, and Graphs In the previous section, we discussed how our derivatives can be used to obtain useful information about
More informationComputing geodesic paths on manifolds
Proc. Natl. Acad. Sci. USA Vol. 95, pp. 8431 8435, July 1998 Applied Matematics Computing geodesic pats on manifolds R. Kimmel* and J. A. Setian Department of Matematics and Lawrence Berkeley National
More informationCS 234. Module 6. October 16, CS 234 Module 6 ADT Dictionary 1 / 33
CS 234 Module 6 October 16, 2018 CS 234 Module 6 ADT Dictionary 1 / 33 Idea for an ADT Te ADT Dictionary stores pairs (key, element), were keys are distinct and elements can be any data. Notes: Tis is
More informationA Cost Model for Distributed Shared Memory. Using Competitive Update. Jai-Hoon Kim Nitin H. Vaidya. Department of Computer Science
A Cost Model for Distributed Sared Memory Using Competitive Update Jai-Hoon Kim Nitin H. Vaidya Department of Computer Science Texas A&M University College Station, Texas, 77843-3112, USA E-mail: fjkim,vaidyag@cs.tamu.edu
More information