# Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.

3 Pages

### L-21

Course: CPS 130, Fall 2009
School: Duke
Rating:

Word Count: 1952

#### Document Preview

21 November Meeting 10, 2004 String Matching (read Section 32 on String Matching in C ORMEN , L EISERSON , R IVEST, S TEIN) HOCUSPOCUSABRA BRACADABRA... ABRA ABR AB A CADABRA ACADABRA RACADABRA BRACADABRA The straightforward approach to solving this problem uses two nested for-loops. The outer loop enumerates the and the inner loop compares with . We improve this algorithm by exiting the inner loop as soon as...

Register Now

#### Unformatted Document Excerpt

Coursehero >> North Carolina >> Duke >> CPS 130

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Duke - CPS - 130
Meeting 20November 8, 2004Union-Find(read Section 21 on Data Structures for Disjoint Sets in C ORMEN , L EISERSON , R IVEST, S TEIN)This section presents two data structures for the disjoint set system problem we encountered in the implementation of K
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Italic Times-Bold Courier %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 4 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Times-Italic Courier %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Meeting 19November 3, 2004Minimum Spanning Trees(read Sections 23 on Minimum Spanning Trees in C ORMEN , L EISERSON , R IVEST, S TEIN)aepdg hi; while is not a spanning tree do find a safe edge ; endwhile. There are safe edges as long as is a p
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Times-Italic Courier %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Meeting 18November 1, 2004Shortest Paths(read Sections 24 and 25 on Shortest Paths in C ORMEN , L EISERSON , R IVEST, S TEIN)One of the most common operations in graphs is nding shortest paths between vertices. This section discusses three algorithms:
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Times-Italic Courier %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Times-Italic Courier %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Meeting 17October 27, 2004Graph Search(read Section 22 on Elementary Graph Algorithms in C ORMEN , L EISERSON , R IVEST, S TEIN)2 1 0 )( ' % &quot; &amp;\$#! which is symmetric. Often the number of edges is quite3 40 1 2 3 4VFigure 83: A sample graph with
Duke - CPS - 130
Meeting 16October 25, 2004Splay Trees, IIThis material is not covered in our textbook. You can read about splay trees in Section 7.3 of Data Structures and Their Algorithms by L EWIS , D ENENBERG and about optimum weighted binary search trees in Sectio
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Courier Times-Italic %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Meeting 15October 20, 2004Splay Trees, IThis material is not covered in our textbook but you can read about splay trees in Section 7.3 of Data Structures and Their Algorithms by L EWIS , D ENENBERG.Node Z IG Z IG Node return Z IG Z IG . 4 3 2 1 1 2
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Times-Italic Courier %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Meeting 14October 18, 2004Fibonacci Heaps, II(read Section 20 on Fibonacci Heaps in C ORMEN , L EISERSON , R IVEST, S TEIN)We still need to discuss the D ECREASE K EY and the D ELETE operations for Fibonacci heaps. Both change the structure of the hea
Duke - CPS - 130
Meeting 13October 13, 2004Fibonacci Heaps, I(read Section 19 on Binomial Heaps and Section 20 on Fibonacci Heaps in C ORMEN , L EISERSON , R IVEST, S TEIN)4 9 10 11 87 95 94 10 11 8 15+15=12 15 13 9Figure 63: Binomial trees of heights 0, 1, 2,
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Courier Times-Italic %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Times-Italic Courier %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Midterm ExamOctober 4, 2004Midterm(75 minutes open book exam)(b) There are 14 different parenthesizations, and they are 23723('&amp;\$2&amp;\$&quot; ) #) # #&quot; #&quot; # 21343('1&amp;'&amp;\$&quot; ) #) # #&quot; #&quot; # 213('635\$1%\$&quot; ) # #&quot; ) # #&quot; # 2110(\$&amp;'&amp;\$%\$&quot; ) # #&quot; #&quot; #&quot; #endwhile; unt
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 2 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Courier Times-Italic %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Meeting 12October 4, 2004Amortized Analysis(read Section 18 on Amortized Analysis in C ORMEN , L EISERSON , R IVEST, S TEIN)Amortization is an analysis technique that can inuence the design of algorithms in a profound way. Later, we will see a few dat
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Courier Times-Italic %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Times-Italic Courier %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Meeting 11September 29, 2004Solving Recurrence Relations(read Section 4 on Recurrences in C ORMEN , L EISERSON , R IVEST, S TEIN)Recurrence relations are perhaps the most important tool in the analysis of algorithms. We have encountered several method
Duke - CPS - 130
Meeting 10September 27, 2004Greedy Algorithms(read Section 16 on Greedy Algorithms in C ORMEN , L EISERSON , R IVEST, S TEIN)A scheduling problem. Consider a set of activities, . Activity has start time and nish time . Two activities and overlap if .
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Times-Italic Courier %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Meeting 9September 22, 2004Dynamic Programming(read Section 15 on Dynamic Programming in C ORMEN , L EISERSON , R IVEST, S TEIN)Figure 41: The rst parenthesization takes elementary multiplications. second takes34t xw0 0s ivh0Although the resulting
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Courier %EndComments %DVIPSWebPage: (www.radicaleye.com) %DVIPSComma
Duke - CPS - 130
Meeting 8September 20, 2004Hash Tables(read Section 11 on Hash Tables in C ORMEN , L EISERSON , R IVEST, S TEIN).0T0.x x.m 1Figure 38: Each table element is a pointer to a linked list.Hashing. In hashing we store at a location , where is a fu
Duke - CPS - 130
Meeting 7September 18, 2004Skip ListsThis material is not covered in our textbook but you can read about skip-lists in Section 6.3 of Ordered Lists in Data Structures and Their Algorithms by L EWIS , D ENENBERG.In searching it is important that the da
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 4 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Italic Times-Bold %EndComments %DVIPSWebPage: (www.radicaleye.com) %DVIPS
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Times-Italic Courier %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Meeting 6September 13, 2004Red-Black Trees(read Section 13 on Red-Black Trees in C ORMEN , L EISERSON , R IVEST, S TEIN)Binary search trees are an elegant implementation of the dictionary data type, which requires support for item S EARCH (item), void
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 4 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Italic Courier Times-Bold %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Meeting 5September 8, 2004Binary Search Trees(read Section 12 on Binary Search Trees in C ORMEN , L EISERSON , R IVEST, S TEIN)ancestors rootBinary trees. We have used binary trees repeatedly and now return to a more formal and systematic introductio
Duke - CPS - 130
Meeting 4September 6, 2004Selection(read Section 9 on Medians and Order Statistics in C ORMEN , L EISERSON , R IVEST, S TEIN)Deterministic Selection. The randomized selection algorithm takes time proportional to in the worst case,13int RS ELECT int
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Times-Italic Courier %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Courier Times-Bold Times-Italic %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Meeting 3September 1, 2004Linear-time Sorting(read Section 8 on Sorting in Linear Time in C ORMEN , L EISERSON , R IVEST, S TEIN)We have seen two algorithms which both sort items in time proportional to . Can we be sure that there are no faster algori
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Courier Times-Italic %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Meeting 2August 30, 2004HeapSort(read Section 6 on Heapsort in C ORMEN , L EISERSON , R IVEST, S TEIN)Priority Queues. A data structure implements the priority queue abstract data type if it supports at least the following operations: I NSERT, F IND M
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Times-Italic Courier %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Courier Times-Italic %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Meeting 1August 25, 2004QuickSort(read Section 7 on Quicksort in C ORMEN , L EISERSON , R IVEST, S TEIN)Quicksort has the reputation of being the fasted comparison-based sorting algorithm. Indeed it is very fast on the average but can be slow in bad c
Duke - CPS - 130
August 23, 2004Introduction and OverviewOrganizationMeetings. We meet twice a week, and with possibly one or two exceptions always on Mondays and Wednesdays, from 1:15 to 2:30pm, in room D106 LSRC. Communication. The course material will be delivered i
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Times-Italic Courier Helvetica %EndComments %DVIPSWebPage: (www.radi
Duke - CPS - 296
Vague ideaExpe e Life rim ntal cycleInitial observations Boundary of system under test, workload &amp; system Hypothesis parameters that affect behavior. Model Questions that test the model. metrics to answer questions, factors to vary, levels of factors.&quot;
Duke - CPS - 296
Experimentation in Computer Systems ResearchWhy: &quot;It doesn't matter how beautiful your theory is, it doesn't matter how smart you are if it doesn't agree with the experiment, it's wrong.&quot; R. Feynman 2003, Carla EllisWhy?W. Tichy in &quot;Should Computer Sc
Duke - CPS - 296
CS 296.1 Mathematical Modelling of Continuous SystemsCarlo Tomasi Duke University Fall 20042Chapter 1IntroductionFields such as robotics or computer vision are interdisciplinary subjects at the intersection of engineering and computer science. By the
Duke - CPS - 296
%!PS-Adobe-2.0 %Creator: dvips(k) 5.90a Copyright 2002 Radical Eye Software %Title: book.dvi %CreationDate: Mon Aug 23 15:45:57 2004 %Pages: 99 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Times-Italic CMSY10 CMMI10
uofl.edu - ECE - 530
University of Louisville Instructor Electrical and Computer EngineeringDr. Aly A. Farag Spring 2008ECE530: Hw # 5 (Issued Thursday 2/14 Due Tuesday 2/26) Note: You may turn in only 1-4 1. Text # 5-6 pp. 165 2. Text # 5-10 pp. 165 3. Text # 5-12 pp. 165
uofl.edu - ECE - 530
University of Louisville Instructor Electrical and Computer EngineeringDr. Aly A. Farag Spring 2008ECE530: Hw # 6 (Issued 2/21 Due Thursday 2/28) 1. Text # 6-18 pp. 165 2. Text # 6-19 pp. 165 3. Text # 6-20 pp. 165 4. Text # 6-39 pp. 166Note: Please st
University of Texas - SILVERMANJ - 26787
Copyright by Joel Matthew Silverman 2006The Dissertation Committee for Joel Matthew Silverman Certifies that this is the approved version of the following dissertation:Pursuing Celebrity, Ensuing Masculinity: Morris Ernst, Obscenity, and the Search For
Ill. Chicago - EECS - 265
Web code: Last name: First name: Signature:Check your lab meeting day: Tuesday ThursdayECE 311 - Communication Engineering Homework #7: due during lecture session on Monday, 4/5/04. 6.1-2: (a) (b) (c) (d) (e) 6.1-4: Neatly sketch the signals/spectra on
North-West Uni. - MAW - 962
4th Annual California Regional Middle East Studies Conference Middle East Studies Center, University of California at Santa Barbara Santa Barbara, CA, 23 March 2002 Arabic Card Jargon: A Sociolinguistic Study in the Transmission of Popular Culture* Mary A
University of Rochester - PHYS - 220
Name: Partners:PHYSICS 220 LAB #1: O NE-DIMENSIONAL MOTIONBats navigate in the dark with spectacular speed and agility by emitting a series of supersonic calls, which echo back and warn them of obstacles. When interfaced to a laboratory computer, a dete
North-West Uni. - MET - 179
Homework #2: FramesPlease, be concise! You should write approximately 2 pages (format: 12 pt, double spaced) for each of the two tasks. Our rule for homeworks containing more than a total of 5 pages is very simple: anything after the last word on page 5
North-West Uni. - MET - 179
Constructional Compositionality and the English ResultativeMARC ETTLINGERUniversity of California, Berkeley June 1, 2005 1. INTRODUCTION: Recent work on grammatical constructions in English (Lakoff 1987, Goldberg 1995, Kay &amp; Fillmore 1999, Fillmore, Kay
UMass (Amherst) - RESEC - 312
Excel Functions: + * ^Syntax =C5+D5 =C5-D5 =C5*D5 =C5^2Definition/Description Adds the values found in cells C5 and D5. Subtracts . Multiplies . Creates the square of the value in C5. The dollar sign locks cell addresses so that they do not change when
North-West Uni. - MET - 179
Mental SpacesIn Greece, Kiki is happy. In 1970, we didnt have e-mail. Sandy thinks Chris has green eyes. In the picture, Chris has green eyes. In the movie, Eliza Doolittle may end up marrying Henry Higgins. Mrs. Higgins hopes that Eliza Doolittle will e
Harvard - LJM - 200
Projected trends in global temperatureEffects of Climate Change on U.S. Air QualityLoretta J. Mickley, Harvard University Shiliang Wu, Eric Liebensperger, Moeko Yoshitomi, Dominick Spracklen, Brendan Field Daniel Jacob, David Rind, Cynthia Lin, David St
Mercer - MGT - 382
Stanford University Graduate School of Businessrev. Jan. 1999Capacity Management at Littlefield TechnologiesBackgroundIn early January, Littlefield Technologies (LT) opened its first and only factory to produce its newly developed Digital Satellite Sy