CS 331 Design and Analysis of Algorithms. -- Divide and Conquer. Dr. Daisy Tang
|
|
- Eugene Benson
- 5 years ago
- Views:
Transcription
1 CS 33 Desig d Alysis of Algorithms -- Divide d Coquer Dr. Disy Tg
2 Divide-Ad-Coquer Geerl ide: Divide problem ito subproblems of the sme id; solve subproblems usig the sme pproh, d ombie prtil solutios, if eessry.
3 Problem : Fid the Mx d Mi Give uordered list of elemets, fid mx d mi The strightforwrd lgorithm: mx mi A[0]; for i to - do if A[i] > mx mx A[i]; if A[i] < mi mi A[i]; # of ey omprisos: 3
4 Divide-d-Coquer Approh List List List elemets / elemets / elemets mi, mx mi, mx mi, mx mi = MIN mi, mi mx = MAX mx, mx 4
5 The Divide-d-Coquer lgorithm: proedure Rmxmi i, j, fmx, fmi; // i, j re idex #, fmx, { // fmi re output prmeters se: i = j: fmx fmi A[i]; i = j : if A[i] < A[j] the fmx A[j]; fmi A[i]; else fmx A[i]; fmi A[j]; else: mid i j ; } ed se ll Rmxmi i, mid, gmx, gmi; ll Rmxmi mid+, j, hmx, hmi; fmx MAX gmx, hmx; fmi MIN gmi, hmi; 5
6 Exmple: fid mx d mi i the followig rry:, 3, -5, -8, 5, 60, 7, 3, 47 = 9 Idex: Arry: Rmxmi0, 8, 60, , 4,, -8 5, 8, 60, ,,, -5 3, 4, 5, -8 5,6, 60, 7 7, 8, 47, ,,, 3,,-5, -5
7 Alysis of Reursio 7 For lgorithms with reursive lls, we defie reurree reltio to fid its omplexity Let T be the umber of ey omprisos eeded to Rmxmi Reurree reltio otherwise T T 0
8 T T T T T T T Reursio rehes bse ses whe / =, thus = + d = log -, reple bove, we got.5 /... log log log O T
9 I Clss Exerise # Defie the followig reurree reltio d solve it to fid the time omplexity it Qit { if retur ; else retur Q/5+Q/5; } 9
10 Theorem 0 Theorem: Clim: where, b, re ostts They do t hve to be the sme ostt. We me them the sme here for simpliity. It will ot ffet the overll result. O Log O O T Log b T b T
11 Proof: i i b b b b b b b b T b T b b b T b b T b b T T Stops whe = for some iteger b T T
12 if <, i0 i is ostt T = b ostt T = O if =, i i0 T b i0 b Log b O Log
13 3 if >, 0 Log Log Log i i O b b b b b b T 0 i i
14 Problem : Iteger Multiplitio The problem: Multiply two lrge itegers, eh of digits Exmple: 3x4 The trditiol wy: Eh of the digits of the first umber is multiplied by eh of the digits of the seod umber Use two loops, it tes O opertios 4
15 The Divide-d-Coquer Wy Suppose x d y re lrge itegers, divide x ito two prts d b, d divide y ito d d We trsform the problem of multiplyig two -digit itegers ito four sub-problems of multiplyig two / digit itegers x y x y b x 0 b d y 0 d 0 0 b 0 bd 0 d d b 5
16 Alysis So the reurree reltio is: No improvemet over trditiol method Isted, if we write: x y 0 0 bd 0 bd 0 d b Now we hve three subproblems T 3T b Log 3.58 O O T 4T b Log 4 O O b d bd 6
17 The lgorithm by Divide-d-Coquer: proedure multiplitio x,y { if x = 0 or y = 0, retur 0; = MAX # of digits i x, # of digits i y; if =, retur x y i the usul wy; else m = ; = x divide 0 m ; b = x mod 0 m ; = y divide 0 m ; d = y mod 0 m ; p= multiplitio, ; p= multiplitio b, d; p3 = multiplitio +b, +d; m m retur p 0 p 0 p3 p p ; } 7
18 Exmple: x = 43, y = 56 P x = 43 y = 56 = 3 m = = 4 b = 3 = 5 d = 6 P = P P = 8 P 3 = P P = P x = 4 y = 5 = m = = b = 4 = d = 5 P = P = 0 P 3 = 35 P = 350 P x = 7 y = 3 = m = = b = 7 = 3 d = P = 3 P = 7 P 3 = 3 P = 57 8
19 Your Exerise: x = 37 d y =3 P x = 37 y = 3 = 3 m = = b = = d = P = P P = P 3 = P P = P x = y = = m = = b = = d = P = P = P 3 = P = P x = y = = m = = b = = d = P = P = P 3 = P P = P x = y = = m = = b = = d = P = P = P 3 = P = 9
20 Problem #3: MergeSort Give list of umbers, sort them i o-desedig order Ide: split ito two sublists of similr size, sort idividul sublist d merge the sorted sublists The lgorithm: proedure MergeSort low, high { } if the low high mid low high ; ll MergeSort low, mid; ll MergeSort mid+, high; ll Merge low, mid, high; 0
21 MergeSort Exmple A = {7, 0,, 0, 5, 3, 5, }
22 proedure Merge low, mid, high { i low, j mid, low; while i mid d j high if A[i] A[j], the } else U[] A[j]; j++; U[] A[i]; i++; ++; if i > mid move A[j]..A[high] to U[]..U[high]; else move A[i]..A[mid] to U[]..U[high]; for p low to high A[p] U[p];
23 Alysis Worst se for MergeSort T T b O Log Best se? Averge se? I-ple sort? Does ot use y extr spe beyod tht eeded to store the iput 3
24 Problem 4: QuiSort Give list of umbers, sort them i odesedig order Ide: Divide-d-Coquer Split bsed o Pivot elemet Merge is ot eessry Compred with MergeSort 4
25 Prtitio Prtitio splits the set of elemets ito subsets A d B bsed o pivot p Suh tht xa < p < yb Choie of pivot is importt Strightforwrd pproh to prtitio? 5
26 [0] [] [] [3] [4] [5] [6] [7] [8] [9] [0] toobigidex Quisort toosmllidex Strtig t the begiig of the rry, we loo for the first elemet tht is greter th the pivot. toobigidex Strtig from the other ed we loo for the first vlue tht is less th or euql to the pivot. toosmllidex After fidig the two out-of-ple elemets, exhge them. toobigidex++ toosmllidex - - Stop whe two idies ross eh other 6
27 [0] [] [] [3] [4] [5] [6] [7] [8] [9] [0] toobigidex toosmllidex toobigidex toosmllidex toobigidex toosmllidex 7
28 toosmllidex toobigidex Pivot 40 is i its fil positio 8
29 The lgorithm: proedure QuiSort p, q { if p < q, the ll Prtitio p, q, pivotpositio; ll QuiSort p, pivotpositio ; ll QuiSort pivotpositio+, q; } proedure Prtitio first, lst, pp // pp is retur vlue { } pivot = A[first]; tb = first + ; loop { } ts = lst; while tb <= lst && A[tb] < pivot { tb = tb+; } while ts > first &&A[ts] > pivot { ts = ts-; } if tb<ts the swp A[tb] d A[ts] else exit; A[first] = A[ts]; A[ts] = pivot; retur ts; //pivot positio 9
30 I-Clss Exerises # Sort E, X, A, M, P, L, E i lphbetil order by Mergesort d by Quisort. Show steps. Sort 65, 60, 60, 60 3 i oderesig order by Mergesort d by Quisort. Show steps. A sortig lgorithm is lled stble if it preserves the reltive order of y two equl elemets i its iput. Is Mergesort stble? Is Quisort stble? 30
31 Alysis Worst se Pivot is either mi or mx O, how to prove? Worse th MergeSort Best se Split the list evely Olog 3
32 Averge Cse Assume pivot is seleted rdomly, so the probbility of pivot beig the th elemet is equl prob pivot, Let C = # of ey ompriso for items C C Averge it over ll C A represets the vg. omplexity for sortig umbers by QuiSort C A C A C A 3
33 33 Multiply both side by Reple by - Subtrt from 0 C C C C A A A A 0 C C C A A A C C C C C A A A A A C C C A A A
34 34 divide + for both sides Best-Cse = Averge-Cse = OLog : 3 3 Log O Log Log C Log Log d C boudry se C Note C C C C e e A e e A A A A A A
35 Summry for QuiSort Bsed o experimetl results The verge performe of QuiSort is better th tht of the MergeSort Whe 6, isertio sort is fst We hge QuiSort little bit: do t prtitio the list whe 6, it speeds up QuiSort 35
36 I-Clss Exerises #3 Desig vrit biry serh reursive lgorithm whih splits the set ot ito sets of equl sizes, but ito sets of sizes oe third d two thirds. How does this lgorithm ompre with the origil biry serh i both the best se d the worst se? 36
37 Problem 5: Seletio The Problem: give list of elemets, fid the th smllest oe Speil ses: =, mi; =, mx Strtegies: Method : Sort the list d retur the th smllest oe, Olog Method : Sortig is ot required. Prtitio repetedly util we fid the th elemet Te dvtge of the Prtitio lgorithm i Quisort 37
38 Method If pivot_positio =, doe If pivot_positio >, fid the th elemet i the st sublist If pivot_positio <, fid the - pivot_positioth elemet i the d sublist 38
39 proedure Selet A,, // o-reursive lgorithm { m ; j ; loop ll Prtitio m, j, pivotpositio; se: = pivotpositio: retur A; < pivotpositio: j pivotpositio ; else: m pivotpositio + ; ed loop; } 39
40 Exmple A[] = {65, 70, 75, 80, 85, 60, 55, 50, 45} = 5 = 7 40
41 Alysis Best se O whe pivot is the th smllest oe Worst se O Prtitio will be lled O times d eh tes O steps 4
42 Method 3 By hoosig pivot more refully, we obti seletio lgorithm with worst se omplexity O How? Use mm medi of medis rule to hoose pivot elemets re divided ito /r groups of r elemets eh r is smll ostt, for iste, r = 5 or 7. The remiig r/r elemets re ot used. The medi m i of eh of these /r groups is foud. The the medi mm of m i s is foud. Now, we hoose mm s pivot so tht t lest some frtio of the elemets will be smller th pivot d t lest some other frtio of elemets will be greter th pivot. 4
43 Exmple 36 elemets divide ito 7 /r subsets of size 5 r Elemets mm Noderesig Order ll olums mm medi of medis The middle row is i o-deresig order Elemets mm 43
44 proedure Selet A,, { if r, the sort A d retur the th elemet; divide A ito r subset of size r eh, igore exess elemets d let M m, m,, be the set of medis of the subsets; m r V = Selet ; r } use Prtitio to prtitio A usig v s the pivot; // ow ssume v is t pivotpositio se: = pivotpositio: retur v; < pivotpositio: let S be the set of elemets A.. pivotpositio, retur Selet S, pivotpositio, ; else: let R be the set of elemet Apivotpositio+.., retur Selet R, pivotpositio, pivotpositio; ed se; 44
45 Exmple SeletA,, 7 Where A = {5, 30, 65, 70, 75, 80, 85, 60, 55, 50, 45} 45
46 Alysis: How my M i s or mm? At lest How my elemets or mm? At lest sie the medi of r elemets is the smllest elemet How my elemets > mm or < mm? At most Assume r = 5 So, R d S re t most 0.75 whe 4. 46
47 I-Clss Exerise #4 Write equivlet reursive lgorithm for SeletA,, give o slide 39 47
48 Problem 6: Mtrix Multiplitio Problem: Multiply two mtries A d B, eh of size x 48
49 Trditiol Wy Use three for loops 49
50 Divide-d-Coquer Wy Trsform the problem of multiplyig A d B, eh of size by, ito 8 subproblems, eh of size / by / I other words, C be omputed by 8 multiplitios d 4 dditios of / by / mtries 50
51 The imge prt with reltioship ID rid5 ws ot foud i the file. Exmple: Use Divide-d-Coquer to solve it s follows. First, fill 0 olums d rows to me = j for some iteger j. 5
52 Time Complexity of New Algorithm? where is the ost for dditio So, it is o improvemet ompred with the trditiol wy 5
53 Strsse s Mtrix Multiplitio Disovered wy to ompute the C ij s usig 7 multiplitios d 8 dditios or subtrtios 53
54
55 Alysis 55
56 Alysis, Cotiue 56
57 I-Clss Exerise #5 Apply Strsse s lgorithm to ompute the followig. Show the steps. 57
58 Whe NOT to use Divide-d-Coquer A problem of size is divided to or more subproblems, eh lmost of size A problem of size is divided ito lmost subproblems of size /, where is ostt 58
Merge Sort. Outline and Reading. Divide-and-Conquer. Divide-and-conquer paradigm ( 4.1.1) Merge-sort ( 4.1.1)
Merge Sort 7 2 9 4 2 4 7 9 7 2 2 7 9 4 4 9 7 7 2 2 9 9 4 4 Merge Sort versio 1.3 1 Outlie d Redig Divide-d-coquer prdigm ( 4.1.1 Merge-sort ( 4.1.1 Algorithm Mergig two sorted sequeces Merge-sort tree
More informationSimilar idea to multiplication in N, C. Divide and conquer approach provides unexpected improvements. Naïve matrix multiplication
Next. Covered bsics of simple desig techique (Divided-coquer) Ch. of the text.. Next, Strsse s lgorithm. Lter: more desig d coquer lgorithms: MergeSort. Solvig recurreces d the Mster Theorem. Similr ide
More informationIntroduction to Algorithms 6.046J/18.401J
Itrodutio to Algorithms.04J/8.40J The divide-d-oquer desig prdigm. Divide the problem (iste) ito subproblems.. Coquer the subproblems by solvig them reursively. 3. Combie subproblem solutios. Leture 3
More information5. Solving recurrences
5. Solvig recurreces Time Complexity Alysis of Merge Sort T( ) 0 if 1 2T ( / 2) otherwise sortig oth hlves mergig Q. How to prove tht the ru-time of merge sort is O( )? A. 2 Time Complexity Alysis of Merge
More informationLecture 4 Recursive Algorithm Analysis. Merge Sort Solving Recurrences The Master Theorem
Lecture 4 Recursive Algorithm Alysis Merge Sort Solvig Recurreces The Mster Theorem Merge Sort MergeSortA, left, right) { if left < right) { mid = floorleft + right) / 2); MergeSortA, left, mid); MergeSortA,
More informationIntroduction to Matrix Algebra
Itrodutio to Mtri Alger George H Olso, Ph D Dotorl Progrm i Edutiol Ledership Applhi Stte Uiversit Septemer Wht is mtri? Dimesios d order of mtri A p q dimesioed mtri is p (rows) q (olums) rr of umers,
More informationSection 11.5 Notes Page Partial Fraction Decomposition. . You will get: +. Therefore we come to the following: x x
Setio Notes Pge Prtil Frtio Deompositio Suppose we were sked to write the followig s sigle frtio: We would eed to get ommo deomitors: You will get: Distributig o top will give you: 8 This simplifies to:
More informationRecurrece reltio & Recursio 9 Chpter 3 Recurrece reltio & Recursio Recurrece reltio : A recurrece is equtio or iequlity tht describes fuctio i term of itself with its smller iputs. T T The problem of size
More informationNumbers (Part I) -- Solutions
Ley College -- For AMATYC SML Mth Competitio Cochig Sessios v.., [/7/00] sme s /6/009 versio, with presettio improvemets Numbers Prt I) -- Solutios. The equtio b c 008 hs solutio i which, b, c re distict
More informationAlgorithms. Elementary Sorting. Dong Kyue Kim Hanyang University
Algorithms Elemetary Sortig Dog Kyue Kim Hayag Uiversity dqkim@hayag.a.kr Cotets Sortig problem Elemetary sortig algorithms Isertio sort Merge sort Seletio sort Bubble sort Sortig problem Iput A sequee
More informationPresentation for use with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, Divide-and-Conquer
Presettio for use with the textook, Algorithm Desig d Applictios, y M. T. Goodrich d R. Tmssi, Wiley, 25 Divide-d-Coquer Divide-d-Coquer Divide-d coquer is geerl lgorithm desig prdigm: Divide: divide the
More informationECE 102 Engineering Computation
ECE Egieerig Computtio Phillip Wog Mth Review Vetor Bsis Mtri Bsis System of Lier Equtios Summtio Symol is the symol for summtio. Emple: N k N... 9 k k k k k the, If e e e f e f k Vetor Bsis A vetor is
More informationRiemann Integral Oct 31, such that
Riem Itegrl Ot 31, 2007 Itegrtio of Step Futios A prtitio P of [, ] is olletio {x k } k=0 suh tht = x 0 < x 1 < < x 1 < x =. More suitly, prtitio is fiite suset of [, ] otiig d. It is helpful to thik of
More informationChapter 2. LOGARITHMS
Chpter. LOGARITHMS Dte: - 009 A. INTRODUCTION At the lst hpter, you hve studied bout Idies d Surds. Now you re omig to Logrithms. Logrithm is ivers of idies form. So Logrithms, Idies, d Surds hve strog
More informationDynamics of Structures
UNION Dymis of Strutures Prt Zbigiew Wójii Je Grosel Projet o-fied by Europe Uio withi Europe Soil Fud UNION Mtries Defiitio of mtri mtri is set of umbers or lgebri epressios rrged i retgulr form with
More informationICS141: Discrete Mathematics for Computer Science I
ICS4: Discrete Mthemtics for Computer Sciece I Dept. Iformtio & Computer Sci., J Stelovsky sed o slides y Dr. Bek d Dr. Still Origils y Dr. M. P. Frk d Dr. J.L. Gross Provided y McGrw-Hill 3- Quiz. gcd(84,96).
More informationSection 2.2. Matrix Multiplication
Mtri Alger Mtri Multiplitio Setio.. Mtri Multiplitio Mtri multiplitio is little more omplite th mtri itio or slr multiplitio. If A is the prout A of A is the ompute s follow: m mtri, the is k mtri, 9 m
More informationError-free compression
Error-free compressio Useful i pplictio where o loss of iformtio is tolerble. This mybe due to ccurcy requiremets, legl requiremets, or less th perfect qulity of origil imge. Compressio c be chieved by
More information0 otherwise. sin( nx)sin( kx) 0 otherwise. cos( nx) sin( kx) dx 0 for all integers n, k.
. Computtio of Fourier Series I this sectio, we compute the Fourier coefficiets, f ( x) cos( x) b si( x) d b, i the Fourier series To do this, we eed the followig result o the orthogolity of the trigoometric
More informationProject 3: Using Identities to Rewrite Expressions
MAT 5 Projet 3: Usig Idetities to Rewrite Expressios Wldis I lger, equtios tht desrie properties or ptters re ofte lled idetities. Idetities desrie expressio e repled with equl or equivlet expressio tht
More informationFast Fourier Transform 1) Legendre s Interpolation 2) Vandermonde Matrix 3) Roots of Unity 4) Polynomial Evaluation
Algorithm Desig d Alsis Victor Admchi CS 5-45 Sprig 4 Lecture 3 J 7, 4 Cregie Mello Uiversit Outlie Fst Fourier Trsform ) Legedre s Iterpoltio ) Vdermode Mtri 3) Roots of Uit 4) Polomil Evlutio Guss (777
More informationData Compression Techniques (Spring 2012) Model Solutions for Exercise 4
58487 Dt Compressio Tehiques (Sprig 0) Moel Solutios for Exerise 4 If you hve y fee or orretios, plese ott jro.lo t s.helsii.fi.. Prolem: Let T = Σ = {,,, }. Eoe T usig ptive Huffm oig. Solutio: R 4 U
More informationAddendum. Addendum. Vector Review. Department of Computer Science and Engineering 1-1
Addedum Addedum Vetor Review Deprtmet of Computer Siee d Egieerig - Coordite Systems Right hded oordite system Addedum y z Deprtmet of Computer Siee d Egieerig - -3 Deprtmet of Computer Siee d Egieerig
More informationMTH 146 Class 16 Notes
MTH 46 Clss 6 Notes 0.4- Cotiued Motivtio: We ow cosider the rc legth of polr curve. Suppose we wish to fid the legth of polr curve curve i terms of prmetric equtios s: r f where b. We c view the cos si
More information) 2 2(2. Assume that
lg lg W W W W W W W Assume tht lg log. 0. with for, W W W For ot power of, W 0 W W W for hrd to lyze this cse exctly ecuse of the floors d ceiligs. usig iductio rgumet lie the oe i Ex B.5 i Appedix B,
More informationz line a) Draw the single phase equivalent circuit. b) Calculate I BC.
ECE 2260 F 08 HW 7 prob 4 solutio EX: V gyb' b' b B V gyc' c' c C = 101 0 V = 1 + j0.2 Ω V gyb' = 101 120 V = 6 + j0. Ω V gyc' = 101 +120 V z LΔ = 9 j1.5 Ω ) Drw the sigle phse equivlet circuit. b) Clculte
More informationa f(x)dx is divergent.
Mth 250 Exm 2 review. Thursdy Mrh 5. Brig TI 30 lultor but NO NOTES. Emphsis o setios 5.5, 6., 6.2, 6.3, 3.7, 6.6, 8., 8.2, 8.3, prt of 8.4; HW- 2; Q-. Kow for trig futios tht 0.707 2/2 d 0.866 3/2. From
More informationLecture 4 Recursive Algorithm Analysis. Merge Sort Solving Recurrences The Master Theorem
Lecture 4 Recursive Algorithm Alysis Merge Sort Solvig Recurreces The Mster Theorem Merge Sort MergeSortA, left, right) { if left < right) { mid floorleft right) / 2); MergeSortA, left, mid); MergeSortA,
More informationAutar Kaw Benjamin Rigsby. Transforming Numerical Methods Education for STEM Undergraduates
Autr Kw Bejmi Rigsby http://m.mthforcollege.com Trsformig Numericl Methods Eductio for STEM Udergrdutes http://m.mthforcollege.com . solve set of simulteous lier equtios usig Nïve Guss elimitio,. ler the
More information1.3 Continuous Functions and Riemann Sums
mth riem sums, prt 0 Cotiuous Fuctios d Riem Sums I Exmple we sw tht lim Lower() = lim Upper() for the fuctio!! f (x) = + x o [0, ] This is o ccidet It is exmple of the followig theorem THEOREM Let f be
More informationSorting Algorithms. Algorithms Kyuseok Shim SoEECS, SNU.
Sortig Algorithms Algorithms Kyuseo Shim SoEECS, SNU. Desigig Algorithms Icremetal approaches Divide-ad-Coquer approaches Dyamic programmig approaches Greedy approaches Radomized approaches You are ot
More informationLEVEL I. ,... if it is known that a 1
LEVEL I Fid the sum of first terms of the AP, if it is kow tht + 5 + 0 + 5 + 0 + = 5 The iterior gles of polygo re i rithmetic progressio The smllest gle is 0 d the commo differece is 5 Fid the umber of
More informationAccuplacer Elementary Algebra Study Guide
Testig Ceter Studet Suess Ceter Aupler Elemetry Alger Study Guide The followig smple questios re similr to the formt d otet of questios o the Aupler Elemetry Alger test. Reviewig these smples will give
More informationVectors. Vectors in Plane ( 2
Vectors Vectors i Ple ( ) The ide bout vector is to represet directiol force Tht mes tht every vector should hve two compoets directio (directiol slope) d mgitude (the legth) I the ple we preset vector
More informationPROGRESSIONS AND SERIES
PROGRESSIONS AND SERIES A sequece is lso clled progressio. We ow study three importt types of sequeces: () The Arithmetic Progressio, () The Geometric Progressio, () The Hrmoic Progressio. Arithmetic Progressio.
More informationMATH 104: INTRODUCTORY ANALYSIS SPRING 2008/09 PROBLEM SET 10 SOLUTIONS. f m. and. f m = 0. and x i = a + i. a + i. a + n 2. n(n + 1) = a(b a) +
MATH 04: INTRODUCTORY ANALYSIS SPRING 008/09 PROBLEM SET 0 SOLUTIONS Throughout this problem set, B[, b] will deote the set of ll rel-vlued futios bouded o [, b], C[, b] the set of ll rel-vlued futios
More informationSection IV.6: The Master Method and Applications
Sectio IV.6: The Mster Method d Applictios Defiitio IV.6.1: A fuctio f is symptoticlly positive if d oly if there exists rel umer such tht f(x) > for ll x >. A cosequece of this defiitio is tht fuctio
More informationNumerical Methods. Lecture 5. Numerical integration. dr hab. inż. Katarzyna Zakrzewska, prof. AGH. Numerical Methods lecture 5 1
Numeril Methods Leture 5. Numeril itegrtio dr h. iż. Ktrzy Zkrzewsk, pro. AGH Numeril Methods leture 5 Outlie Trpezoidl rule Multi-segmet trpezoidl rule Rihrdso etrpoltio Romerg's method Simpso's rule
More informationThomas J. Osler Mathematics Department Rowan University Glassboro NJ Introduction
Ot 0 006 Euler s little summtio formul d speil vlues of te zet futio Toms J Osler temtis Deprtmet Row Uiversity Glssboro J 0608 Osler@rowedu Itrodutio I tis ote we preset elemetry metod of determiig vlues
More informationDefinite Integral. The Left and Right Sums
Clculus Li Vs Defiite Itegrl. The Left d Right Sums The defiite itegrl rises from the questio of fidig the re betwee give curve d x-xis o itervl. The re uder curve c be esily clculted if the curve is give
More informationSection 6.3: Geometric Sequences
40 Chpter 6 Sectio 6.: Geometric Sequeces My jobs offer ul cost-of-livig icrese to keep slries cosistet with ifltio. Suppose, for exmple, recet college grdute fids positio s sles mger erig ul slry of $6,000.
More information( ) 2 3 ( ) I. Order of operations II. Scientific Notation. Simplify. Write answers in scientific notation. III.
Assessmet Ceter Elemetry Alger Study Guide for the ACCUPLACER (CPT) The followig smple questios re similr to the formt d otet of questios o the Aupler Elemetry Alger test. Reviewig these smples will give
More informationSPH3UW Unit 7.5 Snell s Law Page 1 of Total Internal Reflection occurs when the incoming refraction angle is
SPH3UW Uit 7.5 Sell s Lw Pge 1 of 7 Notes Physis Tool ox Refrtio is the hge i diretio of wve due to hge i its speed. This is most ommoly see whe wve psses from oe medium to other. Idex of refrtio lso lled
More informationFREE Download Study Package from website: &
FREE Dolod Study Pkge from esite:.tekolsses.om &.MthsBySuhg.om Get Solutio of These Pkges & Ler y Video Tutorils o.mthsbysuhg.om SHORT REVISION. Defiitio : Retgulr rry of m umers. Ulike determits it hs
More informationSM2H. Unit 2 Polynomials, Exponents, Radicals & Complex Numbers Notes. 3.1 Number Theory
SMH Uit Polyomils, Epoets, Rdicls & Comple Numbers Notes.1 Number Theory .1 Addig, Subtrctig, d Multiplyig Polyomils Notes Moomil: A epressio tht is umber, vrible, or umbers d vribles multiplied together.
More informationRADICALS. Upon completion, you should be able to. define the principal root of numbers. simplify radicals
RADICALS m 1 RADICALS Upo completio, you should be ble to defie the pricipl root of umbers simplify rdicls perform dditio, subtrctio, multiplictio, d divisio of rdicls Mthemtics Divisio, IMSP, UPLB Defiitio:
More informationCS 332: Algorithms. Linear-Time Sorting. Order statistics. Slide credit: David Luebke (Virginia)
1 CS 332: Algorithms Liear-Time Sortig. Order statistics. Slide credit: David Luebke (Virgiia) Quicksort: Partitio I Words Partitio(A, p, r): Select a elemet to act as the pivot (which?) Grow two regios,
More informationData Structures Lecture 9
Fall 2017 Fag Yu Software Security Lab. Dept. Maagemet Iformatio Systems, Natioal Chegchi Uiversity Data Structures Lecture 9 Midterm o Dec. 7 (9:10-12:00am, 106) Lec 1-9, TextBook Ch1-8, 11,12 How to
More informationA Probabilistic Analysis of Quicksort
A Probabilistic Aalysis of Quicsort You are assumed to be familiar with Quicsort. I each iteratio this sortig algorithm chooses a pivot ad the, by performig comparisios with the pivot, splits the remaider
More information1. (25 points) Use the limit definition of the definite integral and the sum formulas to compute. [1 x + x2
Mth 3, Clculus II Fil Exm Solutios. (5 poits) Use the limit defiitio of the defiite itegrl d the sum formuls to compute 3 x + x. Check your swer by usig the Fudmetl Theorem of Clculus. Solutio: The limit
More informationChapter 5. The Riemann Integral. 5.1 The Riemann integral Partitions and lower and upper integrals. Note: 1.5 lectures
Chpter 5 The Riem Itegrl 5.1 The Riem itegrl Note: 1.5 lectures We ow get to the fudmetl cocept of itegrtio. There is ofte cofusio mog studets of clculus betwee itegrl d tiderivtive. The itegrl is (iformlly)
More informationMerge and Quick Sort
Merge ad Quick Sort Merge Sort Merge Sort Tree Implemetatio Quick Sort Pivot Item Radomized Quick Sort Adapted from: Goodrich ad Tamassia, Data Structures ad Algorithms i Java, Joh Wiley & So (1998). Ruig
More informationMA123, Chapter 9: Computing some integrals (pp )
MA13, Chpter 9: Computig some itegrls (pp. 189-05) Dte: Chpter Gols: Uderstd how to use bsic summtio formuls to evlute more complex sums. Uderstd how to compute its of rtiol fuctios t ifiity. Uderstd how
More informationAdvanced Algorithmic Problem Solving Le 6 Math and Search
Advced Algorithmic Prolem Solvig Le Mth d Serch Fredrik Heitz Dept of Computer d Iformtio Sciece Liköpig Uiversity Outlie Arithmetic (l. d.) Solvig lier equtio systems (l. d.) Chiese remider theorem (l.5
More information: : 8.2. Test About a Population Mean. STT 351 Hypotheses Testing Case I: A Normal Population with Known. - null hypothesis states 0
8.2. Test About Popultio Me. Cse I: A Norml Popultio with Kow. H - ull hypothesis sttes. X1, X 2,..., X - rdom smple of size from the orml popultio. The the smple me X N, / X X Whe H is true. X 8.2.1.
More informationWeek 13 Notes: 1) Riemann Sum. Aim: Compute Area Under a Graph. Suppose we want to find out the area of a graph, like the one on the right:
Week 1 Notes: 1) Riem Sum Aim: Compute Are Uder Grph Suppose we wt to fid out the re of grph, like the oe o the right: We wt to kow the re of the red re. Here re some wys to pproximte the re: We cut the
More information( a n ) converges or diverges.
Chpter Ifiite Series Pge of Sectio E Rtio Test Chpter : Ifiite Series By the ed of this sectio you will be ble to uderstd the proof of the rtio test test series for covergece by pplyig the rtio test pprecite
More informationStatistics for Financial Engineering Session 1: Linear Algebra Review March 18 th, 2006
Sttistics for Ficil Egieerig Sessio : Lier Algebr Review rch 8 th, 6 Topics Itroductio to trices trix opertios Determits d Crmer s rule Eigevlues d Eigevectors Quiz The cotet of Sessio my be fmilir to
More informationb a 2 ((g(x))2 (f(x)) 2 dx
Clc II Fll 005 MATH Nme: T3 Istructios: Write swers to problems o seprte pper. You my NOT use clcultors or y electroic devices or otes of y kid. Ech st rred problem is extr credit d ech is worth 5 poits.
More informationLaws of Integral Indices
A Lws of Itegrl Idices A. Positive Itegrl Idices I, is clled the se, is clled the idex lso clled the expoet. mes times.... Exmple Simplify 5 6 c Solutio 8 5 6 c 6 Exmple Simplify Solutio The results i
More informationA GENERAL METHOD FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS: THE FROBENIUS (OR SERIES) METHOD
Diol Bgoo () A GENERAL METHOD FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS: THE FROBENIUS (OR SERIES) METHOD I. Itroductio The first seprtio of vribles (see pplictios to Newto s equtios) is ver useful method
More informationCh. 12 Linear Bayesian Estimators
h. Lier Byesi stimtors Itrodutio I hpter we sw: the MMS estimtor tkes simple form whe d re joitly Gussi it is lier d used oly the st d d order momets (mes d ovries). Without the Gussi ssumptio, the Geerl
More informationLet. Then. k n. And. Φ npq. npq. ε 2. Φ npq npq. npq. = ε. k will be very close to p. If n is large enough, the ratio n
Let The m ( ) ( + ) where > very smll { } { ( ) ( + ) } Ad + + { } Φ Φ Φ Φ Φ Let, the Φ( ) lim This is lled thelw of lrge umbers If is lrge eough, the rtio will be very lose to. Exmle -Tossig oi times.
More informationM3P14 EXAMPLE SHEET 1 SOLUTIONS
M3P14 EXAMPLE SHEET 1 SOLUTIONS 1. Show tht for, b, d itegers, we hve (d, db) = d(, b). Sice (, b) divides both d b, d(, b) divides both d d db, d hece divides (d, db). O the other hd, there exist m d
More informationlecture 16: Introduction to Least Squares Approximation
97 lecture 16: Itroductio to Lest Squres Approximtio.4 Lest squres pproximtio The miimx criterio is ituitive objective for pproximtig fuctio. However, i my cses it is more ppelig (for both computtio d
More information4.3 Growth Rates of Solutions to Recurrences
4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.
More informationUnit 1. Extending the Number System. 2 Jordan School District
Uit Etedig the Number System Jord School District Uit Cluster (N.RN. & N.RN.): Etedig Properties of Epoets Cluster : Etedig properties of epoets.. Defie rtiol epoets d eted the properties of iteger epoets
More informationProbability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J.
Probbility d Stochstic Processes: A Friedly Itroductio for Electricl d Computer Egieers Roy D. Ytes d Dvid J. Goodm Problem Solutios : Ytes d Goodm,4..4 4..4 4..7 4.4. 4.4. 4..6 4.6.8 4.6.9 4.7.4 4.7.
More informationThe total number of permutations of S is n!. We denote the set of all permutations of S by
DETERMINNTS. DEFINITIONS Def: Let S {,,, } e the set of itegers from to, rrged i scedig order. rerrgemet jjj j of the elemets of S is clled permuttio of S. S. The totl umer of permuttios of S is!. We deote
More informationLinford 1. Kyle Linford. Math 211. Honors Project. Theorems to Analyze: Theorem 2.4 The Limit of a Function Involving a Radical (A4)
Liford 1 Kyle Liford Mth 211 Hoors Project Theorems to Alyze: Theorem 2.4 The Limit of Fuctio Ivolvig Rdicl (A4) Theorem 2.8 The Squeeze Theorem (A5) Theorem 2.9 The Limit of Si(x)/x = 1 (p. 85) Theorem
More informationCOMP26120: Introducing Complexity Analysis (2018/19) Lucas Cordeiro
COMP60: Itroduig Complexity Aalysis (08/9) Luas Cordeiro luas.ordeiro@mahester.a.uk Itroduig Complexity Aalysis Textbook: Algorithm Desig ad Appliatios, Goodrih, Mihael T. ad Roberto Tamassia (hapter )
More informationGeometric Sequences. Geometric Sequence. Geometric sequences have a common ratio.
s A geometric sequece is sequece such tht ech successive term is obtied from the previous term by multiplyig by fixed umber clled commo rtio. Exmples, 6, 8,, 6,..., 0, 0, 0, 80,... Geometric sequeces hve
More informationINTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS)
Mthemtics Revisio Guides Itegrtig Trig, Log d Ep Fuctios Pge of MK HOME TUITION Mthemtics Revisio Guides Level: AS / A Level AQA : C Edecel: C OCR: C OCR MEI: C INTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS)
More informationImproving XOR-Dominated Circuits by Exploiting Dependencies between Operands. Ajay K. Verma and Paolo Ienne. csda
Improvig XOR-Domited Circuits y Exploitig Depedecies etwee Operds Ajy K. Verm d Polo Iee csd Processor Architecture Lortory LAP & Cetre for Advced Digitl Systems CSDA Ecole Polytechique Fédérle de Luse
More informationA GENERALIZATION OF GAUSS THEOREM ON QUADRATIC FORMS
A GENERALIZATION OF GAU THEOREM ON QUADRATIC FORM Nicole I Brtu d Adi N Cret Deprtmet of Mth - Criov Uiversity, Romi ABTRACT A origil result cocerig the extesio of Guss s theorem from the theory of biry
More informationCS 5150/6150: Assignment 1 Due: Sep 23, 2010
CS 5150/6150: Assigmet 1 Due: Sep 23, 2010 Wei Liu September 24, 2010 Q1: (1) Usig master theorem: a = 7, b = 4, f() = O(). Because f() = log b a ε holds whe ε = log b a = log 4 7, we ca apply the first
More informationCOMP285 Midterm Exam Department of Mathematics
COMP85 Midterm Exam Departmet of Mathematics Fall 010/011 - November 8, 010 Name: Studet Number: Please fiish withi 90 miutes. All poits above 100 are cosidered as bous poit. You ca reach maximal 1 poits.
More informationInference on One Population Mean Hypothesis Testing
Iferece o Oe Popultio Me ypothesis Testig Scerio 1. Whe the popultio is orml, d the popultio vrice is kow i. i. d. Dt : X 1, X,, X ~ N(, ypothesis test, for istce: Exmple: : : : : : 5'7" (ull hypothesis:
More informationTaylor Polynomials. The Tangent Line. (a, f (a)) and has the same slope as the curve y = f (x) at that point. It is the best
Tylor Polyomils Let f () = e d let p() = 1 + + 1 + 1 6 3 Without usig clcultor, evlute f (1) d p(1) Ok, I m still witig With little effort it is possible to evlute p(1) = 1 + 1 + 1 (144) + 6 1 (178) =
More information18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106
8. Problem Set Due Wenesy, Ot., t : p.m. in - Problem Mony / Consier the eight vetors 5, 5, 5,..., () List ll of the one-element, linerly epenent sets forme from these. (b) Wht re the two-element, linerly
More informationDivide & Conquer. Divide-and-conquer algorithms. Conventional product of polynomials. Conventional product of polynomials.
Divide-ad-coquer algorithms Divide & Coquer Strategy: Divide the problem ito smaller subproblems of the same type of problem Solve the subproblems recursively Combie the aswers to solve the origial problem
More informationExponents and Radical
Expoets d Rdil Rule : If the root is eve d iside the rdil is egtive, the the swer is o rel umber, meig tht If is eve d is egtive, the Beuse rel umber multiplied eve times by itself will be lwys positive.
More informationStalnaker s Argument
Stlker s Argumet (This is supplemet to Coutble Additiviy, Dutch Books d the Sleepig Beuty roblem ) Stlker (008) suggests rgumet tht c be stted thus: Let t be the time t which Beuty wkes o Mody morig. Upo
More informationStudent Success Center Elementary Algebra Study Guide for the ACCUPLACER (CPT)
Studet Success Ceter Elemetry Algebr Study Guide for the ACCUPLACER (CPT) The followig smple questios re similr to the formt d cotet of questios o the Accuplcer Elemetry Algebr test. Reviewig these smples
More informationis an ordered list of numbers. Each number in a sequence is a term of a sequence. n-1 term
Mthemticl Ptters. Arithmetic Sequeces. Arithmetic Series. To idetify mthemticl ptters foud sequece. To use formul to fid the th term of sequece. To defie, idetify, d pply rithmetic sequeces. To defie rithmetic
More informationROUTH-HURWITZ CRITERION
Automti Cotrol Sytem, Deprtmet of Mehtroi Egieerig, Germ Jordi Uiverity Routh-Hurwitz Criterio ite.google.om/ite/ziydmoud 7 ROUTH-HURWITZ CRITERION The Routh-Hurwitz riterio i lytil proedure for determiig
More informationReversing the Arithmetic mean Geometric mean inequality
Reversig the Arithmetic me Geometric me iequlity Tie Lm Nguye Abstrct I this pper we discuss some iequlities which re obtied by ddig o-egtive expressio to oe of the sides of the AM-GM iequlity I this wy
More informationINFINITE SERIES. ,... having infinite number of terms is called infinite sequence and its indicated sum, i.e., a 1
Appedix A.. Itroductio As discussed i the Chpter 9 o Sequeces d Series, sequece,,...,,... hvig ifiite umber of terms is clled ifiite sequece d its idicted sum, i.e., + + +... + +... is clled ifite series
More informationNumerical Methods (CENG 2002) CHAPTER -III LINEAR ALGEBRAIC EQUATIONS. In this chapter, we will deal with the case of determining the values of x 1
Numericl Methods (CENG 00) CHAPTER -III LINEAR ALGEBRAIC EQUATIONS. Itroductio I this chpter, we will del with the cse of determiig the vlues of,,..., tht simulteously stisfy the set of equtios: f f...
More information334 MATHS SERIES DSE MATHS PREVIEW VERSION B SAMPLE TEST & FULL SOLUTION
MATHS SERIES DSE MATHS PREVIEW VERSION B SAMPLE TEST & FULL SOLUTION TEST SAMPLE TEST III - P APER Questio Distributio INSTRUCTIONS:. Attempt ALL questios.. Uless otherwise specified, ll worig must be
More informationDiscrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Lecture 17
CS 70 Discrete Mthemtics d Proility Theory Sprig 206 Ro d Wlrd Lecture 7 Vrice We hve see i the previous ote tht if we toss coi times with is p, the the expected umer of heds is p. Wht this mes is tht
More informationENGR 3861 Digital Logic Boolean Algebra. Fall 2007
ENGR 386 Digitl Logi Boole Alger Fll 007 Boole Alger A two vlued lgeri system Iveted y George Boole i 854 Very similr to the lger tht you lredy kow Sme opertios ivolved dditio sutrtio multiplitio Repled
More informationMATH 104: INTRODUCTORY ANALYSIS SPRING 2009/10 PROBLEM SET 8 SOLUTIONS. and x i = a + i. i + n(n + 1)(2n + 1) + 2a. (b a)3 6n 2
MATH 104: INTRODUCTORY ANALYSIS SPRING 2009/10 PROBLEM SET 8 SOLUTIONS 6.9: Let f(x) { x 2 if x Q [, b], 0 if x (R \ Q) [, b], where > 0. Prove tht b. Solutio. Let P { x 0 < x 1 < < x b} be regulr prtitio
More informationThis Lecture. Divide and Conquer. Merge Sort: Algorithm. Merge Sort Algorithm. MergeSort (Example) - 1. MergeSort (Example) - 2
This Lecture Divide-ad-coquer techique for algorithm desig. Example the merge sort. Writig ad solvig recurreces Divide ad Coquer Divide-ad-coquer method for algorithm desig: Divide: If the iput size is
More informationReview of the Riemann Integral
Chpter 1 Review of the Riem Itegrl This chpter provides quick review of the bsic properties of the Riem itegrl. 1.0 Itegrls d Riem Sums Defiitio 1.0.1. Let [, b] be fiite, closed itervl. A prtitio P of
More informationApproximations of Definite Integrals
Approximtios of Defiite Itegrls So fr we hve relied o tiderivtives to evlute res uder curves, work doe by vrible force, volumes of revolutio, etc. More precisely, wheever we hve hd to evlute defiite itegrl
More informationPOWER SERIES R. E. SHOWALTER
POWER SERIES R. E. SHOWALTER. sequeces We deote by lim = tht the limit of the sequece { } is the umber. By this we me tht for y ε > 0 there is iteger N such tht < ε for ll itegers N. This mkes precise
More informationWRITTEN ASSIGNMENT 1 ANSWER KEY
CISC 65 Itrodutio Desig ad Aalysis of Algorithms WRITTEN ASSIGNMENT ANSWER KEY. Problem -) I geeral, this problem requires f() = some time period be solve for a value. This a be doe for all ase expet lg
More informationLinear Programming. Preliminaries
Lier Progrmmig Prelimiries Optimiztio ethods: 3L Objectives To itroduce lier progrmmig problems (LPP To discuss the stdrd d coicl form of LPP To discuss elemetry opertio for lier set of equtios Optimiztio
More informationRecurrences: Methods and Examples
Reurrees: Methods ad Examples CSE 30 Algorithms ad Data Strutures Alexadra Stefa Uiversity of exas at Arligto Updated: 308 Summatios Review Review slides o Summatios Reurrees Reursive algorithms It may
More information