Powering a number. More Divide & Conquer
|
|
- Hector Bates
- 5 years ago
- Views:
Transcription
1 CS 4 -- Spring 29 Powering numer Prolem: Compute n, where n N. Nive lgorithm: Θ(n). ore Divide & Conquer Crol Wenk Slides ourtesy of Chrles Leiserson with smll hnges y Crol Wenk 2//9 CS 4 nlysis of lgorithms Divide-nd-onquer lgorithm: (reursive squring) n/2 n/2 if n is even; n = (n )/2 (n )/2 if n is odd. T(n) = T(n/2) + Θ() T(n) = Θ(log n). 2//9 CS 4 nlysis of lgorithms 2 Fioni numers Reursive definition: if n = ; F n = if n = ; F n + F n 2 if n L Nive reursive lgorithm: Ω(φ n ) (exponentil time), where φ = ( + )/2 is the golden rtio. 2//9 CS 4 nlysis of lgorithms Computing Fioni numers Nive reursive squring: F n = φ n / rounded to the nerest integer. Reursive squring: Θ(log n) time. This method is unrelile, sine floting-point rithmeti is prone to round-off errors. ottom-up (one-dimensionl dynmi progrmming): Compute F, F, F 2,, F n in order, forming eh numer y summing the two previous. Running time: Θ(n). 2//9 CS 4 nlysis of lgorithms 4
2 Convex Hull Convex Hull: Divide & Conquer Given set of pins on pinord nd ruer nd round them How does the ruer nd look when it snps tight? We represent onvex hull s the sequene of points on the onvex hull polygon, in ounter-lokwise order Preproessing: sort the points y x- oordinte Divide the set of points into two sets nd : ontins the left n/2 points, ontins the right n/2 points Reursively ompute the onvex hull of Reursively ompute the onvex hull of erge the two onvex hulls 2//9 CS 4 nlysis of lgorithms 2//9 CS 4 nlysis of lgorithms 6 erging Finding the lower tngent Find upper nd lower tngent With those tngents the onvex hull of n e omputed from the onvex hulls of nd the onvex hull of in O(n) liner time = rightmost point of = leftmost point of while T= not lower tngent to oth onvex hulls of nd do{ while T not lower tngent to onvex hull of do{ =- while T not lower tngent to onvex hull of do{ =+ n e heked in onstnt time 4 =2 4= right turn or left turn? 2//9 CS 4 nlysis of lgorithms 7 2//9 CS 4 nlysis of lgorithms 8
3 Convex Hull: Runtime Convex Hull: Runtime Preproessing: sort the points y x- oordinte Divide the set of points into two sets nd : ontins the left n/2 points, ontins the right n/2 points Reursively ompute the onvex hull of Reursively ompute the onvex hull of erge the two onvex hulls O(n log n) just one O() T(n/2) T(n/2) O(n) Runtime Reurrene: T(n) = 2 T(n/2) + n Solves to T(n) = Θ(n log n) 2//9 CS 4 nlysis of lgorithms 9 2//9 CS 4 nlysis of lgorithms n trix multiplition Input: = [ ij ], = [ ij ]. Output: C = [ ij ] =. 2 2 L n L = 2 O L nn n ij = 2 n L n L 2 O L nn n 2//9 CS 4 nlysis of lgorithms ik k= kj i, j =, 2,, n. 2 L n L O L nn Stndrd lgorithm for i to n do for j to n do ij for k to n do ij ij + ik kj Running time = Θ(n ) 2//9 CS 4 nlysis of lgorithms 2
4 Divide-nd-onquer lgorithm IDE: n n mtrix = 2 2 mtrix of (n/2) (n/2) sumtries: r = e+ g s = f+ h t = e+d g u = f +d h r t s = u e d g C = f h 8 reursive mults of (n/2) (n/2) sumtries 4 dds of (n/2) (n/2) sumtries 2//9 CS 4 nlysis of lgorithms nlysis of D&C lgorithm # sumtries T(n) = 8 T(n/2) + Θ(n 2 ) sumtrix size work dding sumtries n log = n log 2 8 = n CSE T(n) = Θ(n ). No etter thn the ordinry lgorithm. 2//9 CS 4 nlysis of lgorithms 4 Strssen s ide ultiply 2 2 mtries with only 7 reursive mults. P = ( f h) P 2 = ( + ) h P = ( + d) e P 4 = d (g e) P = ( + d) (e + h) P 6 = ( d) (g + h) P 7 = ( ) (e + f ) r = P + P 4 P 2 + P 6 s = P + P 2 t = P + P 4 u = P + P P P 7 7 mults, 8 dds/sus. Note: No reline on ommuttivity of mult! Strssen s ide ultiply 2 2 mtries with only 7 reursive mults. P = ( f h) P 2 = ( + ) h P = ( + d) e P 4 = d (g e) P = ( + d) (e + h) P 6 = ( d) (g + h) P 7 = ( ) (e + f ) r = P + P 4 P 2 + P 6 =( + d)(e + h) + d (g e) ( + ) h + ( d)(g + h) = e + h + de + dh + dg de h h + g + h dg dh = e + g 2//9 CS 4 nlysis of lgorithms 2//9 CS 4 nlysis of lgorithms 6
5 Strssen s lgorithm. Divide: Prtition nd into (n/2) (n/2) sumtries. Form P-terms to e multiplied using + nd. 2. Conquer: Perform 7 multiplitions of (n/2) (n/2) sumtries reursively.. Comine: Form C using + nd on (n/2) (n/2) sumtries. T(n) = 7 T(n/2) + Θ(n 2 ) 2//9 CS 4 nlysis of lgorithms 7 nlysis of Strssen T(n) = 7 T(n/2) + Θ(n 2 ) n log = n log 2 7 n 2.8 CSE T(n) = Θ(n log 7 ). The numer 2.8 my not seem muh smller thn, ut euse the differene is in the exponent, the impt on running time is signifint. In ft, Strssen s lgorithm ets the ordinry lgorithm on tody s mhines for n or so. est to dte (of theoretil interest only): Θ(n 2.76L ). 2//9 CS 4 nlysis of lgorithms 8 Conlusion Divide nd onquer is just one of severl powerful tehniques for lgorithm design. Divide-nd-onquer lgorithms n e nlyzed using reurrenes nd the mster method (so prtie this mth). Cn led to more effiient lgorithms 2//9 CS 4 nlysis of lgorithms 9
Introduction 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 informationCMPS 2200 Fall Divide-and-Conquer. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk
CMPS 2200 Fall 2017 Divide-and-Conquer Carola Wenk Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk 1 The divide-and-conquer design paradigm 1. Divide the problem (instance)
More informationIntroduction to Algorithms 6.046J/18.401J/SMA5503
Introduction to Algorithms 6.046J/8.40J/SMA5503 Lecture 3 Prof. Piotr Indyk The divide-and-conquer design paradigm. Divide the problem (instance) into subproblems. 2. Conquer the subproblems by solving
More informationDivide-and-Conquer. Reading: CLRS Sections 2.3, 4.1, 4.2, 4.3, 28.2, CSE 6331 Algorithms Steve Lai
Divide-and-Conquer Reading: CLRS Sections 2.3, 4.1, 4.2, 4.3, 28.2, 33.4. CSE 6331 Algorithms Steve Lai Divide and Conquer Given an instance x of a prolem, the method works as follows: divide-and-conquer
More informationCS60020: Foundations of Algorithm Design and Machine Learning. Sourangshu Bhattacharya
CS60020: Foundations of Algorithm Design and Machine Learning Sourangshu Bhattacharya Matrix multiplication September 14, 2005 L2.27 Standard algorithm for i 1 to n do for j 1 ton do c ij 0 for k 1 to
More informationLinear Algebra Introduction
Introdution Wht is Liner Alger out? Liner Alger is rnh of mthemtis whih emerged yers k nd ws one of the pioneer rnhes of mthemtis Though, initilly it strted with solving of the simple liner eqution x +
More informationAlgorithm Design and Analysis
Algorithm Design nd Anlysis LECTURE 12 Solving Recurrences Mster Theorem Adm Smith Review Question: Exponentition Problem: Compute b, where b N is n bits long. Question: How mny multiplictions? Nive lgorithm:
More informationPeriodic string comparison
Periodi string omprison Alexnder Tiskin Deprtment of Computer Siene University of Wrwik http://www.ds.wrwik..uk/~tiskin Alexnder Tiskin (Wrwik) Periodi string omprison 1 / 51 1 Introdution 2 Semi-lol string
More informationSemi-local string comparison
Semi-lol string omprison Alexnder Tiskin http://www.ds.wrwik..uk/~tiskin Deprtment of Computer Siene University of Wrwik 1 The prolem 2 Effiient output representtion 3 The lgorithms 4 Conlusions nd future
More informationCS 577 Introduction to Algorithms: Strassen s Algorithm and the Master Theorem
CS 577 Introduction to Algorithms: Jin-Yi Cai University of Wisconsin Madison In the last class, we described InsertionSort and showed that its worst-case running time is Θ(n 2 ). Check Figure 2.2 for
More informationNondeterministic Automata vs Deterministic Automata
Nondeterministi Automt vs Deterministi Automt We lerned tht NFA is onvenient model for showing the reltionships mong regulr grmmrs, FA, nd regulr expressions, nd designing them. However, we know tht n
More information2. There are an infinite number of possible triangles, all similar, with three given angles whose sum is 180.
SECTION 8-1 11 CHAPTER 8 Setion 8 1. There re n infinite numer of possile tringles, ll similr, with three given ngles whose sum is 180. 4. If two ngles α nd β of tringle re known, the third ngle n e found
More informationM344 - ADVANCED ENGINEERING MATHEMATICS
M3 - ADVANCED ENGINEERING MATHEMATICS Lecture 18: Lplce s Eqution, Anltic nd Numericl Solution Our emple of n elliptic prtil differentil eqution is Lplce s eqution, lso clled the Diffusion Eqution. If
More informationEllipses. The second type of conic is called an ellipse.
Ellipses The seond type of oni is lled n ellipse. Definition of Ellipse An ellipse is the set of ll points (, y) in plne, the sum of whose distnes from two distint fied points (foi) is onstnt. (, y) d
More informationChapter 4 State-Space Planning
Leture slides for Automted Plnning: Theory nd Prtie Chpter 4 Stte-Spe Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Motivtion Nerly ll plnning proedures re serh proedures Different
More informationThe Divide-and-Conquer Design Paradigm
CS473- Algorithms I Lecture 4 The Divide-and-Conquer Design Paradigm CS473 Lecture 4 1 The Divide-and-Conquer Design Paradigm 1. Divide the problem (instance) into subproblems. 2. Conquer the subproblems
More informationAlgorithm Design and Analysis
Algorithm Design nd Anlysis LECTURE 5 Supplement Greedy Algorithms Cont d Minimizing lteness Ching (NOT overed in leture) Adm Smith 9/8/10 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov,
More informationProject 6: Minigoals Towards Simplifying and Rewriting Expressions
MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy
More informationSimilar Right Triangles
Geometry V1.noteook Ferury 09, 2012 Similr Right Tringles Cn I identify similr tringles in right tringle with the ltitude? Cn I identify the proportions in right tringles? Cn I use the geometri mens theorems
More informationDivide-and-conquer algorithm
Divide-and-conquer algorithm IDEA: n n matrix = 2 2 matrix of (n/2) (n/2) submatrices: r=ae+bg s=af+bh t =ce+dh u=cf+dg r t s u = a c e g September 15, 2004 Introduction to Algorithms L3.31 b d C = A B
More informationSection 2.3. Matrix Inverses
Mtri lger Mtri nverses Setion.. Mtri nverses hree si opertions on mtries, ition, multiplition, n sutrtion, re nlogues for mtries of the sme opertions for numers. n this setion we introue the mtri nlogue
More informationMaintaining Mathematical Proficiency
Nme Dte hpter 9 Mintining Mthemtil Profiieny Simplify the epression. 1. 500. 189 3. 5 4. 4 3 5. 11 5 6. 8 Solve the proportion. 9 3 14 7. = 8. = 9. 1 7 5 4 = 4 10. 0 6 = 11. 7 4 10 = 1. 5 9 15 3 = 5 +
More informationTutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.
Mth 5 Tutoril Week 1 - Jnury 1 1 Nme Setion Tutoril Worksheet 1. Find ll solutions to the liner system by following the given steps x + y + z = x + y + z = 4. y + z = Step 1. Write down the rgumented mtrix
More informationIntermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths
Intermedite Mth Cirles Wednesdy 17 Otoer 01 Geometry II: Side Lengths Lst week we disussed vrious ngle properties. As we progressed through the evening, we proved mny results. This week, we will look t
More informationAlgorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points:
Eidgenössishe Tehnishe Hohshule Zürih Eole polytehnique fédérle de Zurih Politenio federle di Zurigo Federl Institute of Tehnology t Zurih Deprtement of Computer Siene. Novemer 0 Mrkus Püshel, Dvid Steurer
More informationBases for Vector Spaces
Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything
More informationChapter 8 Roots and Radicals
Chpter 8 Roots nd Rdils 7 ROOTS AND RADICALS 8 Figure 8. Grphene is n inredily strong nd flexile mteril mde from ron. It n lso ondut eletriity. Notie the hexgonl grid pttern. (redit: AlexnderAIUS / Wikimedi
More information( ) { } [ ] { } [ ) { } ( ] { }
Mth 65 Prelulus Review Properties of Inequlities 1. > nd > >. > + > +. > nd > 0 > 4. > nd < 0 < Asolute Vlue, if 0, if < 0 Properties of Asolute Vlue > 0 1. < < > or
More informationCSE 521: Design and Analysis of Algorithms I
CSE 521: Design nd Anlysis of Algorithms I Divide nd Conquer Pul Beme 1 Algorithm Design Techniques Divide & Conquer Reduce prolem to one or more su-prolems of the sme type Typiclly, ech su-prolem is t
More informationHybrid Systems Modeling, Analysis and Control
Hyrid Systems Modeling, Anlysis nd Control Rdu Grosu Vienn University of Tehnology Leture 5 Finite Automt s Liner Systems Oservility, Rehility nd More Miniml DFA re Not Miniml NFA (Arnold, Diky nd Nivt
More informationGRAND PLAN. Visualizing Quaternions. I: Fundamentals of Quaternions. Andrew J. Hanson. II: Visualizing Quaternion Geometry. III: Quaternion Frames
Visuliing Quternions Andrew J. Hnson Computer Siene Deprtment Indin Universit Siggrph Tutoril GRAND PLAN I: Fundmentls of Quternions II: Visuliing Quternion Geometr III: Quternion Frmes IV: Clifford Algers
More informationCounting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs
Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if
More informationAPPLICATION OF STRASSEN S ALGORITHM IN RHOTRIX ROW-COLUMN MULTIPLICATION
Informtion Tehnology for People-entre Development (ITePED ) APPLIATION OF STRASSEN S ALGORITHM IN RHOTRIX ROW-OLUMN MULTIPLIATION Ezugwu E. Aslom 1, Aullhi M., Sni B. 3 n Juniu B. Shlu 4 Deprtment of Mthemtis,
More informationLecture 20: Numerical Integration III
cs4: introduction to numericl nlysis /8/0 Lecture 0: Numericl Integrtion III Instructor: Professor Amos Ron Scribes: Mrk Cowlishw, Yunpeng Li, Nthnel Fillmore For the lst few lectures we hve discussed
More informationMatrix Multiplication
Matrix Multiplication Matrix Multiplication Matrix multiplication. Given two n-by-n matrices A and B, compute C = AB. n c ij = a ik b kj k=1 c 11 c 12 c 1n c 21 c 22 c 2n c n1 c n2 c nn = a 11 a 12 a 1n
More informationLecture 19: Continuous Least Squares Approximation
Lecture 19: Continuous Lest Squres Approximtion 33 Continuous lest squres pproximtion We begn 31 with the problem of pproximting some f C[, b] with polynomil p P n t the discrete points x, x 1,, x m for
More informationMatrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix
tries Definition of tri mtri is regulr rry of numers enlosed inside rkets SCHOOL OF ENGINEERING & UIL ENVIRONEN Emple he following re ll mtries: ), ) 9, themtis ), d) tries Definition of tri Size of tri
More informationA Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version
A Lower Bound for the Length of Prtil Trnsversl in Ltin Squre, Revised Version Pooy Htmi nd Peter W. Shor Deprtment of Mthemtil Sienes, Shrif University of Tehnology, P.O.Bo 11365-9415, Tehrn, Irn Deprtment
More informationCPS 616 DIVIDE-AND-CONQUER 6-1
CPS 616 DIVIDE-AND-CONQUER 6-1 DIVIDE-AND-CONQUER Approach 1. Divide instance of problem into two or more smaller instances 2. Solve smaller instances recursively 3. Obtain solution to original (larger)
More information1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.
1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the
More informationCS415 Compilers. Lexical Analysis and. These slides are based on slides copyrighted by Keith Cooper, Ken Kennedy & Linda Torczon at Rice University
CS415 Compilers Lexicl Anlysis nd These slides re sed on slides copyrighted y Keith Cooper, Ken Kennedy & Lind Torczon t Rice University First Progrmming Project Instruction Scheduling Project hs een posted
More informationEngineering Analysis ENG 3420 Fall Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 11:00-12:00
Engineering Anlysis ENG 3420 Fll 2009 Dn C. Mrinescu Office: HEC 439 B Office hours: Tu-Th 11:00-12:00 Lecture 13 Lst time: Problem solving in preprtion for the quiz Liner Algebr Concepts Vector Spces,
More informationLogic Synthesis and Verification
Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 22 Reding: Logi Synthesis in Nutshell Setion 2 most
More informationThe Ellipse. is larger than the other.
The Ellipse Appolonius of Perg (5 B.C.) disovered tht interseting right irulr one ll the w through with plne slnted ut is not perpendiulr to the is, the intersetion provides resulting urve (oni setion)
More informationData Structures and Algorithms CMPSC 465
Dt Structures nd Algorithms CMPSC 465 LECTURE 10 Solving recurrences Mster theorem Adm Smith S. Rskhodnikov nd A. Smith; bsed on slides by E. Demine nd C. Leiserson Review questions Guess the solution
More informationPolynomials. Polynomials. Curriculum Ready ACMNA:
Polynomils Polynomils Curriulum Redy ACMNA: 66 www.mthletis.om Polynomils POLYNOMIALS A polynomil is mthemtil expression with one vrile whose powers re neither negtive nor frtions. The power in eh expression
More informationAP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals
AP Clulus BC Chpter 8: Integrtion Tehniques, L Hopitl s Rule nd Improper Integrls 8. Bsi Integrtion Rules In this setion we will review vrious integrtion strtegies. Strtegies: I. Seprte the integrnd into
More information2.4 Linear Inequalities and Interval Notation
.4 Liner Inequlities nd Intervl Nottion We wnt to solve equtions tht hve n inequlity symol insted of n equl sign. There re four inequlity symols tht we will look t: Less thn , Less thn or
More informationCSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4
Am Blnk Leture 13 Winter 2016 CSE 332 CSE 332: Dt Astrtions Sorting Dt Astrtions QuikSort Cutoff 1 Where We Are 2 For smll n, the reursion is wste. The onstnts on quik/merge sort re higher thn the ones
More informationDeterminants Chapter 3
Determinnts hpter Specil se : x Mtrix Definition : the determinnt is sclr quntity defined for ny squre n x n mtrix nd denoted y or det(). x se ecll : this expression ppers in the formul for x mtrix inverse!
More informationSymmetrical Components 1
Symmetril Components. Introdution These notes should e red together with Setion. of your text. When performing stedy-stte nlysis of high voltge trnsmission systems, we mke use of the per-phse equivlent
More informationStage 11 Prompt Sheet
Stge 11 rompt Sheet 11/1 Simplify surds is NOT surd ecuse it is exctly is surd ecuse the nswer is not exct surd is n irrtionl numer To simplify surds look for squre numer fctors 7 = = 11/ Mnipulte expressions
More informationHomework 5 solutions
Section.: E ; AP, Section.: E,,; AP,,, Section. Homework solutions. Consider the two upper-tringulr mtrices: b b b A, B b b. b () Show tht their product C = AB is lso upper-tringulr. The product is b b
More informationPHYS 1114, Lecture 1, January 18 Contents:
PHYS 1114, Lecture 1, Jnury 18 Contents: 1 Discussed Syllus (four pges). The syllus is the most importnt document. You should purchse the ExpertTA Access Code nd the L Mnul soon! 2 Reviewed Alger nd Strted
More information1 Caveats of Parallel Algorithms
CME 323: Distriuted Algorithms and Optimization, Spring 2015 http://stanford.edu/ reza/dao. Instructor: Reza Zadeh, Matroid and Stanford. Lecture 1, 9/26/2015. Scried y Suhas Suresha, Pin Pin, Andreas
More informationData Structures and Algorithm. Xiaoqing Zheng
Dt Strutures nd Algorithm Xioqing Zheng zhengxq@fudn.edu.n String mthing prolem Pttern P ours with shift s in text T (or, equivlently, tht pttern P ours eginning t position s + in text T) if T[s +... s
More informationHow do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=
More informationIntroduction to Olympiad Inequalities
Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd Am-Gm inequlity 2. Elementry inequlities......................
More informationTutorials. Algorithms and Data Structures Strassen s Algorithm. The Master Theorem for solving recurrences. The Master Theorem (cont d)
DS 2018/19 Lecture 4 slide 3 DS 2018/19 Lecture 4 slide 4 Tutorials lgorithms and Data Structures Strassen s lgorithm Start in week week 3 Tutorial allocations are linked from the course webpage http://www.inf.ed.ac.uk/teaching/courses/ads/
More informationImplication Graphs and Logic Testing
Implition Grphs n Logi Testing Vishwni D. Agrwl Jmes J. Dnher Professor Dept. of ECE, Auurn University Auurn, AL 36849 vgrwl@eng.uurn.eu www.eng.uurn.eu/~vgrwl Joint reserh with: K. K. Dve, ATI Reserh,
More informationCalculus Cheat Sheet. Integrals Definitions. where F( x ) is an anti-derivative of f ( x ). Fundamental Theorem of Calculus. dx = f x dx g x dx
Clulus Chet Sheet Integrls Definitions Definite Integrl: Suppose f ( ) is ontinuous Anti-Derivtive : An nti-derivtive of f ( ) on [, ]. Divide [, ] into n suintervls of is funtion, F( ), suh tht F = f.
More informationGM1 Consolidation Worksheet
Cmridge Essentils Mthemtis Core 8 GM1 Consolidtion Worksheet GM1 Consolidtion Worksheet 1 Clulte the size of eh ngle mrked y letter. Give resons for your nswers. or exmple, ngles on stright line dd up
More information1 Error Analysis of Simple Rules for Numerical Integration
cs41: introduction to numericl nlysis 11/16/10 Lecture 19: Numericl Integrtion II Instructor: Professor Amos Ron Scries: Mrk Cowlishw, Nthnel Fillmore 1 Error Anlysis of Simple Rules for Numericl Integrtion
More informationSurds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233,
Surs n Inies Surs n Inies Curriulum Rey ACMNA:, 6 www.mthletis.om Surs SURDS & & Inies INDICES Inies n surs re very losely relte. A numer uner (squre root sign) is lle sur if the squre root n t e simplifie.
More informationQuadratic Forms. Quadratic Forms
Qudrtic Forms Recll the Simon & Blume excerpt from n erlier lecture which sid tht the min tsk of clculus is to pproximte nonliner functions with liner functions. It s ctully more ccurte to sy tht we pproximte
More informationChapter 2. Recurrence Relations. Divide and Conquer. Divide and Conquer Strategy. Another Example: Merge Sort. Merge Sort Example. Merge Sort Example
Recurrence Relations Chapter 2 Divide and Conquer Equation or an inequality that describes a function by its values on smaller inputs. Recurrence relations arise when we analyze the running time of iterative
More informationLecture Notes No. 10
2.6 System Identifition, Estimtion, nd Lerning Leture otes o. Mrh 3, 26 6 Model Struture of Liner ime Invrint Systems 6. Model Struture In representing dynmil system, the first step is to find n pproprite
More informationThe Master Theorem for solving recurrences. Algorithms and Data Structures Strassen s Algorithm. Tutorials. The Master Theorem (cont d)
The Master Theorem for solving recurrences lgorithms and Data Structures Strassen s lgorithm 23rd September, 2014 Theorem Let n 0 N, k N 0 and a, b R with a > 0 and b > 1, and let T : N R satisfy the following
More informationHomework Assignment 6 Solution Set
Homework Assignment 6 Solution Set PHYCS 440 Mrch, 004 Prolem (Griffiths 4.6 One wy to find the energy is to find the E nd D fields everywhere nd then integrte the energy density for those fields. We know
More informationThe Area of a Triangle
The e of Tingle tkhlid June 1, 015 1 Intodution In this tile we will e disussing the vious methods used fo detemining the e of tingle. Let [X] denote the e of X. Using se nd Height To stt off, the simplest
More information03 Qudrtic Functions Completing the squre: Generl Form f ( x) x + x + c f ( x) ( x + p) + q where,, nd c re constnts nd 0. (i) (ii) (iii) (iv) *Note t
A-PDF Wtermrk DEMO: Purchse from www.a-pdf.com to remove the wtermrk Add Mths Formule List: Form 4 (Updte 8/9/08) 0 Functions Asolute Vlue Function Inverse Function If f ( x ), if f ( x ) 0 f ( x) y f
More information1 cos. cos cos cos cos MAT 126H Solutions Take-Home Exam 4. Problem 1
MAT 16H Solutions Tke-Home Exm 4 Problem 1 ) & b) Using the hlf-ngle formul for cosine, we get: 1 cos 1 4 4 cos cos 8 4 nd 1 8 cos cos 16 4 c) Using the hlf-ngle formul for tngent, we get: cot ( 3π 1 )
More informationNumbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point
GCSE C Emple 7 Work out 9 Give your nswer in its simplest form Numers n inies Reiprote mens invert or turn upsie own The reiprol of is 9 9 Mke sure you only invert the frtion you re iviing y 7 You multiply
More informationAlgorithm Design and Analysis
Algorithm Design nd Anlysis LECTURE 8 Mx. lteness ont d Optiml Ching Adm Smith 9/12/2008 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov, K. Wyne Sheduling to Minimizing Lteness Minimizing
More information5. Every rational number have either terminating or repeating (recurring) decimal representation.
CHAPTER NUMBER SYSTEMS Points to Rememer :. Numer used for ounting,,,,... re known s Nturl numers.. All nturl numers together with zero i.e. 0,,,,,... re known s whole numers.. All nturl numers, zero nd
More information12.4 Similarity in Right Triangles
Nme lss Dte 12.4 Similrit in Right Tringles Essentil Question: How does the ltitude to the hpotenuse of right tringle help ou use similr right tringles to solve prolems? Eplore Identifing Similrit in Right
More informationWhere did dynamic programming come from?
Where did dynmic progrmming come from? String lgorithms Dvid Kuchk cs302 Spring 2012 Richrd ellmn On the irth of Dynmic Progrmming Sturt Dreyfus http://www.eng.tu.c.il/~mi/cd/ or50/1526-5463-2002-50-01-0048.pdf
More informationAutomatic Synthesis of New Behaviors from a Library of Available Behaviors
Automti Synthesis of New Behviors from Lirry of Aville Behviors Giuseppe De Giomo Università di Rom L Spienz, Rom, Itly degiomo@dis.unirom1.it Sestin Srdin RMIT University, Melourne, Austrli ssrdin@s.rmit.edu.u
More informationSurface maps into free groups
Surfce mps into free groups lden Wlker Novemer 10, 2014 Free groups wedge X of two circles: Set F = π 1 (X ) =,. We write cpitl letters for inverse, so = 1. e.g. () 1 = Commuttors Let x nd y e loops. The
More informationFirst Midterm Examination
Çnky University Deprtment of Computer Engineering 203-204 Fll Semester First Midterm Exmintion ) Design DFA for ll strings over the lphet Σ = {,, c} in which there is no, no nd no cc. 2) Wht lnguge does
More informationLaboratory for Foundations of Computer Science. An Unfolding Approach. University of Edinburgh. Model Checking. Javier Esparza
An Unfoling Approh to Moel Cheking Jvier Esprz Lbortory for Fountions of Computer Siene University of Einburgh Conurrent progrms Progrm: tuple P T 1 T n of finite lbelle trnsition systems T i A i S i i
More informationQUADRATIC EQUATION. Contents
QUADRATIC EQUATION Contents Topi Pge No. Theory 0-04 Exerise - 05-09 Exerise - 09-3 Exerise - 3 4-5 Exerise - 4 6 Answer Key 7-8 Syllus Qudrti equtions with rel oeffiients, reltions etween roots nd oeffiients,
More informationReference : Croft & Davison, Chapter 12, Blocks 1,2. A matrix ti is a rectangular array or block of numbers usually enclosed in brackets.
I MATRIX ALGEBRA INTRODUCTION TO MATRICES Referene : Croft & Dvison, Chpter, Blos, A mtri ti is retngulr rr or lo of numers usull enlosed in rets. A m n mtri hs m rows nd n olumns. Mtri Alger Pge If the
More information6. Suppose lim = constant> 0. Which of the following does not hold?
CSE 0-00 Nme Test 00 points UTA Stuent ID # Multiple Choie Write your nswer to the LEFT of eh prolem 5 points eh The k lrgest numers in file of n numers n e foun using Θ(k) memory in Θ(n lg k) time using
More informationMath 154B Elementary Algebra-2 nd Half Spring 2015
Mth 154B Elementry Alger- nd Hlf Spring 015 Study Guide for Exm 4, Chpter 9 Exm 4 is scheduled for Thursdy, April rd. You my use " x 5" note crd (oth sides) nd scientific clcultor. You re expected to know
More informationIndividual Group. Individual Events I1 If 4 a = 25 b 1 1. = 10, find the value of.
Answers: (000-0 HKMO Het Events) Creted y: Mr. Frnis Hung Lst udted: July 0 00-0 33 3 7 7 5 Individul 6 7 7 3.5 75 9 9 0 36 00-0 Grou 60 36 3 0 5 6 7 7 0 9 3 0 Individul Events I If = 5 = 0, find the vlue
More informationDivide and Conquer Strategy
Divide and Conquer Strategy Algorithm design is more an art, less so a science. There are a few useful strategies, but no guarantee to succeed. We will discuss: Divide and Conquer, Greedy, Dynamic Programming.
More informationMath 32B Discussion Session Week 8 Notes February 28 and March 2, f(b) f(a) = f (t)dt (1)
Green s Theorem Mth 3B isussion Session Week 8 Notes Februry 8 nd Mrh, 7 Very shortly fter you lerned how to integrte single-vrible funtions, you lerned the Fundmentl Theorem of lulus the wy most integrtion
More informationDivide and Conquer. CSE21 Winter 2017, Day 9 (B00), Day 6 (A00) January 30,
Divide and Conquer CSE21 Winter 2017, Day 9 (B00), Day 6 (A00) January 30, 2017 http://vlsicad.ucsd.edu/courses/cse21-w17 Merging sorted lists: WHAT Given two sorted lists a 1 a 2 a 3 a k b 1 b 2 b 3 b
More information5: The Definite Integral
5: The Definite Integrl 5.: Estimting with Finite Sums Consider moving oject its velocity (meters per second) t ny time (seconds) is given y v t = t+. Cn we use this informtion to determine the distnce
More informationLinear Programming and Halfplane Intersection
CMPS 3130/6130 Computational Geometry Spring 2015 Linear Programming and Halfplane Intersection Carola Wenk CMPS 3130/6130 Computational Geometry 1 Word Problem A company produces tables and chairs. The
More information7-1: Zero and Negative Exponents
7-: Zero nd Negtive Exponents Objective: To siplify expressions involving zero nd negtive exponents Wr Up:.. ( ).. 7.. Investigting Zero nd Negtive Exponents: Coplete the tble. Write non-integers s frctions
More informationLearning Objectives of Module 2 (Algebra and Calculus) Notes:
67 Lerning Ojetives of Module (Alger nd Clulus) Notes:. Lerning units re grouped under three res ( Foundtion Knowledge, Alger nd Clulus ) nd Further Lerning Unit.. Relted lerning ojetives re grouped under
More informationFast Convolution; Strassen s Method
Fast Convolution; Strassen s Method 1 Fast Convolution reduction to subquadratic time polynomial evaluation at complex roots of unity interpolation via evaluation at complex roots of unity 2 The Master
More informationMatrix Algebra. Matrix Addition, Scalar Multiplication and Transposition. Linear Algebra I 24
Mtrix lger Mtrix ddition, Sclr Multipliction nd rnsposition Mtrix lger Section.. Mtrix ddition, Sclr Multipliction nd rnsposition rectngulr rry of numers is clled mtrix ( the plurl is mtrices ) nd the
More informationLecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.
Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one
More informationTHE JOHN ELLIPSOID THEOREM. The following is a lecture given in the functional analysis seminar at the University of South Carolina.
THE JOHN ELLIPSOID THEOREM RALPH HOWARD DEPARTMENT OF MATHEMATICS UNIVERSITY OF SOUTH CAROLINA COLUMBIA, SC 29208, USA HOWARD@MATHSCEDU The following is lecture given in the functionl nlysis seminr t the
More informationHOMEWORK FOR CLASS XII ( )
HOMEWORK FOR CLASS XII 8-9 Show tht the reltion R on the set Z of ll integers defined R,, Z,, is, divisile,, is n equivlene reltion on Z Let f: R R e defined if f if Is f one-one nd onto if If f, g : R
More informationSearching. Sorting. Lambdas
.. s Babes-Bolyai University arthur@cs.ubbcluj.ro Overview 1 2 3 Feedback for the course You can write feedback at academicinfo.ubbcluj.ro It is both important as well as anonymous Write both what you
More informationLogic Synthesis and Verification
Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 2010 Reding: Logi Synthesis in Nutshell Setion 2 most
More information