Recursive Sequences. Lecture 24 Section 5.6. Robb T. Koether. Hampden-Sydney College. Wed, Feb 26, 2014
|
|
- Mervin Ford
- 5 years ago
- Views:
Transcription
1 Recursive Sequences Lecture 24 Section 5.6 Robb T. Koether Hampden-Sydney College Wed, Feb 26, 2014 Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
2 1 Recursive Sequences The Fibonacci Sequence Choosing Subsets The Catalan Numbers The Towers of Hanoi 2 Assignment Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
3 Outline 1 Recursive Sequences The Fibonacci Sequence Choosing Subsets The Catalan Numbers The Towers of Hanoi 2 Assignment Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
4 Recursive Sequences Definition (Recursive Sequence) A sequence a 0, a 1, a 2,... is recursive if, for all i k for some integer k > 0, each term a i is defined in terms of certain terms a j with j < i. The initial conditions specify the values of a 0, a 1,..., a k 1. In most examples, we specify the first one or two terms and then define all subsequent terms in terms of the previous one or two terms. Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
5 Outline 1 Recursive Sequences The Fibonacci Sequence Choosing Subsets The Catalan Numbers The Towers of Hanoi 2 Assignment Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
6 The Fibonacci Sequence The Fibonacci sequence is a well known example. Define F 0 = 0 and F 1 = 1. Define recursively F n = F n 1 + F n 2 for all n 2. The first few terms are 0, 1, 1, 2, 3, 5, 8, 13, 21, 34. Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
7 Outline 1 Recursive Sequences The Fibonacci Sequence Choosing Subsets The Catalan Numbers The Towers of Hanoi 2 Assignment Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
8 Choosing Subsets In how many ways can 2 elements be selected from a set of n elements? Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
9 Choosing Subsets In how many ways can 2 elements be selected from a set of n elements? Let a n be the number of such ways, for n 2. Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
10 Choosing Subsets In how many ways can 2 elements be selected from a set of n elements? Let a n be the number of such ways, for n 2. Clearly, a 2 = 1. Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
11 Choosing Subsets In how many ways can 2 elements be selected from a set of n elements? Let a n be the number of such ways, for n 2. Clearly, a 2 = 1. It is easy to see that a 3 = 3. Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
12 Choosing Subsets n elements Consider a set of n elements Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
13 Choosing Subsets n - 1 elements Remove one element Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
14 Choosing Subsets n - 1 elements There are a n 1 ways to choose 2 elements not using the removed element Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
15 Choosing Subsets n - 1 elements There are n 1 ways to choose 2 elements using the removed element Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
16 Choosing Subsets Thus, a n = a n 1 + (n 1). Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
17 Choosing Subsets Thus, a n = a n 1 + (n 1). It follows that a n = (n 1) = (n 1)n. 2 Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
18 Choosing Subsets In how many ways can 3 elements be selected from a set of n elements? Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
19 Choosing Subsets In how many ways can 3 elements be selected from a set of n elements? Let b n be the number of such ways, for n 3. Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
20 Choosing Subsets In how many ways can 3 elements be selected from a set of n elements? Let b n be the number of such ways, for n 3. Clearly, b 3 = 1. Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
21 Choosing Subsets In how many ways can 3 elements be selected from a set of n elements? Let b n be the number of such ways, for n 3. Clearly, b 3 = 1. How is b n related to b n 1? Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
22 Outline 1 Recursive Sequences The Fibonacci Sequence Choosing Subsets The Catalan Numbers The Towers of Hanoi 2 Assignment Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
23 Binary Trees How many distinct binary trees are there with exactly n vertices? Let a n be the number of distinct binary trees with exactly n vertices. Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
24 Binary Trees Binary trees with 1 vertex a 1 = 1 Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
25 Binary Trees Binary trees with 2 vertices a 2 = 2 Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
26 Binary Trees Binary trees with 3 vertices a 3 = 5 Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
27 Binary Trees Binary trees with 4 vertices a 4 = 14 Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
28 The Catalan Numbers The Catalan numbers can be defined recursively as C 0 = 1 and C n = C 0 C n 1 + C 1 C n C n 1 C 0, for all n 1. The first few terms are 1, 1, 2, 5, 14, 42, 132. Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
29 The Catalan Numbers ( ) They can also be defined recursively C n = 2 2n 1 n+1 C n 1 for all n 1. They can also be defined nonrecursively as C n = 1 ( ) 2n. n + 1 n Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
30 Routes Through a Graph B A How many paths are there from A to B, moving north and east? Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
31 Routes Through a Graph B A Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
32 Routes Through a Graph B A Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
33 Routes Through a Graph B A Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
34 Routes Through a Graph B A Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
35 Routes Through a Graph B A Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
36 Routes Through a Graph B A Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
37 Routes Through a Graph B A Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
38 Routes Through a Graph B A Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
39 Routes Through a Graph B A Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
40 Routes Through a Graph B A Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
41 Routes Through a Graph B A Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
42 Routes Through a Graph B A Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
43 Routes Through a Graph B A Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
44 Routes Through a Graph B A Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
45 Outline 1 Recursive Sequences The Fibonacci Sequence Choosing Subsets The Catalan Numbers The Towers of Hanoi 2 Assignment Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
46 The Towers of Hanoi The Towers of Hanoi puzzle has three pegs (Peg 1, Peg 2, Peg 3) with n disks stacked on Peg 1. A legal move is to move a single disk to another peg without placing a larger disk on a smaller disk. The goal is to assemble all n disks on Peg 3. How many moves will it take? Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
47 The Towers of Hanoi Peg 1 Peg 2 Peg 3 All 8 disks on Peg 1 Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
48 The Towers of Hanoi Peg 1 Peg 2 Peg 3 Reassemble 7 disks on Peg 2 Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
49 The Towers of Hanoi Peg 1 Peg 2 Peg 3 Move largest disk to Peg 3 Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
50 The Towers of Hanoi Peg 1 Peg 2 Peg 3 Reassemble 7 disks on Peg 3 Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
51 The Towers of Hanoi We see that we can solve the puzzle for 8 disks if we can solve it for 7 disks. So we can solve it for 7 disks if we can solve it for 6 disks. And so on, down to 2 disks: we can solve it for 2 disks if we can solve it for 1 disk. How do we solve it for 1 disk? Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
52 The Towers of Hanoi Peg 1 Peg 2 Peg 3 The solution for 8 disks using the solution for 6 disks Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
53 The Towers of Hanoi Peg 1 Peg 2 Peg 3 Reassemble 6 disks on Peg 3 Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
54 The Towers of Hanoi Peg 1 Peg 2 Peg 3 Move Disk 7 to Peg 2 Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
55 The Towers of Hanoi Peg 1 Peg 2 Peg 3 Reassemble 6 disks on Peg 2 Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
56 The Towers of Hanoi Peg 1 Peg 2 Peg 3 Move Disk 8 to Peg 3 Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
57 The Towers of Hanoi Peg 1 Peg 2 Peg 3 Reassemble 6 disks on Peg 1 Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
58 The Towers of Hanoi Peg 1 Peg 2 Peg 3 Move Disk 7 to Peg 3 Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
59 The Towers of Hanoi Peg 1 Peg 2 Peg 3 Reassemble 6 disks on Peg 3 Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
60 The Towers of Hanoi How many moves are required to solve the puzzle for n disks? Let m n be the number of moves required when there are n disks. When n = 1: m 1 = 1. When n = 2: m m 1 = 3. When n = 3: m m 2 = 7. In general, m n = 2m n Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
61 The Towers of Hanoi We can show by induction that m n = 2 n 1. Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
62 Outline 1 Recursive Sequences The Fibonacci Sequence Choosing Subsets The Catalan Numbers The Towers of Hanoi 2 Assignment Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
63 Assignment Assignment Read Section 5.6, pages Exercises 2, 5, 11, 14, 22, 23, 27, 28, 33, page 302. Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, / 26
Recursive Sequences. Lecture 24 Section 5.6. Robb T. Koether. Hampden-Sydney College. Wed, Feb 27, 2013
Recursive Sequences Lecture 24 Section 5.6 Robb T. Koether Hampden-Sydney College Wed, Feb 27, 2013 Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 27, 2013 1 / 21 1 Recursive Sequences
More informationSolving Recursive Sequences by Iteration
Solving Recursive Sequences by Iteration Lecture 25 Section 5.7 Robb T. Koether Hampden-Sydney College Thu, Feb 28, 2013 Robb T. Koether (Hampden-Sydney College) Solving Recursive Sequences by Iteration
More informationThe Critical-Path Algorithm
The Critical-Path Algorithm Lecture 32 Sections 8.3-8.4 Robb T. Koether Hampden-Sydney College Wed, Nov 19, 2014 Robb T. Koether (Hampden-Sydney College) The Critical-Path Algorithm Wed, Nov 19, 2014 1
More informationMinimal Spanning Trees
Minimal Spanning Trees Lecture 33 Sections 7.1-7.3 Robb T. Koether Hampden-Sydney College Wed, Apr 11, 20 Robb T. Koether (Hampden-Sydney College) Minimal Spanning Trees Wed, Apr 11, 20 1 / 17 1 Networks
More informationRecursion. Lecture 2 Sections Robb T. Koether. Hampden-Sydney College. Wed, Jan 17, 2018
Recursion Lecture 2 Sections 20.1-20.4 Robb T. Koether Hampden-Sydney College Wed, Jan 17, 2018 Robb T. Koether (Hampden-Sydney College) Recursion Wed, Jan 17, 2018 1 / 18 1 Recursion 2 Advantages and
More informationStack Applications. Lecture 27 Sections Robb T. Koether. Hampden-Sydney College. Wed, Mar 29, 2017
Stack Applications Lecture 27 Sections 18.7-18.8 Robb T. Koether Hampden-Sydney College Wed, Mar 29, 2017 Robb T. Koether Hampden-Sydney College) Stack Applications Wed, Mar 29, 2017 1 / 27 1 Function
More informationRecursion. Lecture 26 Sections , Robb T. Koether. Hampden-Sydney College. Mon, Apr 6, 2015
Recursion Lecture 26 Sections 14.1-14.5, 14.7 Robb T. Koether Hampden-Sydney College Mon, Apr 6, 2015 Robb T. Koether (Hampden-Sydney College) Recursion Mon, Apr 6, 2015 1 / 18 1 Recursion 2 Advantages
More informationRotations and Translations
Rotations and Translations Lecture 33 Sections 11.3-11.4 Robb T. Koether Hampden-Sydney College Wed, Nov 20, 2013 Robb T. Koether (Hampden-Sydney College) Rotations and Translations Wed, Nov 20, 2013 1
More informationThe Traveling Salesman Problem Brute Force Method
The Traveling Salesman Problem Brute Force Method Lecture 30 Sections 6.1, 6.3 Robb T. Koether Hampden-Sydney College Fri, Nov 3, 2017 Robb T. Koether (Hampden-Sydney College)The Traveling Salesman Problem
More informationThe Decreasing-Time Algorithm
The Decreasing-Time Algorithm Lecture 36 Sections 8.4 Robb T. Koether Hampden-Sydney College Wed, Apr 18, 2018 Robb T. Koether (Hampden-Sydney College) The Decreasing-Time Algorithm Wed, Apr 18, 2018 1
More informationStack Applications. Lecture 25 Sections Robb T. Koether. Hampden-Sydney College. Mon, Mar 30, 2015
Stack Applications Lecture 25 Sections 18.7-18.8 Robb T. Koether Hampden-Sydney College Mon, Mar 30, 2015 Robb T. Koether Hampden-Sydney College) Stack Applications Mon, Mar 30, 2015 1 / 34 1 The Triangle
More informationRecursive Descent Parsers
Recursive Descent Parsers Lecture 7 Robb T. Koether Hampden-Sydney College Wed, Jan 28, 2015 Robb T. Koether (Hampden-Sydney College) Recursive Descent Parsers Wed, Jan 28, 2015 1 / 18 1 Parsing 2 LL Parsers
More informationSampling Distribution Examples Sections 15.4, 15.5
Sampling Distribution Examples Sections 15.4, 15.5 Lecture 27 Robb T. Koether Hampden-Sydney College Wed, Mar 2, 2016 Robb T. Koether (Hampden-Sydney College)Sampling Distribution ExamplesSections 15.4,
More informationBinary Tree Applications
Binary Tree Applications Lecture 30 Section 19.2 Robb T. Koether Hampden-Sydney College Wed, Apr 15, 2015 Robb T. Koether (Hampden-Sydney College) Binary Tree Applications Wed, Apr 15, 2015 1 / 56 1 Binary
More informationBoxplots. Lecture 17 Section Robb T. Koether. Hampden-Sydney College. Wed, Feb 10, 2010
Boxplots Lecture 17 Section 5.3.3 Robb T. Koether Hampden-Sydney College Wed, Feb 10, 2010 Robb T. Koether (Hampden-Sydney College) Boxplots Wed, Feb 10, 2010 1 / 34 Outline 1 Boxplots TI-83 Boxplots 2
More informationwhile Loops Lecture 13 Sections Robb T. Koether Wed, Sep 26, 2018 Hampden-Sydney College
while Loops Lecture 13 Sections 5.8-5.9 Robb T. Koether Hampden-Sydney College Wed, Sep 26, 2018 Robb T. Koether (Hampden-Sydney College) while Loops Wed, Sep 26, 2018 1 / 25 1 while Loops 2 Input Loops
More informationStreet-Routing Problems
Street-Routing Problems Lecture 26 Sections 5.1-5.2 Robb T. Koether Hampden-Sydney College Wed, Oct 25, 2017 Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, 2017 1 / 21 1
More informationDisplaying Distributions - Quantitative Variables
Displaying Distributions - Quantitative Variables Lecture 13 Sections 4.4.1-4.4.3 Robb T. Koether Hampden-Sydney College Wed, Feb 8, 2012 Robb T. Koether (Hampden-Sydney College)Displaying Distributions
More informationThe Traveling Salesman Problem Nearest-Neighbor Algorithm
The Traveling Salesman Problem Nearest-Neighbor Algorithm Lecture 31 Sections 6.4 Robb T. Koether Hampden-Sydney College Fri, Apr 6, 2018 Robb T. Koether (Hampden-Sydney College)The Traveling Salesman
More informationScheduling and Digraphs
Scheduling and Digraphs Lecture 35 Sections 8.1, 8.2 Robb T. Koether Hampden-Sydney College Mon, Nov 21, 2016 Robb T. Koether (Hampden-Sydney College) Scheduling and Digraphs Mon, Nov 21, 2016 1 / 25 1
More informationThe Graphics Pipeline
The Graphics Pipeline Lecture 2 Robb T. Koether Hampden-Sydney College Wed, Aug 23, 2017 Robb T. Koether (Hampden-Sydney College) The Graphics Pipeline Wed, Aug 23, 2017 1 / 19 Outline 1 Vertices 2 The
More informationThe Pairwise-Comparison Method
The Pairwise-Comparison Method Lecture 10 Section 1.5 Robb T. Koether Hampden-Sydney College Mon, Sep 11, 2017 Robb T. Koether (Hampden-Sydney College) The Pairwise-Comparison Method Mon, Sep 11, 2017
More informationLR Parsing - Conflicts
LR Parsing - Conflicts Lecture 15 Sections 4.5, 4.6 Robb T. Koether Hampden-Sydney College Fri, Feb 20, 2015 Robb T. Koether (Hampden-Sydney College) LR Parsing - Conflicts Fri, Feb 20, 2015 1 / 15 1 Shift/Reduce
More informationLinked Lists. Lecture 16 Sections Robb T. Koether. Hampden-Sydney College. Wed, Feb 22, 2017
Linked Lists Lecture 16 Sections 17.1-17.3 Robb T. Koether Hampden-Sydney College Wed, Feb 22, 2017 Robb T. Koether (Hampden-Sydney College) Linked Lists Wed, Feb 22, 2017 1 / 24 1 Linked Lists 2 The LinkedListNode
More informationImplementing Linked Lists
Implementing Linked Lists Lecture 16 Sections 17.1-17.3 Robb T. Koether Hampden-Sydney College Wed, Feb 27, 2013 Robb T. Koether (Hampden-Sydney College) Implementing Linked Lists Wed, Feb 27, 2013 1 /
More informationBoolean Expressions. Lecture 31 Sections 6.6, 6.7. Robb T. Koether. Hampden-Sydney College. Wed, Apr 8, 2015
Boolean Expressions Lecture 31 Sections 6.6, 6.7 Robb T. Koether Hampden-Sydney College Wed, Apr 8, 2015 Robb T. Koether (Hampden-Sydney College) Boolean Expressions Wed, Apr 8, 2015 1 / 22 1 Relational
More informationRecursive Linked Lists
Recursive Linked Lists Lecture 28 Sections 14.1-14.5, 14.7 Robb T. Koether Hampden-Sydney College Fri, Mar 31, 2017 Robb T. Koether (Hampden-Sydney College) Recursive Linked Lists Fri, Mar 31, 2017 1 /
More informationNondeterministic Programming in C++
Nondeterministic Programming in C++ Lecture 37 Sections 14.5 Robb T. Koether Hampden-Sydney College Wed, Nov 30, 2016 Robb T. Koether (Hampden-Sydney College) Nondeterministic Programming in C++ Wed, Nov
More informationBuilding the Abstract Syntax Trees
Building the Abstract Syntax Trees Lecture 23 Section 5.3 Robb T. Koether Hampden-Sydney College Wed, Mar 18, 2015 Robb T. Koether (Hampden-Sydney College) Building the Abstract Syntax Trees Wed, Mar 18,
More informationOperators. Lecture 12 Section Robb T. Koether. Hampden-Sydney College. Fri, Feb 9, 2018
Operators Lecture 12 Section 14.5 Robb T. Koether Hampden-Sydney College Fri, Feb 9, 2018 Robb T. Koether (Hampden-Sydney College) Operators Fri, Feb 9, 2018 1 / 21 Outline 1 Operators as Functions 2 Operator
More informationDensity Curves Sections
Density Curves Sections 3.1-3.2 Lecture 8 Robb T. Koether Hampden-Sydney College Wed, Jan 27, 2016 Robb T. Koether (Hampden-Sydney College) Density CurvesSections 3.1-3.2 Wed, Jan 27, 2016 1 / 18 Outline
More informationThe Graphics Pipeline
The Graphics Pipeline Lecture 2 Robb T. Koether Hampden-Sydney College Fri, Aug 28, 2015 Robb T. Koether (Hampden-Sydney College) The Graphics Pipeline Fri, Aug 28, 2015 1 / 19 Outline 1 Vertices 2 The
More informationFriends and Unary Operators
Friends and Unary Operators Lecture 11 Sections 11.3, 11.6 Robb T. Koether Hampden-Sydney College Fri, Feb 13, 2015 Robb T. Koether (Hampden-Sydney College) Friends and Unary Operators Fri, Feb 13, 2015
More informationXPath Lecture 34. Robb T. Koether. Hampden-Sydney College. Wed, Apr 11, 2012
XPath Lecture 34 Robb T. Koether Hampden-Sydney College Wed, Apr 11, 2012 Robb T. Koether (Hampden-Sydney College) XPathLecture 34 Wed, Apr 11, 2012 1 / 20 1 XPath Functions 2 Predicates 3 Axes Robb T.
More informationFunction Definition Syntax Tree
Function Definition Syntax Tree Lecture 34 Section 6.9 Robb T. Koether Hampden-Sydney College Wed, Apr 15, 2015 Robb T. Koether (Hampden-Sydney College) Function Definition Syntax Tree Wed, Apr 15, 2015
More informationRegular Expressions. Lecture 10 Sections Robb T. Koether. Hampden-Sydney College. Wed, Sep 14, 2016
Regular Expressions Lecture 10 Sections 3.1-3.2 Robb T. Koether Hampden-Sydney College Wed, Sep 14, 2016 Robb T. Koether (Hampden-Sydney College) Regular Expressions Wed, Sep 14, 2016 1 / 23 Outline 1
More informationThe CYK Parsing Algorithm
The CYK Parsing Algorithm Lecture 19 Section 6.3 Robb T. Koether Hampden-Sydney College Fri, Oct 7, 2016 Robb T. Koether (Hampden-Sydney College) The CYK Parsing Algorithm Fri, Oct 7, 2016 1 / 21 1 The
More informationXML Attributes. Lecture 33. Robb T. Koether. Hampden-Sydney College. Wed, Apr 25, 2018
XML Attributes Lecture 33 Robb T. Koether Hampden-Sydney College Wed, Apr 25, 2018 Robb T. Koether (Hampden-Sydney College) XML Attributes Wed, Apr 25, 2018 1 / 15 1 XML Attributes 2 The getattribute()
More informationPointers. Lecture 1 Sections Robb T. Koether. Hampden-Sydney College. Wed, Jan 14, 2015
Pointers Lecture 1 Sections 10.1-10.2 Robb T. Koether Hampden-Sydney College Wed, Jan 14, 2015 Robb T. Koether (Hampden-Sydney College) Pointers Wed, Jan 14, 2015 1 / 23 1 Pointers 2 Pointer Initialization
More informationScope and Parameter Passing
Scope and Parameter Passing Lecture 16 Sections 6.5, 6.10, 6.13 Robb T. Koether Hampden-Sydney College Mon, Oct 7, 2013 Robb T. Koether (Hampden-Sydney College) Scope and Parameter Passing Mon, Oct 7,
More informationThe Coefficient of Determination
The Coefficient of Determination Lecture 46 Section 13.9 Robb T. Koether Hampden-Sydney College Wed, Apr 17, 2012 Robb T. Koether (Hampden-Sydney College) The Coefficient of Determination Wed, Apr 17,
More informationTotal Orders. Lecture 41 Section 8.5. Robb T. Koether. Hampden-Sydney College. Mon, Apr 8, 2013
Total Orders Lecture 41 Section 8.5 Robb T. Koether Hampden-Sydney College Mon, Apr 8, 2013 Robb T. Koether (Hampden-Sydney College) Total Orders Mon, Apr 8, 2013 1 / 30 1 Total Orders 2 Topological Sorting
More informationThe Plurality-with-Elimination Method
The Plurality-with-Elimination Method Lecture 9 Section 1.4 Robb T. Koether Hampden-Sydney College Fri, Sep 8, 2017 Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep
More informationPointer Arithmetic. Lecture 4 Chapter 10. Robb T. Koether. Hampden-Sydney College. Wed, Jan 25, 2017
Pointer Arithmetic Lecture 4 Chapter 10 Robb T. Koether Hampden-Sydney College Wed, Jan 25, 2017 Robb T. Koether (Hampden-Sydney College) Pointer Arithmetic Wed, Jan 25, 2017 1 / 36 1 Pointer Arithmetic
More informationThe string Class. Lecture 21 Sections 2.9, 3.9, Robb T. Koether. Wed, Oct 17, Hampden-Sydney College
The string Class Lecture 21 Sections 2.9, 3.9, 3.10 Robb T. Koether Hampden-Sydney College Wed, Oct 17, 2018 Robb T. Koether (Hampden-Sydney College) The string Class Wed, Oct 17, 2018 1 / 18 1 The String
More informationThe Class Construct Part 1
The Class Construct Part 1 Lecture 23 Sections 7.5-7.6 Robb T. Koether Hampden-Sydney College Fri, Oct 26, 2018 Robb T. Koether (Hampden-Sydney College) The Class Construct Part 1 Fri, Oct 26, 2018 1 /
More informationMagnification and Minification
Magnification and Minification Lecture 30 Robb T. Koether Hampden-Sydney College Fri, Nov 6, 2015 Robb T. Koether (Hampden-Sydney College) Magnification and Minification Fri, Nov 6, 2015 1 / 17 Outline
More informationScope and Parameter Passing
Scope and Parameter Passing Lecture 17 Sections 6.5, 6.10, 6.13 Robb T. Koether Hampden-Sydney College Fri, Oct 5, 2018 Robb T. Koether (Hampden-Sydney College) Scope and Parameter Passing Fri, Oct 5,
More informationThe Traveling Salesman Problem Cheapest-Link Algorithm
The Traveling Salesman Problem heapest-link lgorithm Lecture 3 Sections.5 Robb T. Koether ampden-sydney ollege Wed, Nov 1, 201 Robb T. Koether (ampden-sydney ollege)the Traveling Salesman Problemheapest-Link
More informationRecognition of Tokens
Recognition of Tokens Lecture 3 Section 3.4 Robb T. Koether Hampden-Sydney College Mon, Jan 19, 2015 Robb T. Koether (Hampden-Sydney College) Recognition of Tokens Mon, Jan 19, 2015 1 / 21 1 A Class of
More informationThe Normal Distribution
The Normal Distribution Lecture 20 Section 6.3.1 Robb T. Koether Hampden-Sydney College Wed, Sep 28, 2011 Robb T. Koether (Hampden-Sydney College) The Normal Distribution Wed, Sep 28, 2011 1 / 41 Outline
More informationThe x86 Instruction Set
The x86 Instruction Set Lecture 25 Intel Manual, Vols. 2A & 2B Robb T. Koether Hampden-Sydney College Mon, Mar 23, 2015 Robb T. Koether (Hampden-Sydney College) The x86 Instruction Set Mon, Mar 23, 2015
More informationXPath. Lecture 36. Robb T. Koether. Wed, Apr 16, Hampden-Sydney College. Robb T. Koether (Hampden-Sydney College) XPath Wed, Apr 16, / 28
XPath Lecture 36 Robb T. Koether Hampden-Sydney College Wed, Apr 16, 2014 Robb T. Koether (Hampden-Sydney College) XPath Wed, Apr 16, 2014 1 / 28 1 XPath 2 Executing XPath Expressions 3 XPath Expressions
More informationFundamental Data Types
Fundamental Data Types Lecture 4 Sections 2.7-2.10 Robb T. Koether Hampden-Sydney College Mon, Sep 3, 2018 Robb T. Koether (Hampden-Sydney College) Fundamental Data Types Mon, Sep 3, 2018 1 / 25 1 Integers
More informationIntroduction to Compiler Design
Introduction to Compiler Design Lecture 1 Chapters 1 and 2 Robb T. Koether Hampden-Sydney College Wed, Jan 14, 2015 Robb T. Koether (Hampden-Sydney College) Introduction to Compiler Design Wed, Jan 14,
More informationLR Parsing - The Items
LR Parsing - The Items Lecture 10 Sections 4.5, 4.7 Robb T. Koether Hampden-Sydney College Fri, Feb 13, 2015 Robb T. Koether (Hampden-Sydney College) LR Parsing - The Items Fri, Feb 13, 2015 1 / 31 1 LR
More informationProgramming Languages
Programming Languages Lecture 3 Section 1.3 Robb T. Koether Hampden-Sydney College Mon, Sep 2, 2013 Robb T. Koether (Hampden-Sydney College) Programming Languages Mon, Sep 2, 2013 1 / 25 1 Programming
More informationProgramming Languages
Programming Languages Lecture 3 Robb T. Koether Hampden-Sydney College Fri, Aug 31, 2018 Robb T. Koether (Hampden-Sydney College) Programming Languages Fri, Aug 31, 2018 1 / 23 1 Programming Languages
More informationThe Projection Matrix
The Projection Matrix Lecture 5 Robb T. Koether Hampden-Sydney College Wed, Aug 30, 2017 Robb T. Koether (Hampden-Sydney College) The Projection Matrix Wed, Aug 30, 2017 1 / 21 Outline 1 The World Coordinate
More informationMipmaps. Lecture 35. Robb T. Koether. Hampden-Sydney College. Wed, Nov 18, 2015
Mipmaps Lecture 35 Robb T. Koether Hampden-Sydney College Wed, Nov 18, 2015 Robb T. Koether (Hampden-Sydney College) Mipmaps Wed, Nov 18, 2015 1 / 31 Outline 1 Discrete Sampling 2 Mipmaps 3 Generating
More informationAggregation. Lecture 7 Section Robb T. Koether. Hampden-Sydney College. Wed, Jan 29, 2014
Aggregation Lecture 7 Section 5.1.7-5.1.8 Robb T. Koether Hampden-Sydney College Wed, Jan 29, 2014 Robb T. Koether (Hampden-Sydney College) Aggregation Wed, Jan 29, 2014 1 / 17 1 Aggregate Functions 2
More informationTriggers. Lecture 14. Robb T. Koether. Hampden-Sydney College. Wed, Feb 14, 2018
Triggers Lecture 14 Robb T. Koether Hampden-Sydney College Wed, Feb 14, 2018 Robb T. Koether (Hampden-Sydney College) Triggers Wed, Feb 14, 2018 1 / 22 1 Triggers 2 Cascading Triggers 3 Update and Insert
More informationSpecular Reflection. Lecture 19. Robb T. Koether. Hampden-Sydney College. Wed, Oct 4, 2017
Specular Reflection Lecture 19 Robb T. Koether Hampden-Sydney College Wed, Oct 4, 2017 Robb T. Koether (Hampden-Sydney College) Specular Reflection Wed, Oct 4, 2017 1 / 22 Outline 1 Specular Reflection
More informationPHP Queries and HTML Forms Lecture 23
PHP Queries and HTML Forms Lecture 23 Robb T. Koether Hampden-Sydney College Wed, Mar 14, 2018 Robb T. Koether (Hampden-Sydney College) PHP Queries and HTML FormsLecture 23 Wed, Mar 14, 2018 1 / 15 1 Retrieving
More informationPointers. Lecture 2 Sections Robb T. Koether. Hampden-Sydney College. Fri, Jan 18, 2013
Pointers Lecture 2 Sections 10.3-10.8 Robb T. Koether Hampden-Sydney College Fri, Jan 18, 2013 Robb T. Koether (Hampden-Sydney College) Pointers Fri, Jan 18, 2013 1 / 35 1 Introduction 2 Pointer Arithmetic
More informationArray Lists. Lecture 15. Robb T. Koether. Hampden-Sydney College. Fri, Feb 16, 2018
Array Lists Lecture 15 Robb T. Koether Hampden-Sydney College Fri, Feb 16, 2018 Robb T. Koether (Hampden-Sydney College) Array Lists Fri, Feb 16, 2018 1 / 21 1 Inlining Functions 2 List Implementations
More informationInheritance: The Fundamental Functions
Inheritance: The Fundamental Functions Lecture 21 Sections 11.11-11.12 Robb T. Koether Hampden-Sydney College Wed, Mar 20, 2013 Robb T. Koether (Hampden-Sydney College) Inheritance: The Fundamental Functions
More informationThe Constructors. Lecture 7 Sections Robb T. Koether. Hampden-Sydney College. Wed, Feb 1, 2017
The Constructors Lecture 7 Sections 11.4-11.5 Robb T. Koether Hampden-Sydney College Wed, Feb 1, 2017 Robb T. Koether (Hampden-Sydney College) The Constructors Wed, Feb 1, 2017 1 / 25 1 The Four Fundamental
More informationStacks and their Applications
Stacks and their Applications Lecture 23 Sections 18.1-18.2 Robb T. Koether Hampden-Sydney College Fri, Mar 16, 2018 Robb T. Koether Hampden-Sydney College) Stacks and their Applications Fri, Mar 16, 2018
More informationAbstract Data Types. Lecture 23 Section 7.1. Robb T. Koether. Hampden-Sydney College. Wed, Oct 24, 2012
Abstract Data Types Lecture 23 Section 7.1 Robb T. Koether Hampden-Sydney College Wed, Oct 24, 2012 Robb T. Koether (Hampden-Sydney College) Abstract Data Types Wed, Oct 24, 2012 1 / 19 1 Abstract Data
More informationPointers. Lecture 2 Sections Robb T. Koether. Hampden-Sydney College. Mon, Jan 20, 2014
Pointers Lecture 2 Sections 10.3-10.8 Robb T. Koether Hampden-Sydney College Mon, Jan 20, 2014 Robb T. Koether (Hampden-Sydney College) Pointers Mon, Jan 20, 2014 1 / 35 1 Endianness 2 Pointer Arithmetic
More informationInteger Overflow. Lecture 8 Section 2.5. Robb T. Koether. Hampden-Sydney College. Mon, Jan 27, 2014
Integer Overflow Lecture 8 Section 2.5 Robb T. Koether Hampden-Sydney College Mon, Jan 27, 2014 Robb T. Koether (Hampden-Sydney College) Integer Overflow Mon, Jan 27, 2014 1 / 32 1 Signed Addition and
More informationShading Triangles. Lecture 37. Robb T. Koether. Hampden-Sydney College. Mon, Nov 30, 2015
Shading Triangles Lecture 37 Robb T. Koether Hampden-Sydney College Mon, Nov 30, 2015 Robb T. Koether (Hampden-Sydney College) Shading Triangles Mon, Nov 30, 2015 1 / 35 Outline 1 Shading Triangles Barycentric
More informationList Iterator Implementation
List Iterator Implementation Lecture 28 Section 14.6 Robb T. Koether Hampden-Sydney College Fri, Apr 10, 2015 Robb T. Koether (Hampden-Sydney College) List Iterator Implementation Fri, Apr 10, 2015 1 /
More informationInduction and Recursion. CMPS/MATH 2170: Discrete Mathematics
Induction and Recursion CMPS/MATH 2170: Discrete Mathematics Outline Mathematical induction (5.1) Sequences and Summations (2.4) Strong induction (5.2) Recursive definitions (5.3) Recurrence Relations
More informationWebpage Navigation. Lecture 27. Robb T. Koether. Hampden-Sydney College. Mon, Apr 2, 2018
Webpage Navigation Lecture 27 Robb T. Koether Hampden-Sydney College Mon, Apr 2, 2018 Robb T. Koether (Hampden-Sydney College) Webpage Navigation Mon, Apr 2, 2018 1 / 16 1 Popup Boxes 2 The Document Object
More informationForm Validation. Lecture 25. Robb T. Koether. Hampden-Sydney College. Wed, Mar 23, 2018
Form Validation Lecture 25 Robb T. Koether Hampden-Sydney College Wed, Mar 23, 2018 Robb T. Koether (Hampden-Sydney College) Form Validation Wed, Mar 23, 2018 1 / 16 1 Form Validation 2 Detecting Javascript
More informationRecursion. Chapter 7. Copyright 2012 by Pearson Education, Inc. All rights reserved
Recursion Chapter 7 Contents What Is Recursion? Tracing a Recursive Method Recursive Methods That Return a Value Recursively Processing an Array Recursively Processing a Linked Chain The Time Efficiency
More informationArray Lists. Lecture 15. Robb T. Koether. Hampden-Sydney College. Mon, Feb 22, 2016
Array Lists Lecture 15 Robb T. Koether Hampden-Sydney College Mon, Feb 22, 2016 Robb T. Koether (Hampden-Sydney College) Array Lists Mon, Feb 22, 2016 1 / 23 1 Inlining Functions 2 List Implementations
More informationFunction Usage. Lecture 15 Sections 6.3, 6.4. Robb T. Koether. Hampden-Sydney College. Mon, Oct 1, 2018
Function Usage Lecture 15 Sections 6.3, 6.4 Robb T. Koether Hampden-Sydney College Mon, Oct 1, 2018 Robb T. Koether (Hampden-Sydney College) Function Usage Mon, Oct 1, 2018 1 / 12 1 Function and Parameters
More informationShader Programs. Lecture 30 Subsections 2.8.2, Robb T. Koether. Hampden-Sydney College. Wed, Nov 16, 2011
Shader Programs Lecture 30 Subsections 2.8.2, 2.8.3 Robb T. Koether Hampden-Sydney College Wed, Nov 16, 2011 Robb T. Koether (Hampden-Sydney College) Shader Programs Wed, Nov 16, 2011 1 / 43 Outline 1
More informationIntroduction to Databases
Introduction to Databases Lecture 1 Chapters 1-2 Robb T. Koether Hampden-Sydney College Wed, Jan 15, 2014 Robb T. Koether (Hampden-Sydney College) Introduction to Databases Wed, Jan 15, 2014 1 / 23 1 Overview
More informationFunctional Dependencies and Normal Forms
Functional Dependencies and Normal Forms Lecture 9 Sections 15.1-15.4 Robb T. Koether Hampden-Sydney College Mon, Feb 4, 2013 Robb T. Koether (Hampden-Sydney College) Functional Dependencies and Normal
More informationFunctional Dependencies and Normal Forms
Functional Dependencies and Normal Forms Lecture 9 Sections 15.1-15.4 Robb T. Koether Hampden-Sydney College Mon, Feb 3, 2014 Robb T. Koether (Hampden-Sydney College) Functional Dependencies and Normal
More informationBasic PHP Lecture 17
Basic PHP Lecture 17 Robb T. Koether Hampden-Sydney College Fri, Feb 24, 2012 Robb T. Koether (Hampden-Sydney College) Basic PHPLecture 17 Fri, Feb 24, 2012 1 / 30 1 PHP 2 Basic PHP 3 The Extended echo
More informationThe Model Stack. Lecture 8. Robb T. Koether. Hampden-Sydney College. Wed, Sep 6, 2017
The Model Stack Lecture 8 Robb T. Koether Hampden-Sydney College Wed, Sep 6, 2017 Robb T. Koether (Hampden-Sydney College) The Model Stack Wed, Sep 6, 2017 1 / 19 Outline 1 Drawing Rectangle Man 2 The
More informationMySQL Creating a Database Lecture 3
MySQL Creating a Database Lecture 3 Robb T Koether Hampden-Sydney College Mon, Jan 23, 2012 Robb T Koether (Hampden-Sydney College) MySQL Creating a DatabaseLecture 3 Mon, Jan 23, 2012 1 / 31 1 Multiple
More informationBasic CSS Lecture 17
Basic CSS Lecture 17 Robb T. Koether Hampden-Sydney College Wed, Feb 21, 2018 Robb T. Koether (Hampden-Sydney College) Basic CSSLecture 17 Wed, Feb 21, 2018 1 / 22 1 CSS 2 Background Styles 3 Text Styles
More informationXQuery FLOWR Expressions Lecture 35
XQuery FLOWR Expressions Lecture 35 Robb T. Koether Hampden-Sydney College Fri, Apr 13, 2012 Robb T. Koether (Hampden-Sydney College) XQuery FLOWR ExpressionsLecture 35 Fri, Apr 13, 2012 1 / 33 1 XQuery
More informationBinary Tree Implementation
Binary Tree Implementation Lecture 32 Section 19.1 Robb T. Koether Hampden-Sydney College Mon, Apr 16, 2018 Robb T. Koether (Hampden-Sydney College) Binary Tree Implementation Mon, Apr 16, 2018 1 / 24
More informationList Iterators. Lecture 27 Section Robb T. Koether. Hampden-Sydney College. Wed, Apr 8, 2015
List Iterators Lecture 27 Section 16.5 Robb T. Koether Hampden-Sydney College Wed, Apr 8, 2015 Robb T. Koether (Hampden-Sydney College) List Iterators Wed, Apr 8, 2015 1 / 28 1 Sequential Access 2 List
More informationBasic PHP. Lecture 19. Robb T. Koether. Hampden-Sydney College. Mon, Feb 26, 2108
Basic PHP Lecture 19 Robb T. Koether Hampden-Sydney College Mon, Feb 26, 2108 Robb T. Koether (Hampden-Sydney College) Basic PHP Mon, Feb 26, 2108 1 / 27 1 PHP 2 The echo Statement 3 Variables 4 Operators
More informationThe Mesh Class. Lecture 26. Robb T. Koether. Wed, Oct 28, Hampden-Sydney College
The Mesh Class Lecture 26 Robb T. Koether Hampden-Sydney College Wed, Oct 28, 2015 Robb T. Koether (Hampden-Sydney College) The Mesh Class Wed, Oct 28, 2015 1 / 23 Outline 1 The Mesh Class 2 Assignment
More informationCUP. Lecture 18 CUP User s Manual (online) Robb T. Koether. Hampden-Sydney College. Fri, Feb 27, 2015
CUP Lecture 18 CUP User s Manual (online) Robb T. Koether Hampden-Sydney College Fri, Feb 27, 2015 Robb T. Koether (Hampden-Sydney College) CUP Fri, Feb 27, 2015 1 / 31 1 The CUP Parser Generator 2 The
More informationAmbient and Diffuse Light
Ambient and Diffuse Light Lecture 20 Robb T. Koether Hampden-Sydney College Mon, Oct 12, 2015 Robb T. Koether (Hampden-Sydney College) Ambient and Diffuse Light Mon, Oct 12, 2015 1 / 29 Outline 1 Lighting
More informationDynamic Allocation of Memory
Dynamic Allocation of Memory Lecture 5 Section 9.8 Robb T. Koether Hampden-Sydney College Wed, Jan 24, 2018 Robb T. Koether (Hampden-Sydney College) Dynamic Allocation of Memory Wed, Jan 24, 2018 1 / 34
More informationList Iterators. Lecture 34 Section Robb T. Koether. Hampden-Sydney College. Wed, Apr 24, 2013
List Iterators Lecture 34 Section 16.5 Robb T. Koether Hampden-Sydney College Wed, Apr 24, 2013 Robb T. Koether (Hampden-Sydney College) List Iterators Wed, Apr 24, 2013 1 / 29 1 Sequential Access 2 List
More informationJFlex Regular Expressions
JFlex Regular Expressions Lecture 17 Section 3.5, JFlex Manual Robb T. Koether Hampden-Sydney College Wed, Feb 25, 2015 Robb T. Koether (Hampden-Sydney College) JFlex Regular Expressions Wed, Feb 25, 2015
More informationLecture 29 Section Wed, Apr 1, 2009
The Lecture 29 Section 10.3 Hampden-Sydney College Wed, Apr 1, 2009 Outline The 1 2 3 The 4 5 The A linked list is a naturally recursive structure. The linked list is a pointer to a node. (Ignore the msize
More informationThe Mesh Class. Lecture 23. Robb T. Koether. Hampden-Sydney College. Wed, Oct 18, 2017
The Mesh Class Lecture 23 Robb T. Koether Hampden-Sydney College Wed, Oct 18, 2017 Robb T. Koether (Hampden-Sydney College) The Mesh Class Wed, Oct 18, 2017 1 / 21 Outline 1 The Mesh Class 2 Assignment
More information