# Difference: SCMP368Spring2019 (1 vs. 53)

#### Revision 532019-04-26 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 122 to 122

 Apr 17 Tree Structures 12&18 B-Tree Simulation B+ Tree Simulation Trees Apr 19 Problem Set 7, Moodle, TeamsThis problem set is optional and extra credit. Apr 22 Exam 2
Changed:
<
<
 Apr 24 P and NP, nondeterminism, reductions 34 AlgorithmicIntractability.pptx LeetCode9 Apr 26 P and NP, nondeterminism, reductions 34 Reduction Video AlgorithmicIntractability.pptx Problem Set 7B Apr 29 Reductions Subset Sum Hamiltonian Path SubsetSumProof.ppt
>
>
 Apr 24 P and NP, nondeterminism, reductions 34 AlgorithmicIntractability LeetCode9 Apr 26 P and NP, nondeterminism, reductions 34 Reduction Video AlgorithmicIntractability Problem Set 7B Apr 29 Reductions Subset Sum Hamiltonian Path SubsetSumProof

 Final Presentations May 1
Changed:
<
<
 Final Presentations May 3 Problem Set 8 Moodle
>
>
 Final Presentations May 3 Problem Set 8 (Extra Credit) Moodle

#### Revision 522019-04-23 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 127 to 127

 Final Presentations Final Presentations Apr 29 Reductions Subset Sum Hamiltonian Path SubsetSumProof.ppt May 1 May 3 Problem Set 8 Moodle
Changed:
<
<
>
>

Statement on Title XI

#### Revision 512019-04-23 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 125 to 125

 Apr 24 P and NP, nondeterminism, reductions 34 AlgorithmicIntractability.pptx LeetCode9 Apr 26 P and NP, nondeterminism, reductions 34 Reduction Video AlgorithmicIntractability.pptx Problem Set 7B Apr 29 Reductions Subset Sum Hamiltonian Path SubsetSumProof.ppt
Changed:
<
<
 Reductions Reductions Final Presentations 8:30 May 1 May 3 Problem Set 8 Moodle May 9 Presentation Time Sign Up Moodle link to turn in presentation
>
>
 Final Presentations Final Presentations Final Presentations 8:30 May 1 May 3 Problem Set 8 Moodle May 9 Presentation Time Sign Up Moodle link to turn in presentation

Statement on Title XI

#### Revision 502019-04-22 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 125 to 125

 Apr 24 P and NP, nondeterminism, reductions 34 AlgorithmicIntractability.pptx LeetCode9 Apr 26 P and NP, nondeterminism, reductions 34 Reduction Video AlgorithmicIntractability.pptx Problem Set 7B Apr 29 Reductions Subset Sum Hamiltonian Path SubsetSumProof.ppt
Changed:
<
<
 Reductions Reductions May 1 Problem Set 8 Moodle May 3
>
>
 Reductions Reductions May 1 May 3 Problem Set 8 Moodle

Line: 162 to 162

>
>

 META FILEATTACHMENT attachment="Algorithms.jpg" attr="" comment="" date="1545016221" name="Algorithms.jpg" path="Algorithms.jpg" size="30820" user="JimSkon" version="1" attachment="PS01.pdf" attr="" comment="" date="1547671150" name="PS01.pdf" path="PS01.pdf" size="116933" user="JimSkon" version="3" attachment="PS01.zip" attr="" comment="" date="1547666631" name="PS01.zip" path="PS01.zip" size="2286" user="JimSkon" version="1"
Line: 172 to 174

 META FILEATTACHMENT attachment="PS06.pdf" attr="" comment="" date="1553456863" name="PS06.pdf" path="PS06.pdf" size="123498" user="JimSkon" version="1" attachment="PS07.pdf" attr="" comment="" date="1553457643" name="PS07.pdf" path="PS07.pdf" size="109642" user="JimSkon" version="1" attachment="PS07B.pdf" attr="" comment="" date="1555617749" name="PS07B.pdf" path="PS07B.pdf" size="92209" user="JimSkon" version="1"
>
>
 META FILEATTACHMENT attachment="PS08.pdf" attr="" comment="" date="1555936740" name="PS08.pdf" path="PS08.pdf" size="122710" user="JimSkon" version="1"

#### Revision 492019-04-21 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 121 to 121

 Apr 15 Present Problem Set 6 Solutions Present LeetCode 8 solutions Exam 2 Study Guide Trees Presentation Outline Apr 17 Tree Structures 12&18 B-Tree Simulation B+ Tree Simulation Trees Apr 19 Problem Set 7, Moodle, TeamsThis problem set is optional and extra credit.
Changed:
<
<
 Apr 22 Exam 2 LeetCode9 Apr 24 P and NP, nondeterminism, reductions 34 AlgorithmicIntractability.pptx
>
>
 Apr 22 Exam 2 Apr 24 P and NP, nondeterminism, reductions 34 AlgorithmicIntractability.pptx LeetCode9

 Reductions Apr 26 P and NP, nondeterminism, reductions 34 Reduction Video AlgorithmicIntractability.pptx Problem Set 7B Apr 29 Reductions Subset Sum Hamiltonian Path SubsetSumProof.ppt May 1 Problem Set 8 Moodle

#### Revision 482019-04-18 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 120 to 120

 Apr 12 Searching Hashing Consideration 11 HashingConsiderations LeetCode8 Apr 15 Present Problem Set 6 Solutions Present LeetCode 8 solutions Exam 2 Study Guide Trees Presentation Outline Apr 17 Tree Structures 12&18 B-Tree Simulation B+ Tree Simulation Trees
Changed:
<
<
 Apr 19 Problem Set 7, Moodle, Teams
>
>
 Apr 19 Problem Set 7, Moodle, TeamsThis problem set is optional and extra credit.

 Apr 22 Exam 2 LeetCode9 Apr 24 P and NP, nondeterminism, reductions 34 AlgorithmicIntractability.pptx
Changed:
<
<
 Apr 26 P and NP, nondeterminism, reductions 34 Reduction Video AlgorithmicIntractability.pptx
>
>
 Apr 26 P and NP, nondeterminism, reductions 34 Reduction Video AlgorithmicIntractability.pptx Problem Set 7B

 Reductions Reductions Apr 29 Reductions Subset Sum Hamiltonian Path SubsetSumProof.ppt May 1 Problem Set 8 Moodle May 3
Line: 160 to 157

>
>

 META FILEATTACHMENT attachment="Algorithms.jpg" attr="" comment="" date="1545016221" name="Algorithms.jpg" path="Algorithms.jpg" size="30820" user="JimSkon" version="1" attachment="PS01.pdf" attr="" comment="" date="1547671150" name="PS01.pdf" path="PS01.pdf" size="116933" user="JimSkon" version="3" attachment="PS01.zip" attr="" comment="" date="1547666631" name="PS01.zip" path="PS01.zip" size="2286" user="JimSkon" version="1"
Line: 169 to 168

 META FILEATTACHMENT attachment="PS05.pdf" attr="" comment="" date="1553455087" name="PS05.pdf" path="PS05.pdf" size="105752" user="JimSkon" version="1" attachment="PS06.pdf" attr="" comment="" date="1553456863" name="PS06.pdf" path="PS06.pdf" size="123498" user="JimSkon" version="1" attachment="PS07.pdf" attr="" comment="" date="1553457643" name="PS07.pdf" path="PS07.pdf" size="109642" user="JimSkon" version="1"
>
>
 META FILEATTACHMENT attachment="PS07B.pdf" attr="" comment="" date="1555617749" name="PS07B.pdf" path="PS07B.pdf" size="92209" user="JimSkon" version="1"

#### Revision 472019-04-15 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 118 to 118

 Apr 8 Dynamic Programming Russian Doll Envelope 15 Russian Doll Envelope LeetCode7 Apr 10 Searching Hashing 11 Hashing Animation Hashing Problem Set 6 , Teams , Moodle Apr 12 Searching Hashing Consideration 11 HashingConsiderations LeetCode8
Changed:
<
<
 Apr 15 Present Problem Set 6 Solutions Present LeetCode 8 solutions Exam 2 Study Guide Presentation Outline
>
>
 Apr 15 Present Problem Set 6 Solutions Present LeetCode 8 solutions Exam 2 Study Guide Trees Presentation Outline

 Apr 17 Tree Structures 12&18 B-Tree Simulation B+ Tree Simulation Trees Apr 19 Problem Set 7, Moodle, Teams Apr 22 Exam 2 LeetCode9

#### Revision 462019-04-10 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 116 to 116

 Apr 3 Dynamic Programming Rodcutting 15 RodCutting LeetCode5 Apr 5 Dynamic Programming Weighted Interval Selection weighted_interval_selection LeetCode6 Apr 8 Dynamic Programming Russian Doll Envelope 15 Russian Doll Envelope LeetCode7
Changed:
<
<
 Apr 10 Searching Hashing 11 Hashing Problem Set 6 , Teams , Moodle
>
>
 Apr 10 Searching Hashing 11 Hashing Animation Hashing Problem Set 6 , Teams , Moodle

 Apr 12 Searching Hashing Consideration 11 HashingConsiderations LeetCode8 Apr 15 Present Problem Set 6 Solutions Present LeetCode 8 solutions Exam 2 Study Guide Presentation Outline Apr 17 Tree Structures 12&18 B-Tree Simulation B+ Tree Simulation Trees

#### Revision 452019-04-08 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 116 to 116

 Apr 3 Dynamic Programming Rodcutting 15 RodCutting LeetCode5 Apr 5 Dynamic Programming Weighted Interval Selection weighted_interval_selection LeetCode6 Apr 8 Dynamic Programming Russian Doll Envelope 15 Russian Doll Envelope LeetCode7
Changed:
<
<
 Apr 10 Searching Hashing 11 Hashing Problem Set 6 , Teams , Moodle
>
>
 Apr 10 Searching Hashing 11 Hashing Problem Set 6 , Teams , Moodle

 Apr 12 Searching Hashing Consideration 11 HashingConsiderations LeetCode8 Apr 15 Present Problem Set 6 Solutions Present LeetCode 8 solutions Exam 2 Study Guide Presentation Outline Apr 17 Tree Structures 12&18 B-Tree Simulation B+ Tree Simulation Trees

#### Revision 442019-04-01 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 119 to 119

 Apr 10 Searching Hashing 11 Hashing Problem Set 6 , Teams , Moodle Apr 12 Searching Hashing Consideration 11 HashingConsiderations LeetCode8 Apr 15 Present Problem Set 6 Solutions Present LeetCode 8 solutions Exam 2 Study Guide Presentation Outline
Changed:
<
<
 Apr 17 Tree Structures 12&18 B-Tree Simulation B+ Tree Simulation Trees.pptx
>
>
 Apr 17 Tree Structures 12&18 B-Tree Simulation B+ Tree Simulation Trees

 Apr 19 Problem Set 7, Moodle, Teams Apr 22 Exam 2 LeetCode9 Apr 24 P and NP, nondeterminism, reductions 34 AlgorithmicIntractability.pptx

#### Revision 432019-04-01 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 114 to 114

 Mar 29 Linear Sorting 15 Linear Sorting Problem Set 5, Teams, Moodle Apr 1 Dynamic Programming Linear Sorting 15 Dynamic Programming Apr 3 Dynamic Programming Rodcutting 15 RodCutting LeetCode5
Changed:
<
<
 Apr 5 Dynamic Programming Weighted Interval Selection weighted_interval_selection.pptx LeetCode6
>
>
 Apr 5 Dynamic Programming Weighted Interval Selection weighted_interval_selection LeetCode6

 Apr 8 Dynamic Programming Russian Doll Envelope 15 Russian Doll Envelope LeetCode7 Apr 10 Searching Hashing 11 Hashing Problem Set 6 , Teams , Moodle
Changed:
<
<
 Apr 12 Searching Hashing Consideration 11 HashingConsiderations.ppt LeetCode8
>
>
 Apr 12 Searching Hashing Consideration 11 HashingConsiderations LeetCode8

 Apr 15 Present Problem Set 6 Solutions Present LeetCode 8 solutions Exam 2 Study Guide Presentation Outline Apr 17 Tree Structures 12&18 B-Tree Simulation B+ Tree Simulation Trees.pptx Apr 19 Problem Set 7, Moodle, Teams

#### Revision 422019-04-01 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 111 to 111

 Mar 22 Analyzing Recurrence relations CH 4 Bounding Recurrences Relations Mar 25 Analyzing Recurrence relations 4 Master Theorem LeetCode4 Mar 27 Divide and Conquer 8 InversionCounting Code (n^2) InversionCountingMerge InversionCounting ClosestPoint
Changed:
<
<
 Mar 29 Linear Sorting 15 Linear Sorting Problem Set 5, Teams, Moodle Apr 1 Dynamic Programming Linear Sorting 15 Dynamic Programming LeetCode5 Apr 3 Dynamic Programming Rodcutting 15 RodCutting
>
>
 Mar 29 Linear Sorting 15 Linear Sorting Problem Set 5, Teams, Moodle Apr 1 Dynamic Programming Linear Sorting 15 Dynamic Programming Apr 3 Dynamic Programming Rodcutting 15 RodCutting LeetCode5

 Apr 5 Dynamic Programming Weighted Interval Selection weighted_interval_selection.pptx LeetCode6 Apr 8 Dynamic Programming Russian Doll Envelope 15 Russian Doll Envelope LeetCode7 Apr 10 Searching Hashing 11 Hashing Problem Set 6 , Teams , Moodle

#### Revision 412019-04-01 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 116 to 116

 Apr 3 Dynamic Programming Rodcutting 15 RodCutting Apr 5 Dynamic Programming Weighted Interval Selection weighted_interval_selection.pptx LeetCode6 Apr 8 Dynamic Programming Russian Doll Envelope 15 Russian Doll Envelope LeetCode7
Changed:
<
<
 Apr 10 Searching Hashing 11 HashingIntro.ppt Problem Set 6, Teams , Moodle
>
>
 Apr 10 Searching Hashing 11 Hashing Problem Set 6 , Teams , Moodle

 Apr 12 Searching Hashing Consideration 11 HashingConsiderations.ppt LeetCode8 Apr 15 Present Problem Set 6 Solutions Present LeetCode 8 solutions Exam 2 Study Guide Presentation Outline Apr 17 Tree Structures 12&18 B-Tree Simulation B+ Tree Simulation Trees.pptx

#### Revision 402019-03-31 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 112 to 112

 Mar 25 Analyzing Recurrence relations 4 Master Theorem LeetCode4 Mar 27 Divide and Conquer 8 InversionCounting Code (n^2) InversionCountingMerge InversionCounting ClosestPoint Mar 29 Linear Sorting 15 Linear Sorting Problem Set 5, Teams, Moodle
Changed:
<
<
 Apr 1 Dynamic Programming Linear Sorting 15 Dynamic Programming LeetCode5 Apr 3 Dynamic Programming Rodcutting 15 rodcut.pptx
>
>
 Apr 1 Dynamic Programming Linear Sorting 15 Dynamic Programming LeetCode5 Apr 3 Dynamic Programming Rodcutting 15 RodCutting

 Apr 5 Dynamic Programming Weighted Interval Selection weighted_interval_selection.pptx LeetCode6 Apr 8 Dynamic Programming Russian Doll Envelope 15 Russian Doll Envelope LeetCode7 Apr 10 Searching Hashing 11 HashingIntro.ppt Problem Set 6, Teams , Moodle

#### Revision 392019-03-29 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 110 to 110

 Mar 20 Sorting with divide and conquer CH 4 DivideAndConquerNotes.pdf Divide & Conquer sorting Problem Set 4, Teams Moodle Mar 22 Analyzing Recurrence relations CH 4 Bounding Recurrences Relations Mar 25 Analyzing Recurrence relations 4 Master Theorem LeetCode4
Changed:
<
<
 Mar 27 Divide and Conquer 8 InversionCounting ClosestPoint
>
>
 Mar 27 Divide and Conquer 8 InversionCounting Code (n^2) InversionCountingMerge InversionCounting ClosestPoint

 Mar 29 Linear Sorting 15 Linear Sorting Problem Set 5, Teams, Moodle Apr 1 Dynamic Programming Linear Sorting 15 Dynamic Programming LeetCode5 Apr 3 Dynamic Programming Rodcutting 15 rodcut.pptx

#### Revision 382019-03-27 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 111 to 111

 Mar 22 Analyzing Recurrence relations CH 4 Bounding Recurrences Relations Mar 25 Analyzing Recurrence relations 4 Master Theorem LeetCode4 Mar 27 Divide and Conquer 8 InversionCounting ClosestPoint
Changed:
<
<
 Mar 29 Linear Sorting 15 linearsorting.pptx Problem Set 5, Teams, Moodle Apr 1 Dynamic Programming Linear Sorting 15 dynamic-programming.ppt LeetCode5
>
>
 Mar 29 Linear Sorting 15 Linear Sorting Problem Set 5, Teams, Moodle Apr 1 Dynamic Programming Linear Sorting 15 Dynamic Programming LeetCode5

 Apr 3 Dynamic Programming Rodcutting 15 rodcut.pptx Apr 5 Dynamic Programming Weighted Interval Selection weighted_interval_selection.pptx LeetCode6 Apr 8 Dynamic Programming Russian Doll Envelope 15 Russian Doll Envelope LeetCode7

#### Revision 372019-03-25 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 110 to 110

 Mar 20 Sorting with divide and conquer CH 4 DivideAndConquerNotes.pdf Divide & Conquer sorting Problem Set 4, Teams Moodle Mar 22 Analyzing Recurrence relations CH 4 Bounding Recurrences Relations Mar 25 Analyzing Recurrence relations 4 Master Theorem LeetCode4
Changed:
<
<
 Mar 27 Divide and Conquer 8 InversionCounting.pptx closestpoint.pptx
>
>
 Mar 27 Divide and Conquer 8 InversionCounting ClosestPoint

 Mar 29 Linear Sorting 15 linearsorting.pptx Problem Set 5, Teams, Moodle Apr 1 Dynamic Programming Linear Sorting 15 dynamic-programming.ppt LeetCode5 Apr 3 Dynamic Programming Rodcutting 15 rodcut.pptx

#### Revision 362019-03-25 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 108 to 108

 Spring Break Mar 18 Divide and conquer CH 4 https://repl.it/@JimSkon/findmaxsubarraypy Mar 20 Sorting with divide and conquer CH 4 DivideAndConquerNotes.pdf Divide & Conquer sorting Problem Set 4, Teams Moodle
Changed:
<
<
 Mar 22 Analyzing Recurrence relations CH 4 Master Theorem Bounding Recurrences Relations Mar 25 Divide and conquer 4 InversionCounting.pptx closestpoint.pptx LeetCode4 Mar 27 Linear Sorting 8 linearsorting.pptx Mar 29 Dynamic Programming Introduction 15 dynamic-programming.ppt Problem Set 5, Teams, Moodle Apr 1 Dynamic Programming Linear Sorting 15 LeetCode5
>
>
 Mar 22 Analyzing Recurrence relations CH 4 Bounding Recurrences Relations Mar 25 Analyzing Recurrence relations 4 Master Theorem LeetCode4 Mar 27 Divide and Conquer 8 InversionCounting.pptx closestpoint.pptx Mar 29 Linear Sorting 15 linearsorting.pptx Problem Set 5, Teams, Moodle Apr 1 Dynamic Programming Linear Sorting 15 dynamic-programming.ppt LeetCode5

 Apr 3 Dynamic Programming Rodcutting 15 rodcut.pptx Apr 5 Dynamic Programming Weighted Interval Selection weighted_interval_selection.pptx LeetCode6 Apr 8 Dynamic Programming Russian Doll Envelope 15 Russian Doll Envelope LeetCode7

#### Revision 352019-03-24 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 110 to 110

 Mar 20 Sorting with divide and conquer CH 4 DivideAndConquerNotes.pdf Divide & Conquer sorting Problem Set 4, Teams Moodle Mar 22 Analyzing Recurrence relations CH 4 Master Theorem Bounding Recurrences Relations Mar 25 Divide and conquer 4 InversionCounting.pptx closestpoint.pptx LeetCode4
Changed:
<
<
 Mar 27 Linear Sorting 8 linearsorting.pptx Problem Set 5 Moodle Mar 29 Dynamic Programming Introduction 15 dynamic-programming.ppt LeetCode5 Apr 1 Dynamic Programming Linear Sorting 15 Apr 3 Dynamic Programming Rodcutting 15 rodcut.pptx LeetCode6 Apr 5 Dynamic Programming Weighted Interval Selection weighted_interval_selection.pptx LeetCode7 Apr 8 Dynamic Programming Russian Doll Envelope 15 Russian Doll Envelope Problem Set 6 Apr 10 Searching Hashing 11 HashingIntro.ppt LeetCode8 Apr 12 Searching Hashing Consideration 11 HashingConsiderations.ppt Presentation Outline Apr 15 Present Problem Set 6 Solutions Present LeetCode 8 solutions Exam 2 Study Guide
>
>
 Mar 27 Linear Sorting 8 linearsorting.pptx Mar 29 Dynamic Programming Introduction 15 dynamic-programming.ppt Problem Set 5, Teams, Moodle Apr 1 Dynamic Programming Linear Sorting 15 LeetCode5 Apr 3 Dynamic Programming Rodcutting 15 rodcut.pptx Apr 5 Dynamic Programming Weighted Interval Selection weighted_interval_selection.pptx LeetCode6 Apr 8 Dynamic Programming Russian Doll Envelope 15 Russian Doll Envelope LeetCode7 Apr 10 Searching Hashing 11 HashingIntro.ppt Problem Set 6, Teams , Moodle Apr 12 Searching Hashing Consideration 11 HashingConsiderations.ppt LeetCode8 Apr 15 Present Problem Set 6 Solutions Present LeetCode 8 solutions Exam 2 Study Guide Presentation Outline

 Apr 17 Tree Structures 12&18 B-Tree Simulation B+ Tree Simulation Trees.pptx
Changed:
<
<
 Apr 19 Problem Set 7
>
>
 Apr 19 Problem Set 7, Moodle, Teams

 Apr 22 Exam 2 LeetCode9 Apr 24 P and NP, nondeterminism, reductions 34 AlgorithmicIntractability.pptx Apr 26 P and NP, nondeterminism, reductions 34 Reduction Video AlgorithmicIntractability.pptx
Line: 151 to 151

>
>

 META FILEATTACHMENT attachment="Algorithms.jpg" attr="" comment="" date="1545016221" name="Algorithms.jpg" path="Algorithms.jpg" size="30820" user="JimSkon" version="1" attachment="PS01.pdf" attr="" comment="" date="1547671150" name="PS01.pdf" path="PS01.pdf" size="116933" user="JimSkon" version="3" attachment="PS01.zip" attr="" comment="" date="1547666631" name="PS01.zip" path="PS01.zip" size="2286" user="JimSkon" version="1" attachment="PS02.pdf" attr="" comment="" date="1548699981" name="PS02.pdf" path="PS02.pdf" size="92320" user="JimSkon" version="1" attachment="PS03.pdf" attr="" comment="" date="1549905718" name="PS03.pdf" path="PS03.pdf" size="117596" user="JimSkon" version="2" attachment="PS04.pdf" attr="" comment="" date="1549906015" name="PS04.pdf" path="PS04.pdf" size="161833" user="JimSkon" version="1"
>
>
 META FILEATTACHMENT attachment="PS05.pdf" attr="" comment="" date="1553455087" name="PS05.pdf" path="PS05.pdf" size="105752" user="JimSkon" version="1" attachment="PS06.pdf" attr="" comment="" date="1553456863" name="PS06.pdf" path="PS06.pdf" size="123498" user="JimSkon" version="1" attachment="PS07.pdf" attr="" comment="" date="1553457643" name="PS07.pdf" path="PS07.pdf" size="109642" user="JimSkon" version="1"

#### Revision 342019-03-22 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 107 to 107

 Art Gallary Visit - Art and Algorithms Mar 1 Spring Break Mar 18 Divide and conquer CH 4 https://repl.it/@JimSkon/findmaxsubarraypy
Changed:
<
<
 Mar 20 Sorting with divide and conquer CH 4 DivideAndConquerNotes.pdf Divide & Conquer sorting Problem Set 4, Teams Moodle Mar 22 Analyzing Recurrence relations CH 4 Master Theorem Mar 25 4 InversionCounting.pptx closestpoint.pptx LeetCode4
>
>
 Mar 20 Sorting with divide and conquer CH 4 DivideAndConquerNotes.pdf Divide & Conquer sorting Problem Set 4, Teams Moodle Mar 22 Analyzing Recurrence relations CH 4 Master Theorem Bounding Recurrences Relations Mar 25 Divide and conquer 4 InversionCounting.pptx closestpoint.pptx LeetCode4

 Mar 27 Linear Sorting 8 linearsorting.pptx Problem Set 5 Moodle Mar 29 Dynamic Programming Introduction 15 dynamic-programming.ppt LeetCode5 Apr 1 Dynamic Programming Linear Sorting 15

#### Revision 332019-03-19 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 106 to 106

 Art Gallary Visit - Art and Algorithms Feb 27 Exam 1 CH 4.5 Mar 1 Spring Break
Changed:
<
<
 Mar 18 Divide and conquer Sorting CH 4 https://repl.it/@JimSkon/findmaxsubarraypy Divide & Conquer sorting Mar 20 CH 4 Master Theorem recurences.pptx Problem Set 4, Teams Moodle Mar 22 Analyzing Recurrence relations CH 4 Mar 25 4 DivideAndConquerNotes.pdf InversionCounting.pptx closestpoint.pptx LeetCode4
>
>
 Mar 18 Divide and conquer CH 4 https://repl.it/@JimSkon/findmaxsubarraypy Mar 20 Sorting with divide and conquer CH 4 DivideAndConquerNotes.pdf Divide & Conquer sorting Problem Set 4, Teams Moodle Mar 22 Analyzing Recurrence relations CH 4 Master Theorem Mar 25 4 InversionCounting.pptx closestpoint.pptx LeetCode4

 Mar 27 Linear Sorting 8 linearsorting.pptx Problem Set 5 Moodle Mar 29 Dynamic Programming Introduction 15 dynamic-programming.ppt LeetCode5 Apr 1 Dynamic Programming Linear Sorting 15

#### Revision 322019-03-18 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 106 to 106

 Art Gallary Visit - Art and Algorithms Feb 27 Exam 1 CH 4.5 Mar 1 Spring Break
Changed:
<
<
 Mar 18 Divide and conquer Sorting CH 4 Divide & Conquer sorting
>
>
 Mar 18 Divide and conquer Sorting CH 4 https://repl.it/@JimSkon/findmaxsubarraypy Divide & Conquer sorting

 Mar 20 CH 4 Master Theorem recurences.pptx Problem Set 4, Teams Moodle Mar 22 Analyzing Recurrence relations CH 4 Mar 25 4 DivideAndConquerNotes.pdf InversionCounting.pptx closestpoint.pptx LeetCode4

#### Revision 312019-03-18 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 102 to 102

 Minimum Spanning TreesPrim’s AlgorithmUnion-Find Structure Feb 18 Huffman CodesHeaps and Priority Queues Ch 22, 23 Kruskal LeetCode3 Feb 20 More on Union-Find and MSTMidterm Questions 01UnionFind.pdf Kruskal Problem Set 3, Teams, moodle Feb 22 Exam Study Guide Presentation Topic Submit
Changed:
<
<
 Feb 25 Ch 4, 7
>
>
 Feb 25 Ch 4, 7

 Art Gallary Visit - Art and Algorithms Feb 27 Exam 1 CH 4.5 Mar 1 Spring Break
Changed:
<
<
 Mar 18 Divide and conquer Inversion Counting Minimum Distance CH 4 Divide & Conquer Mar 20 Analyzing Recurrence relations CH 4 Master Theorem recurences.pptx Problem Set 4, Teams Moodle
>
>
 Mar 18 Divide and conquer Sorting CH 4 Divide & Conquer sorting Mar 20 CH 4 Master Theorem recurences.pptx Problem Set 4, Teams Moodle

 Mar 22 Analyzing Recurrence relations CH 4
Changed:
<
<
 Mar 25 4 DivideAndConquerNotes.pdf InversionCounting.pptx closestpoint.pptx Problem Set 5 Moodle Mar 27 Linear Sorting 8 linearsorting.pptx LeetCode4
>
>
 Mar 25 4 DivideAndConquerNotes.pdf InversionCounting.pptx closestpoint.pptx LeetCode4 Mar 27 Linear Sorting 8 linearsorting.pptx Problem Set 5 Moodle

 Mar 29 Dynamic Programming Introduction 15 dynamic-programming.ppt LeetCode5 Apr 1 Dynamic Programming Linear Sorting 15 Apr 3 Dynamic Programming Rodcutting 15 rodcut.pptx LeetCode6

#### Revision 302019-03-17 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 102 to 102

 Minimum Spanning TreesPrim’s AlgorithmUnion-Find Structure Feb 18 Huffman CodesHeaps and Priority Queues Ch 22, 23 Kruskal LeetCode3 Feb 20 More on Union-Find and MSTMidterm Questions 01UnionFind.pdf Kruskal Problem Set 3, Teams, moodle Feb 22 Exam Study Guide Presentation Topic Submit
Changed:
<
<
 Divide and Conquer Feb 25 Art Gallary Visit - Art and Algorithms Ch 4, 7 MidtermSolutions.pdf DivideConquer.pptx Feb 27 Exam 1 CH 4.5 recurences.pptx Mar 1
>
>
 Art Gallary Visit - Art and Algorithms Feb 25 Ch 4, 7 Feb 27 Exam 1 CH 4.5 Mar 1

 Spring Break
Changed:
<
<
 Mar 18 Kruskal’s Algorithm Sorting CH 4 recurences.pptx LeetCode4
>
>
 Mar 18 Divide and conquer Inversion Counting Minimum Distance CH 4 Divide & Conquer

 Mar 20 Analyzing Recurrence relations CH 4 Master Theorem recurences.pptx Problem Set 4, Teams Moodle Mar 22 Analyzing Recurrence relations CH 4
Changed:
<
<
 Mar 25 Divide and conquer Inversion Counting Minimum Distance 4 DivideAndConquerNotes.pdf InversionCounting.pptx closestpoint.pptx Problem Set 5 Moodle Mar 27 Linear Sorting 8 linearsorting.pptx LeetCode5 Mar 29 Dynamic Programming Introduction 15 dynamic-programming.ppt Apr 1 Dynamic Programming Linear Sorting 15 LeetCode6 Apr 3 Dynamic Programming Rodcutting 15 rodcut.pptx
>
>
 Mar 25 4 DivideAndConquerNotes.pdf InversionCounting.pptx closestpoint.pptx Problem Set 5 Moodle Mar 27 Linear Sorting 8 linearsorting.pptx LeetCode4 Mar 29 Dynamic Programming Introduction 15 dynamic-programming.ppt LeetCode5 Apr 1 Dynamic Programming Linear Sorting 15 Apr 3 Dynamic Programming Rodcutting 15 rodcut.pptx LeetCode6

 Apr 5 Dynamic Programming Weighted Interval Selection weighted_interval_selection.pptx LeetCode7 Apr 8 Dynamic Programming Russian Doll Envelope 15 Russian Doll Envelope Problem Set 6 Apr 10 Searching Hashing 11 HashingIntro.ppt LeetCode8

#### Revision 292019-02-27 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 102 to 102

 Minimum Spanning TreesPrim’s AlgorithmUnion-Find Structure Feb 18 Huffman CodesHeaps and Priority Queues Ch 22, 23 Kruskal LeetCode3 Feb 20 More on Union-Find and MSTMidterm Questions 01UnionFind.pdf Kruskal Problem Set 3, Teams, moodle Feb 22 Exam Study Guide Presentation Topic Submit
Changed:
<
<
 Feb 25 Art Gallary Visit Ch 4, 7 MidtermSolutions.pdf DivideConquer.pptx
>
>
 Feb 25 Art Gallary Visit - Art and Algorithms Ch 4, 7 MidtermSolutions.pdf DivideConquer.pptx

 Divide and Conquer Feb 27 Exam 1 CH 4.5 recurences.pptx Mar 1 Spring Break

#### Revision 282019-02-25 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 102 to 102

 Minimum Spanning TreesPrim’s AlgorithmUnion-Find Structure Feb 18 Huffman CodesHeaps and Priority Queues Ch 22, 23 Kruskal LeetCode3 Feb 20 More on Union-Find and MSTMidterm Questions 01UnionFind.pdf Kruskal Problem Set 3, Teams, moodle Feb 22 Exam Study Guide Presentation Topic Submit
Changed:
<
<
 Feb 25 Kruskal’s Algorithm Sorting Ch 4, 7 MidtermSolutions.pdf DivideConquer.pptx
>
>
 Feb 25 Art Gallary Visit Ch 4, 7 MidtermSolutions.pdf DivideConquer.pptx

 Divide and Conquer Feb 27 Exam 1 CH 4.5 recurences.pptx Mar 1 Spring Break
Changed:
<
<
 Mar 18 Analyzing Recurrence relations CH 4 recurences.pptx LeetCode4
>
>
 Mar 18 Kruskal’s Algorithm Sorting CH 4 recurences.pptx LeetCode4

 Mar 20 Analyzing Recurrence relations CH 4 Master Theorem recurences.pptx Problem Set 4, Teams Moodle Mar 22 Analyzing Recurrence relations CH 4 Mar 25 Divide and conquer Inversion Counting Minimum Distance 4 DivideAndConquerNotes.pdf InversionCounting.pptx closestpoint.pptx Problem Set 5 Moodle

#### Revision 272019-02-25 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 99 to 99

 Feb 11 Runtime AnalysisPresent Problem Set 2 Solutions Asymptotic Analysis Big-O, Little-O, Theta, Omega Problem Set 2, Teams, moodle Feb 13 Runtime Analysis CH 16 Greedy Algorithms Feb 15 Presentation OverviewRuntime Analysis Ch 17
Changed:
<
<
 Feb 18 Huffman CodesHeaps and Priority QueuesMinimum Spanning Trees Prim’s Algorithm Kruskal’s Algorithm Union-Find Structure Ch 22, 23 Kruskal LeetCode3
>
>
 Feb 18 Huffman CodesHeaps and Priority Queues Ch 22, 23 Kruskal LeetCode3

 Feb 20 More on Union-Find and MSTMidterm Questions 01UnionFind.pdf Kruskal Problem Set 3, Teams, moodle
Changed:
<
<
 Exam 1 Feb 22 Exam Study Guide Presentation Topic Submit Feb 25 Divide and Conquer Sorting Ch 4, 7 MidtermSolutions.pdf DivideConquer.pptx Feb 27 Analyzing Recurrence relations CH 4.5 recurences.pptx Mar 1 Present PS04 Solutions
>
>
 Minimum Spanning TreesPrim’s AlgorithmUnion-Find Structure Divide and Conquer Feb 22 Exam Study Guide Presentation Topic Submit Feb 25 Kruskal’s Algorithm Sorting Ch 4, 7 MidtermSolutions.pdf DivideConquer.pptx Feb 27 Exam 1 CH 4.5 recurences.pptx Mar 1

 Spring Break Mar 18 Analyzing Recurrence relations CH 4 recurences.pptx LeetCode4 Mar 20 Analyzing Recurrence relations CH 4 Master Theorem recurences.pptx Problem Set 4, Teams Moodle

#### Revision 262019-02-22 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

#### Revision 252019-02-20 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 103 to 103

 Exam 1 Feb 20 More on Union-Find and MSTMidterm Questions 01UnionFind.pdf Kruskal Problem Set 3, Teams, moodle Feb 22 Exam Study Guide Presentation Topic Submit Feb 25 Divide and Conquer Sorting Ch 4, 7 MidtermSolutions.pdf DivideConquer.pptx
Changed:
<
<
 Feb 27 Analyzing Recurrence relations CH 4.5 recurences.pptx LeetCode4 Mar 1 Present PS04 Solutions Problem Set 4, Teams Moodle
>
>
 Feb 27 Analyzing Recurrence relations CH 4.5 recurences.pptx Mar 1 Present PS04 Solutions

 Spring Break
Changed:
<
<
 Mar 18 Analyzing Recurrence relations CH 4 recurences.pptx Mar 20 Analyzing Recurrence relations CH 4 Master Theorem recurences.pptx
>
>
 Mar 18 Analyzing Recurrence relations CH 4 recurences.pptx LeetCode4 Mar 20 Analyzing Recurrence relations CH 4 Master Theorem recurences.pptx Problem Set 4, Teams Moodle

 Mar 22 Analyzing Recurrence relations CH 4 Mar 25 Divide and conquer Inversion Counting Minimum Distance 4 DivideAndConquerNotes.pdf InversionCounting.pptx closestpoint.pptx Problem Set 5 Moodle Mar 27 Linear Sorting 8 linearsorting.pptx LeetCode5

#### Revision 242019-02-19 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 99 to 99

 Feb 11 Runtime AnalysisPresent Problem Set 2 Solutions Asymptotic Analysis Big-O, Little-O, Theta, Omega Problem Set 2, Teams, moodle Feb 13 Runtime Analysis CH 16 Greedy Algorithms Feb 15 Presentation OverviewRuntime Analysis Ch 17
Changed:
<
<
 Feb 18 Huffman CodesHeaps and Priority QueuesMinimum Spanning Trees Prim’s Algorithm Kruskal’s Algorithm Union-Find Structure Ch 22, 23 kruskal.pptx LeetCode3 Feb 20 More on Union-Find and MSTMidterm Questions 01UnionFind.pdf Problem Set 3, Teams, moodle
>
>
 Feb 18 Huffman CodesHeaps and Priority QueuesMinimum Spanning Trees Prim’s Algorithm Kruskal’s Algorithm Union-Find Structure Ch 22, 23 Kruskal LeetCode3 Feb 20 More on Union-Find and MSTMidterm Questions 01UnionFind.pdf Kruskal Problem Set 3, Teams, moodle

 Exam 1 Feb 22 Exam Study Guide Presentation Topic Submit Feb 25 Divide and Conquer Sorting Ch 4, 7 MidtermSolutions.pdf DivideConquer.pptx Feb 27 Analyzing Recurrence relations CH 4.5 recurences.pptx LeetCode4

#### Revision 232019-02-18 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 99 to 99

 Feb 11 Runtime AnalysisPresent Problem Set 2 Solutions Asymptotic Analysis Big-O, Little-O, Theta, Omega Problem Set 2, Teams, moodle Feb 13 Runtime Analysis CH 16 Greedy Algorithms Feb 15 Presentation OverviewRuntime Analysis Ch 17
Changed:
<
<
 Feb 18 Huffman CodesHeaps and Priority QueuesMinimum Spanning Trees Prim’s Algorithm Kruskal’s Algorithm Union-Find Structure Ch 22, 23 kruskal.pptx LeetCode3
>
>
 Feb 18 Huffman CodesHeaps and Priority QueuesMinimum Spanning Trees Prim’s Algorithm Kruskal’s Algorithm Union-Find Structure Ch 22, 23 kruskal.pptx LeetCode3

 Exam 1 Feb 20 More on Union-Find and MSTMidterm Questions 01UnionFind.pdf Problem Set 3, Teams, moodle Feb 22 Exam Study Guide Presentation Topic Submit Feb 25 Divide and Conquer Sorting Ch 4, 7 MidtermSolutions.pdf DivideConquer.pptx

#### Revision 222019-02-14 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 97 to 97

 Feb 6 Runtime Analysis Asymptotic notation Worst-case analysis Binary search Problem bounds Ch 3 Feb 8 Present LeetCode2 solutionsRuntime Analysis. Ch 3 Asymptotic Analysis LeetCode2 Feb 11 Runtime AnalysisPresent Problem Set 2 Solutions Asymptotic Analysis Big-O, Little-O, Theta, Omega Problem Set 2, Teams, moodle
Changed:
<
<
 Feb 13 Presentation OverviewRuntime Analysis CH 16 Greedy Algorithms Feb 15 Huffman CodesHeaps and Priority Queues Ch 17 LeetCode3 Feb 18 Minimum Spanning Trees Prim’s Algorithm Kruskal’s Algorithm Union-Find Structure Ch 22, 23 kruskal.pptx Presentation Topic Submit
>
>
 Feb 13 Runtime Analysis CH 16 Greedy Algorithms Feb 15 Presentation OverviewRuntime Analysis Ch 17 Feb 18 Huffman CodesHeaps and Priority QueuesMinimum Spanning Trees Prim’s Algorithm Kruskal’s Algorithm Union-Find Structure Ch 22, 23 kruskal.pptx LeetCode3

 Feb 20 More on Union-Find and MSTMidterm Questions 01UnionFind.pdf Problem Set 3, Teams, moodle
Changed:
<
<
 Exam 1 Feb 22 Exam Study Guide
>
>
 Exam 1 Feb 22 Exam Study Guide Presentation Topic Submit

 Feb 25 Divide and Conquer Sorting Ch 4, 7 MidtermSolutions.pdf DivideConquer.pptx Feb 27 Analyzing Recurrence relations CH 4.5 recurences.pptx LeetCode4 Mar 1 Present PS04 Solutions Problem Set 4, Teams Moodle

#### Revision 212019-02-13 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 96 to 96

 Feb 4 Greedy Algorithms Classroom Scheduling Interval Scheduling Fractional Knapsack Feb 6 Runtime Analysis Asymptotic notation Worst-case analysis Binary search Problem bounds Ch 3 Feb 8 Present LeetCode2 solutionsRuntime Analysis. Ch 3 Asymptotic Analysis LeetCode2
Changed:
<
<
 Feb 11 Runtime AnalysisPresent Problem Set 2 Solutions Asymptotic Analysis Problem Set 2, Teams, moodle
>
>
 Feb 11 Runtime AnalysisPresent Problem Set 2 Solutions Asymptotic Analysis Big-O, Little-O, Theta, Omega Problem Set 2, Teams, moodle

 Feb 13 Presentation OverviewRuntime Analysis CH 16 Greedy Algorithms Feb 15 Huffman CodesHeaps and Priority Queues Ch 17 LeetCode3 Feb 18 Minimum Spanning Trees Prim’s Algorithm Kruskal’s Algorithm Union-Find Structure Ch 22, 23 kruskal.pptx Presentation Topic Submit

#### Revision 202019-02-11 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 96 to 96

 Feb 4 Greedy Algorithms Classroom Scheduling Interval Scheduling Fractional Knapsack Feb 6 Runtime Analysis Asymptotic notation Worst-case analysis Binary search Problem bounds Ch 3 Feb 8 Present LeetCode2 solutionsRuntime Analysis. Ch 3 Asymptotic Analysis LeetCode2
Changed:
<
<
 Feb 11 Project OverviewRuntime AnalysisPresent Problem Set 2 Solutions Problem Set 2, Teams, moodle Feb 13 Greedy Algorithms Overview Huffman Codes CH 16 Greedy Algorithms Feb 15 Huffman CodesHeaps and Priority Queues Ch 17 LeetCode3 Problem Set 3
>
>
 Feb 11 Runtime AnalysisPresent Problem Set 2 Solutions Asymptotic Analysis Problem Set 2, Teams, moodle Feb 13 Presentation OverviewRuntime Analysis CH 16 Greedy Algorithms Feb 15 Huffman CodesHeaps and Priority Queues Ch 17 LeetCode3

 Feb 18 Minimum Spanning Trees Prim’s Algorithm Kruskal’s Algorithm Union-Find Structure Ch 22, 23 kruskal.pptx Presentation Topic Submit
Changed:
<
<
 Feb 20 More on Union-Find and MSTMidterm Questions 01UnionFind.pdf
>
>
 Feb 20 More on Union-Find and MSTMidterm Questions 01UnionFind.pdf Problem Set 3, Teams, moodle

 Exam 1 Feb 22 Exam Study Guide Feb 25 Divide and Conquer Sorting Ch 4, 7 MidtermSolutions.pdf DivideConquer.pptx Feb 27 Analyzing Recurrence relations CH 4.5 recurences.pptx LeetCode4
Changed:
<
<
 Mar 1 Art Gallary? Problem Set 4 Moodle
>
>
 Mar 1 Present PS04 Solutions Problem Set 4, Teams Moodle

 Spring Break Mar 18 Analyzing Recurrence relations CH 4 recurences.pptx Mar 20 Analyzing Recurrence relations CH 4 Master Theorem recurences.pptx
Line: 147 to 147

>
>

 META FILEATTACHMENT attachment="Algorithms.jpg" attr="" comment="" date="1545016221" name="Algorithms.jpg" path="Algorithms.jpg" size="30820" user="JimSkon" version="1" attachment="PS01.pdf" attr="" comment="" date="1547671150" name="PS01.pdf" path="PS01.pdf" size="116933" user="JimSkon" version="3" attachment="PS01.zip" attr="" comment="" date="1547666631" name="PS01.zip" path="PS01.zip" size="2286" user="JimSkon" version="1" attachment="PS02.pdf" attr="" comment="" date="1548699981" name="PS02.pdf" path="PS02.pdf" size="92320" user="JimSkon" version="1"
>
>
 META FILEATTACHMENT attachment="PS03.pdf" attr="" comment="" date="1549905718" name="PS03.pdf" path="PS03.pdf" size="117596" user="JimSkon" version="2" attachment="PS04.pdf" attr="" comment="" date="1549906015" name="PS04.pdf" path="PS04.pdf" size="161833" user="JimSkon" version="1"

#### Revision 192019-02-08 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 94 to 94

 Jan 30 Cold Day! Problem Set 1, tex, Teams Moodle Feb 1 Present Problem Set 1 SolutionsGreedy Algorithms Disjkstra's Algorithm Dijkstra's Algorithm Problem Set 1, tex, Teams Moodle Feb 4 Greedy Algorithms Classroom Scheduling Interval Scheduling Fractional Knapsack
Changed:
<
<
 Feb 6 Runtime Analysis Asymptotic notation Worst-case analysis Binary search Problem bounds Present LeetCode2 solutions Ch 3 Feb 8 Runtime Analysis.Present Problem Set 2 Solutions Ch 3 Asymptotic Analysis LeetCode2 Feb 11 Project OverviewRuntime Analysis Problem Set 2, Teams, moodle
>
>
 Feb 6 Runtime Analysis Asymptotic notation Worst-case analysis Binary search Problem bounds Ch 3 Feb 8 Present LeetCode2 solutionsRuntime Analysis. Ch 3 Asymptotic Analysis LeetCode2 Feb 11 Project OverviewRuntime AnalysisPresent Problem Set 2 Solutions Problem Set 2, Teams, moodle

 Feb 13 Greedy Algorithms Overview Huffman Codes CH 16 Greedy Algorithms Feb 15 Huffman CodesHeaps and Priority Queues Ch 17 LeetCode3 Problem Set 3 Feb 18 Minimum Spanning Trees Prim’s Algorithm Kruskal’s Algorithm Union-Find Structure Ch 22, 23 kruskal.pptx Presentation Topic Submit

#### Revision 182019-02-04 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 94 to 94

 Jan 30 Cold Day! Problem Set 1, tex, Teams Moodle Feb 1 Present Problem Set 1 SolutionsGreedy Algorithms Disjkstra's Algorithm Dijkstra's Algorithm Problem Set 1, tex, Teams Moodle Feb 4 Greedy Algorithms Classroom Scheduling Interval Scheduling Fractional Knapsack
Changed:
<
<
 Feb 6 Runtime Analysis Asymptotic notation Worst-case analysis Binary search Problem bounds Present LeetCode2 solutions Ch 3 LeetCode2 Feb 8 Runtime Analysis.Present Problem Set 2 Solutions Ch 3 Asymptotic Analysis Problem Set 2, Teams, moodle Feb 11 Project OverviewRuntime Analysis
>
>
 Feb 6 Runtime Analysis Asymptotic notation Worst-case analysis Binary search Problem bounds Present LeetCode2 solutions Ch 3 Feb 8 Runtime Analysis.Present Problem Set 2 Solutions Ch 3 Asymptotic Analysis LeetCode2 Feb 11 Project OverviewRuntime Analysis Problem Set 2, Teams, moodle

 Feb 13 Greedy Algorithms Overview Huffman Codes CH 16 Greedy Algorithms Feb 15 Huffman CodesHeaps and Priority Queues Ch 17 LeetCode3 Problem Set 3 Feb 18 Minimum Spanning Trees Prim’s Algorithm Kruskal’s Algorithm Union-Find Structure Ch 22, 23 kruskal.pptx Presentation Topic Submit

#### Revision 172019-01-30 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 91 to 91

 Jan 23 Present LeetCode1 solutionsAlgorithm Proof By Induction: Proofs of Algorithms LeetCode1 Jan 25 Graph Theory Ch 22 Graph Theory Jan 28 Graph Theory Proof Example Ch 23 Course Project Instructions
Changed:
<
<
 Jan 30 Present Problem Set 1 Solutions Problem Set 1, tex, Teams Moodle Feb 1 Greedy Algorithms Disjkstra's Algorithm Dijkstra's Algorithm
>
>
 Jan 30 Cold Day! Problem Set 1, tex, Teams Moodle Feb 1 Present Problem Set 1 SolutionsGreedy Algorithms Disjkstra's Algorithm Dijkstra's Algorithm Problem Set 1, tex, Teams Moodle

 Feb 4 Greedy Algorithms Classroom Scheduling Interval Scheduling Fractional Knapsack Feb 6 Runtime Analysis Asymptotic notation Worst-case analysis Binary search Problem bounds Present LeetCode2 solutions Ch 3 LeetCode2 Feb 8 Runtime Analysis.Present Problem Set 2 Solutions Ch 3 Asymptotic Analysis Problem Set 2, Teams, moodle

#### Revision 162019-01-28 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 97 to 97

 Feb 6 Runtime Analysis Asymptotic notation Worst-case analysis Binary search Problem bounds Present LeetCode2 solutions Ch 3 LeetCode2 Feb 8 Runtime Analysis.Present Problem Set 2 Solutions Ch 3 Asymptotic Analysis Problem Set 2, Teams, moodle Feb 11 Project OverviewRuntime Analysis
Changed:
<
<
 Feb 13 Greedy Algorithms Overview Huffman Codes CH 16 greedyOverview.ppt
>
>
 Feb 13 Greedy Algorithms Overview Huffman Codes CH 16 Greedy Algorithms

 Feb 15 Huffman CodesHeaps and Priority Queues Ch 17 LeetCode3 Problem Set 3
Changed:
<
<
 Feb 18 Minimum Spanning Trees Prim’s Algorithm Kruskal’s Algorithm Union-Find Structure Ch 22, 23 kruskal.pptx Presentation Topic Submit
>
>
 Feb 18 Minimum Spanning Trees Prim’s Algorithm Kruskal’s Algorithm Union-Find Structure Ch 22, 23 kruskal.pptx Presentation Topic Submit

 Exam 1 Feb 20 More on Union-Find and MSTMidterm Questions 01UnionFind.pdf Feb 22 Exam Study Guide Feb 25 Divide and Conquer Sorting Ch 4, 7 MidtermSolutions.pdf DivideConquer.pptx

#### Revision 152019-01-28 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 95 to 95

 Feb 1 Greedy Algorithms Disjkstra's Algorithm Dijkstra's Algorithm Feb 4 Greedy Algorithms Classroom Scheduling Interval Scheduling Fractional Knapsack Feb 6 Runtime Analysis Asymptotic notation Worst-case analysis Binary search Problem bounds Present LeetCode2 solutions Ch 3 LeetCode2
Changed:
<
<
 Feb 8 Runtime Analysis.Present Problem Set 2 Solutions Ch 3 Asymptotic Analysis Problem Set 2
>
>
 Feb 8 Runtime Analysis.Present Problem Set 2 Solutions Ch 3 Asymptotic Analysis Problem Set 2, Teams, moodle

 Feb 11 Project OverviewRuntime Analysis Feb 13 Greedy Algorithms Overview Huffman Codes CH 16 greedyOverview.ppt Feb 15 Huffman CodesHeaps and Priority Queues Ch 17 LeetCode3 Problem Set 3
Line: 148 to 148

>
>

 META FILEATTACHMENT attachment="Algorithms.jpg" attr="" comment="" date="1545016221" name="Algorithms.jpg" path="Algorithms.jpg" size="30820" user="JimSkon" version="1" attachment="PS01.pdf" attr="" comment="" date="1547671150" name="PS01.pdf" path="PS01.pdf" size="116933" user="JimSkon" version="3" attachment="PS01.zip" attr="" comment="" date="1547666631" name="PS01.zip" path="PS01.zip" size="2286" user="JimSkon" version="1"
>
>
 META FILEATTACHMENT attachment="PS02.pdf" attr="" comment="" date="1548699981" name="PS02.pdf" path="PS02.pdf" size="92320" user="JimSkon" version="1"

#### Revision 142019-01-27 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 90 to 90

 Algorithm Proof by Loop Invarient Jan 21 Ch 2 Proofs of Algorithms Jan 23 Present LeetCode1 solutionsAlgorithm Proof By Induction: Proofs of Algorithms LeetCode1 Jan 25 Graph Theory Ch 22 Graph Theory
Changed:
<
<
 Jan 28 Graph Theory Proof Example Present LeetCode2 solutions Ch 23 Course Project Instructions
>
>
 Jan 28 Graph Theory Proof Example Ch 23 Course Project Instructions

 Jan 30 Present Problem Set 1 Solutions Problem Set 1, tex, Teams Moodle Feb 1 Greedy Algorithms Disjkstra's Algorithm Dijkstra's Algorithm Feb 4 Greedy Algorithms Classroom Scheduling Interval Scheduling Fractional Knapsack
Changed:
<
<
 Feb 6 Runtime Analysis Asymptotic notation Worst-case analysis Binary search Problem bounds Present Problem Set 2 Solutions Ch 3 LeetCode2 Feb 8 Runtime Analysis. Ch 3 Asymptotic Analysis Problem Set 2
>
>
 Feb 6 Runtime Analysis Asymptotic notation Worst-case analysis Binary search Problem bounds Present LeetCode2 solutions Ch 3 LeetCode2 Feb 8 Runtime Analysis.Present Problem Set 2 Solutions Ch 3 Asymptotic Analysis Problem Set 2

 Feb 11 Project OverviewRuntime Analysis Feb 13 Greedy Algorithms Overview Huffman Codes CH 16 greedyOverview.ppt Feb 15 Huffman CodesHeaps and Priority Queues Ch 17 LeetCode3 Problem Set 3

#### Revision 132019-01-20 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 93 to 93

 Jan 28 Graph Theory Proof Example Present LeetCode2 solutions Ch 23 Course Project Instructions Jan 30 Present Problem Set 1 Solutions Problem Set 1, tex, Teams Moodle Feb 1 Greedy Algorithms Disjkstra's Algorithm Dijkstra's Algorithm
Changed:
<
<
 Feb 4 Greedy Algorithms Classroom Scheduling Interval Scheduling Fractional Knapsack LeetCode2 Feb 6 Runtime Analysis Asymptotic notation Worst-case analysis Binary search Problem bounds Present Problem Set 2 Solutions Ch 3 Problem Set 2 Solutions Feb 8 Runtime Analysis. Ch 3 asymptotic.pptx
>
>
 Feb 4 Greedy Algorithms Classroom Scheduling Interval Scheduling Fractional Knapsack Feb 6 Runtime Analysis Asymptotic notation Worst-case analysis Binary search Problem bounds Present Problem Set 2 Solutions Ch 3 LeetCode2 Feb 8 Runtime Analysis. Ch 3 Asymptotic Analysis Problem Set 2

 Feb 11 Project OverviewRuntime Analysis Feb 13 Greedy Algorithms Overview Huffman Codes CH 16 greedyOverview.ppt Feb 15 Huffman CodesHeaps and Priority Queues Ch 17 LeetCode3 Problem Set 3

#### Revision 122019-01-20 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 92 to 92

 Jan 25 Graph Theory Ch 22 Graph Theory Jan 28 Graph Theory Proof Example Present LeetCode2 solutions Ch 23 Course Project Instructions Jan 30 Present Problem Set 1 Solutions Problem Set 1, tex, Teams Moodle
Changed:
<
<
 Feb 1 Greedy Algorithms Disjkstra's Algorithm Dijkstra's Algorithm Feb 4 Greedy Algorithms Classroom Scheduling intervalScheduling.pptx knapsack.pptx LeetCode2
>
>
 Feb 1 Greedy Algorithms Disjkstra's Algorithm Dijkstra's Algorithm Feb 4 Greedy Algorithms Classroom Scheduling Interval Scheduling Fractional Knapsack LeetCode2

 Feb 6 Runtime Analysis Asymptotic notation Worst-case analysis Binary search Problem bounds Present Problem Set 2 Solutions Ch 3 Problem Set 2 Solutions Feb 8 Runtime Analysis. Ch 3 asymptotic.pptx Feb 11 Project OverviewRuntime Analysis

#### Revision 112019-01-19 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 80 to 80

>
>

Review the slides. It is you responsibility to be familiar with the following:
• Logarithms
• Graphs
• Proof notation
• Pseudocode
• Heaps
• Array v. Lists
Review Slides
Jan 14 Introduction
• Joseph Flavius
• Course Details
Ch 1 Josephus
Information Form
Introduction
Jan 16

Programming Environment

• repl.it
• LeetCode
Bring Laptop to class!

Jan 18 Proof By Induction
• Proof: Tiling
• Proof: A tree of n nodes has n-1 edges
Ch 2   Induction LeetCode0
Changed:
<
<
 Jan 21 Proof By Induction (Faulty) Proof: Right-handed people do not exist Proof: Candy Bars Ch 2 Proofs of Algorithms Jan 23 Present LeetCode1 solutionsProof By Induction: Proving programs correct by induction Proofs of Algorithms LeetCode1
>
>
 Algorithm Proof by Loop Invarient Jan 21 Ch 2 Proofs of Algorithms Jan 23 Present LeetCode1 solutionsAlgorithm Proof By Induction: Proofs of Algorithms LeetCode1

 Jan 25 Graph Theory Ch 22 Graph Theory Jan 28 Graph Theory Proof Example Present LeetCode 2 solutions Ch 23 Course Project Instructions
Changed:
<
<
 Jan 30 Present Problem Set 1 Solutions Problem Set 1, tex Moodle Feb 1 Greedy Algorithms Disjkstra's Algorithm dijkstra.pptx
>
>
 Jan 30 Present Problem Set 1 Solutions Problem Set 1, tex, Teams Moodle Feb 1 Greedy Algorithms Disjkstra's Algorithm Dijkstra's Algorithm

 Feb 4 Greedy Algorithms Classroom Scheduling intervalScheduling.pptx knapsack.pptx LeetCode2 Feb 6 Runtime Analysis Asymptotic notation Worst-case analysis Binary search Problem bounds Present Problem Set 2 Solutions Ch 3 Problem Set 2 Solutions Feb 8 Runtime Analysis. Ch 3 asymptotic.pptx

#### Revision 102019-01-16 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 89 to 89

 Jan 21 Proof By Induction (Faulty) Proof: Right-handed people do not exist Proof: Candy Bars Ch 2 Proofs of Algorithms Jan 23 Present LeetCode1 solutionsProof By Induction: Proving programs correct by induction Proofs of Algorithms LeetCode1 Jan 25 Graph Theory Ch 22 Graph Theory
Changed:
<
<
 Jan 28 Graph Theory Proof Example Present LeetCode 2 solutions Ch 23 Course Project Instructions LeetCode2
>
>
 Jan 28 Graph Theory Proof Example Present LeetCode 2 solutions Ch 23 Course Project Instructions

 Jan 30 Present Problem Set 1 Solutions Problem Set 1, tex Moodle Feb 1 Greedy Algorithms Disjkstra's Algorithm dijkstra.pptx
Changed:
<
<
 Feb 4 Greedy Algorithms Classroom Scheduling intervalScheduling.pptx knapsack.pptx
>
>
 Feb 4 Greedy Algorithms Classroom Scheduling intervalScheduling.pptx knapsack.pptx LeetCode2

 Feb 6 Runtime Analysis Asymptotic notation Worst-case analysis Binary search Problem bounds Present Problem Set 2 Solutions Ch 3 Problem Set 2 Solutions Feb 8 Runtime Analysis. Ch 3 asymptotic.pptx Feb 11 Project OverviewRuntime Analysis
Line: 145 to 148

 META FILEATTACHMENT attachment="Algorithms.jpg" attr="" comment="" date="1545016221" name="Algorithms.jpg" path="Algorithms.jpg" size="30820" user="JimSkon" version="1"
Changed:
<
<
 META FILEATTACHMENT attachment="PS01.pdf" attr="" comment="" date="1547666255" name="PS01.pdf" path="PS01.pdf" size="116576" user="JimSkon" version="2"
>
>
 META FILEATTACHMENT attachment="PS01.pdf" attr="" comment="" date="1547671150" name="PS01.pdf" path="PS01.pdf" size="116933" user="JimSkon" version="3"

 META FILEATTACHMENT attachment="PS01.zip" attr="" comment="" date="1547666631" name="PS01.zip" path="PS01.zip" size="2286" user="JimSkon" version="1"

#### Revision 92019-01-16 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 86 to 86

 Jan 14 Introduction Joseph Flavius Course Details Ch 1 Josephus Information Form Introduction Jan 16 Programming Environment repl.it LeetCode Bring Laptop to class! repl.it LeetCode 344. Reverse Bits 389. Find the Difference Jan 18 Proof By Induction Proof: Tiling Proof: A tree of n nodes has n-1 edges Ch 2 Induction LeetCode0
Changed:
<
<
 Jan 21 Present LeetCode 1 solutions Proof By Induction (Faulty) Proof: Right-handed people do not exist Proof: Candy Bars Proofs of Algorithms LeetCode1 Jan 23 Proof By Induction: Proving programs correct by induction Proofs of Algorithms
>
>
 Jan 21 Proof By Induction (Faulty) Proof: Right-handed people do not exist Proof: Candy Bars Ch 2 Proofs of Algorithms Jan 23 Present LeetCode1 solutionsProof By Induction: Proving programs correct by induction Proofs of Algorithms LeetCode1

 Jan 25 Graph Theory Ch 22 Graph Theory Jan 28 Graph Theory Proof Example Present LeetCode 2 solutions Ch 23 Course Project Instructions LeetCode2
Changed:
<
<
 Jan 30 Present Problem Set 1 Solutions Problem Set 1
>
>
 Jan 30 Present Problem Set 1 Solutions Problem Set 1, tex Moodle

 Feb 1 Greedy Algorithms Disjkstra's Algorithm dijkstra.pptx Feb 4 Greedy Algorithms Classroom Scheduling intervalScheduling.pptx knapsack.pptx Feb 6 Runtime Analysis Asymptotic notation Worst-case analysis Binary search Problem bounds Present Problem Set 2 Solutions Ch 3 Problem Set 2 Solutions
Line: 148 to 145

 META FILEATTACHMENT attachment="Algorithms.jpg" attr="" comment="" date="1545016221" name="Algorithms.jpg" path="Algorithms.jpg" size="30820" user="JimSkon" version="1"
>
>
 META FILEATTACHMENT attachment="PS01.pdf" attr="" comment="" date="1547666255" name="PS01.pdf" path="PS01.pdf" size="116576" user="JimSkon" version="2" attachment="PS01.zip" attr="" comment="" date="1547666631" name="PS01.zip" path="PS01.zip" size="2286" user="JimSkon" version="1"

#### Revision 82019-01-16 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 86 to 86

 Jan 14 Introduction Joseph Flavius Course Details Ch 1 Josephus Information Form Introduction Jan 16 Programming Environment repl.it LeetCode Bring Laptop to class! repl.it LeetCode 344. Reverse Bits 389. Find the Difference Jan 18 Proof By Induction Proof: Tiling Proof: A tree of n nodes has n-1 edges Ch 2 Induction LeetCode0
Changed:
<
<
 Jan 21 Present LeetCode 1 solutions Proof By Induction (Faulty) Proof: Right-handed people do not exist Proof: Candy Bars Proofs of Algorithms LeetCode1
>
>
 Jan 21 Present LeetCode 1 solutions Proof By Induction (Faulty) Proof: Right-handed people do not exist Proof: Candy Bars Proofs of Algorithms LeetCode1

 Jan 23 Proof By Induction: Proving programs correct by induction Proofs of Algorithms Jan 25 Graph Theory Ch 22 Graph Theory Jan 28 Graph Theory Proof Example Present LeetCode 2 solutions Ch 23 Course Project Instructions LeetCode2

#### Revision 72019-01-14 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 81 to 81

Changed:
<
<
Review the slides. It is you responsibility to be familiar with the following:
• Logarithms
• Graphs
• Proof notation
• Pseudocode
• Heaps
• Array v. Lists
Review Slides
Jan 14 Introduction
• Joseph Flavius
• Course Details
Ch 1 Josephus   Introduction
Jan 16

Programming Environment

• repl.it
• LeetCode
Bring Laptop to class!

Jan 18 Proof By Induction
• Proof: Tiling
• Proof: A tree of n nodes has n-1 edges
Ch 2     Induction LeetCode0
Jan 21

Present LeetCode 1 solutions

Proof By Induction

• (Faulty) Proof: Right-handed people do not exist
• Proof: Candy Bars
Proofs of Algorithms LeetCode1
Jan 23 Proof By Induction:
• Proving programs correct by induction
Proofs of Algorithms
Jan 25 Graph Theory Ch 22     Graph Theory
Jan 28 Graph Theory Proof Example Present LeetCode 2 solutions Ch 23 Course Project Instructions     LeetCode2
Jan 30 Present Problem Set 1 Solutions         Problem Set 1
Feb 1 Greedy Algorithms
• Disjkstra's Algorithm
dijkstra.pptx
Feb 4

Greedy Algorithms

• Classroom Scheduling
intervalScheduling.pptx
knapsack.pptx

Feb 6 Runtime Analysis
• Asymptotic notation
• Worst-case analysis
• Binary search
• Problem bounds
Present Problem Set 2 Solutions
Ch 3       Problem Set 2
Solutions
Feb 8 Runtime Analysis. Ch 3     asymptotic.pptx
Feb 11 Project Overview
Runtime Analysis

Feb 13 Greedy Algorithms
• Overview
• Huffman Codes
CH 16     greedyOverview.ppt
Feb 15 Huffman Codes
Heaps and Priority Queues
Ch 17       LeetCode3
Problem Set 3
Feb 18

Minimum Spanning Trees

• Prim’s Algorithm
• Kruskal’s Algorithm
• Union-Find Structure
Ch 22, 23     kruskal.pptx Presentation Topic Submit
Feb 20 More on Union-Find and MST
Midterm Questions
01UnionFind.pdf
Feb 22 Exam 1   Exam Study Guide
Feb 25

Divide and Conquer

• Sorting
Ch 4, 7 MidtermSolutions.pdf   DivideConquer.pptx
Feb 27 Analyzing Recurrence relations CH 4.5     recurences.pptx LeetCode4
Mar 1 Art Gallary?         Problem Set 4
Moodle
Spring Break
Mar 18 Analyzing Recurrence relations CH 4     recurences.pptx
Mar 20 Analyzing Recurrence relations CH 4 Master Theorem   recurences.pptx
Mar 22 Analyzing Recurrence relations CH 4
Mar 25

Divide and conquer

• Inversion Counting
• Minimum Distance
4 DivideAndConquerNotes.pdf InversionCounting.pptx closestpoint.pptx   Problem Set 5 Moodle
Mar 27 Linear Sorting 8   linearsorting.pptx LeetCode5
Mar 29

Dynamic Programming

• Introduction
15     dynamic-programming.ppt
Apr 1

Dynamic Programming

• Linear Sorting
15       LeetCode6
Apr 3

Dynamic Programming

• Rodcutting
15     rodcut.pptx
Apr 5

Dynamic Programming

• Weighted Interval Selection
weighted_interval_selection.pptx LeetCode7
Apr 8

Dynamic Programming

• Russian Doll Envelope
15 Russian Doll Envelope     Problem Set 6
Apr 10 Searching
• Hashing
11     HashingIntro.ppt LeetCode8
Apr 12

Searching

• Hashing Consideration
11     HashingConsiderations.ppt Presentation Outline
Apr 15
• Present Problem Set 6 Solutions
• Present LeetCode 8 solutions
Exam 2 Study Guide
Apr 17 Tree Structures 12&18 B-Tree Simulation
B+ Tree Simulation
Trees.pptx
Apr 19           Problem Set 7
Apr 22

Exam 2

LeetCode9
Apr 24 P and NP, nondeterminism, reductions 34     AlgorithmicIntractability.pptx
Apr 26 P and NP, nondeterminism, reductions 34 Reduction Video   AlgorithmicIntractability.pptx
Apr 29 Reductions
• Subset Sum
• Hamiltonian Path
SubsetSumProof.ppt
May 1 Reductions         Problem Set 8 Moodle
May 3 Reductions
>
>
Review the slides. It is you responsibility to be familiar with the following:
• Logarithms
• Graphs
• Proof notation
• Pseudocode
• Heaps
• Array v. Lists
Review Slides
Jan 14 Introduction
• Joseph Flavius
• Course Details
Ch 1 Josephus
Information Form
Introduction
Jan 16

Programming Environment

• repl.it
• LeetCode
Bring Laptop to class!

Jan 18 Proof By Induction
• Proof: Tiling
• Proof: A tree of n nodes has n-1 edges
Ch 2   Induction LeetCode0
Jan 21

Present LeetCode 1 solutions

Proof By Induction

• (Faulty) Proof: Right-handed people do not exist
• Proof: Candy Bars
Proofs of Algorithms LeetCode1
Jan 23 Proof By Induction:
• Proving programs correct by induction
Proofs of Algorithms
Jan 25 Graph Theory Ch 22   Graph Theory
Jan 28 Graph Theory Proof Example Present LeetCode 2 solutions Ch 23 Course Project Instructions   LeetCode2
Jan 30 Present Problem Set 1 Solutions       Problem Set 1
Feb 1 Greedy Algorithms
• Disjkstra's Algorithm
dijkstra.pptx
Feb 4

Greedy Algorithms

• Classroom Scheduling
intervalScheduling.pptx
knapsack.pptx

Feb 6 Runtime Analysis
• Asymptotic notation
• Worst-case analysis
• Binary search
• Problem bounds
Present Problem Set 2 Solutions
Ch 3     Problem Set 2
Solutions
Feb 8 Runtime Analysis. Ch 3   asymptotic.pptx
Feb 11 Project Overview
Runtime Analysis

Feb 13 Greedy Algorithms
• Overview
• Huffman Codes
CH 16   greedyOverview.ppt
Feb 15 Huffman Codes
Heaps and Priority Queues
Ch 17     LeetCode3
Problem Set 3
Feb 18

Minimum Spanning Trees

• Prim’s Algorithm
• Kruskal’s Algorithm
• Union-Find Structure
Ch 22, 23   kruskal.pptx Presentation Topic Submit
Feb 20 More on Union-Find and MST
Midterm Questions
01UnionFind.pdf
Feb 22 Exam 1   Exam Study Guide
Feb 25

Divide and Conquer

• Sorting
Ch 4, 7 MidtermSolutions.pdf DivideConquer.pptx
Feb 27 Analyzing Recurrence relations CH 4.5   recurences.pptx LeetCode4
Mar 1 Art Gallary?       Problem Set 4
Moodle
Spring Break
Mar 18 Analyzing Recurrence relations CH 4   recurences.pptx
Mar 20 Analyzing Recurrence relations CH 4 Master Theorem recurences.pptx
Mar 22 Analyzing Recurrence relations CH 4
Mar 25

Divide and conquer

• Inversion Counting
• Minimum Distance
4 DivideAndConquerNotes.pdf InversionCounting.pptx closestpoint.pptx Problem Set 5 Moodle
Mar 27 Linear Sorting 8 linearsorting.pptx LeetCode5
Mar 29

Dynamic Programming

• Introduction
15   dynamic-programming.ppt
Apr 1

Dynamic Programming

• Linear Sorting
15     LeetCode6
Apr 3

Dynamic Programming

• Rodcutting
15   rodcut.pptx
Apr 5

Dynamic Programming

• Weighted Interval Selection
weighted_interval_selection.pptx LeetCode7
Apr 8

Dynamic Programming

• Russian Doll Envelope
15 Russian Doll Envelope   Problem Set 6
Apr 10 Searching
• Hashing
11   HashingIntro.ppt LeetCode8
Apr 12

Searching

• Hashing Consideration
11   HashingConsiderations.ppt Presentation Outline
Apr 15
• Present Problem Set 6 Solutions
• Present LeetCode 8 solutions
Exam 2 Study Guide
Apr 17 Tree Structures 12&18 B-Tree Simulation
B+ Tree Simulation
Trees.pptx
Apr 19         Problem Set 7
Apr 22

Exam 2

LeetCode9
Apr 24 P and NP, nondeterminism, reductions 34   AlgorithmicIntractability.pptx
Apr 26 P and NP, nondeterminism, reductions 34 Reduction Video AlgorithmicIntractability.pptx
Apr 29 Reductions
• Subset Sum
• Hamiltonian Path
SubsetSumProof.ppt
May 1 Reductions       Problem Set 8 Moodle
May 3 Reductions

Statement on Title XI

#### Revision 62019-01-14 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 86 to 86

 Jan 14 Introduction Joseph Flavius Course Details Ch 1 Josephus Introduction Jan 16 Programming Environment repl.it LeetCode Bring Laptop to class! repl.it LeetCode 344. Reverse Bits 389. Find the Difference Jan 18 Proof By Induction Proof: Tiling Proof: A tree of n nodes has n-1 edges Ch 2 Induction LeetCode0
Changed:
<
<
 Jan 21 Present LeetCode 1 solutions Proof By Induction (Faulty) Proof: Right-handed people do not exist Proof: Candy Bars Induction with Programs LeetCode1 Jan 23 Proof By Induction: Proving programs correct by induction AlgorithmProofs.pptx Jan 25 Graph Theory Ch 22 GraphTheory.pptx
>
>
 Jan 21 Present LeetCode 1 solutions Proof By Induction (Faulty) Proof: Right-handed people do not exist Proof: Candy Bars Proofs of Algorithms LeetCode1 Jan 23 Proof By Induction: Proving programs correct by induction Proofs of Algorithms Jan 25 Graph Theory Ch 22 Graph Theory

 Jan 28 Graph Theory Proof Example Present LeetCode 2 solutions Ch 23 Course Project Instructions LeetCode2 Jan 30 Present Problem Set 1 Solutions Problem Set 1 Feb 1 Greedy Algorithms Disjkstra's Algorithm dijkstra.pptx

#### Revision 52019-01-14 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 86 to 86

 Jan 14 Introduction Joseph Flavius Course Details Ch 1 Josephus Introduction Jan 16 Programming Environment repl.it LeetCode Bring Laptop to class! repl.it LeetCode 344. Reverse Bits 389. Find the Difference Jan 18 Proof By Induction Proof: Tiling Proof: A tree of n nodes has n-1 edges Ch 2 Induction LeetCode0
Changed:
<
<
 Jan 21 Present LeetCode 1 solutions Proof By Induction (Faulty) Proof: Right-handed people do not exist Proof: Candy Bars 03InductionPrograms.pptx LeetCode1
>
>
 Jan 21 Present LeetCode 1 solutions Proof By Induction (Faulty) Proof: Right-handed people do not exist Proof: Candy Bars Induction with Programs LeetCode1

 Jan 23 Proof By Induction: Proving programs correct by induction AlgorithmProofs.pptx Jan 25 Graph Theory Ch 22 GraphTheory.pptx Jan 28 Graph Theory Proof Example Present LeetCode 2 solutions Ch 23 Course Project Instructions LeetCode2

#### Revision 42019-01-13 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 85 to 85

 Review the slides. It is you responsibility to be familiar with the following: Logarithms Graphs Proof notation Pseudocode Heaps Array v. Lists Review Slides Jan 14 Introduction Joseph Flavius Course Details Ch 1 Josephus Introduction Jan 16 Programming Environment repl.it LeetCode Bring Laptop to class! repl.it LeetCode 344. Reverse Bits 389. Find the Difference
Changed:
<
<
 Jan 18 Proof By Induction Proof: Tiling Proof: A tree of n nodes has n-1 edges Ch 2 02induction.pptx LeetCode0
>
>
 Jan 18 Proof By Induction Proof: Tiling Proof: A tree of n nodes has n-1 edges Ch 2 Induction LeetCode0

 Jan 21 Present LeetCode 1 solutions Proof By Induction (Faulty) Proof: Right-handed people do not exist Proof: Candy Bars 03InductionPrograms.pptx LeetCode1 Jan 23 Proof By Induction: Proving programs correct by induction AlgorithmProofs.pptx Jan 25 Graph Theory Ch 22 GraphTheory.pptx

#### Revision 32019-01-13 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 82 to 82

Changed:
<
<
 Review the slides. It is you responsibility to be familiar with the following: Logarithms Graphs Proof notation Pseudocode Heaps Array v. Lists review.basic_tools.pptx Jan 14 Introduction Joseph Flavius Course Details Ch 1 Josephus 01intro.pptx
>
>
 Review the slides. It is you responsibility to be familiar with the following: Logarithms Graphs Proof notation Pseudocode Heaps Array v. Lists Review Slides Jan 14 Introduction Joseph Flavius Course Details Ch 1 Josephus Introduction

 Jan 16 Programming Environment repl.it LeetCode Bring Laptop to class! repl.it LeetCode 344. Reverse Bits 389. Find the Difference Jan 18 Proof By Induction Proof: Tiling Proof: A tree of n nodes has n-1 edges Ch 2 02induction.pptx LeetCode0 Jan 21 Present LeetCode 1 solutions Proof By Induction (Faulty) Proof: Right-handed people do not exist Proof: Candy Bars 03InductionPrograms.pptx LeetCode1

#### Revision 22018-12-19 - JimSkon

Line: 1 to 1

 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### James Skon
Line: 13 to 13

1. demonstrate a familiarity with major algorithms and data structures;
2. apply important algorithmic design paradigms and methods of analysis; and
3. synthesize efficient algorithms in common engineering design situations.
Changed:
<
<
Prerequisite: MATH 222 and SCMP 118 or PHYS 270 or equivalent.
>
>
Prerequisite: MATH 222 and SCMP 118 or PHYS 270 or equivalent, or permission of instructor

#### Course Information

 James Skon Office Hayes Hall 309c Office Hours: MTWHF 10:00-11:00 Phone: (740) 427-5369 Textbook: Introduction to Algorithms, 3rd Edition, MIT Press, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, ISBN 0262033844 Room and Time: Hayes 203, Time: 8:10-9:00, Days: MWF Paperless: This course is intentionally paperless. All assignments are turned in online through Moodle. The instructor will normally not accept work written or printed on paper. (Any exceptions must be pre-approved by the instructor).

 Class Attendance/Participation 10% Problem Sets 30%
Changed:
<
<
 LeetCode Assignments 20%
>
>
 LeetCode Assignments 20%

 Exams 20% Final Project/Presentation 20%

### Email help

Line: 45 to 45
Problem Set Presentations: Each team must prepare to make a presentation of each problem. The instructor will review these before class, and determine which team will present which problems. The students class participation grade will depend in part of the level of preparation for the solution presentation.

Presentations: Students should be prepared to present and discuss their solutions formally in class the day specifies in the schedule.

Changed:
<
<

>
>

### LeetCode Assignments

Due Date: As with problem sets, the assignments are due by 5:00pm the day before they will be presented in class, with wth same rules for lateness.
Line: 56 to 56
Presentations: Students should be prepared to present and discuss their solution formally in class the day specifies in the schedule. Be prepared to justify the solutions correctness as well as it computational analysis.

### Collaboration

Changed:
<
<
In order to facilitate learning, students are encouraged to discuss homework and LeetCode problems amongst themselves. Copying a solution is not, however, the same as “discussing.'' A good rule of thumb is the “cup of coffee'' rule. After discussing a problem, you should not take away any written record or notes of the discussion. Go have a cup of coffee or cocoa, and read the front page of the newspaper. If you can still re-create the problem solution afterward from memory, then you have learned something, and are not simply copying. (The “group problems” are exempt from this, as they are intended to be done together.)
>
>
In order to facilitate learning, students are encouraged to discuss homework and LeetCode problems amongst themselves. Copying a solution is not, however, the same as “discussing.'' A good rule of thumb is the “cup of coffee'' rule. After discussing a problem, you should not take away any written record or notes of the discussion. Go have a cup of coffee or cocoa, and read the front page of the newspaper. If you can still re-create the problem solution afterward from memory, then you have learned something, and are not simply copying. (The “group problems” are exempt from this, as they are intended to be done together.)

### Term Project

20% of your grade will consist of a semester long research project, collimating in a 30 minute presentation at the end of the class. This project can be one of the following two types:

Line: 86 to 86

 Jan 14 Introduction Joseph Flavius Course Details Ch 1 Josephus 01intro.pptx Jan 16 Programming Environment repl.it LeetCode Bring Laptop to class! repl.it LeetCode 344. Reverse Bits 389. Find the Difference Jan 18 Proof By Induction Proof: Tiling Proof: A tree of n nodes has n-1 edges Ch 2 02induction.pptx LeetCode0
Changed:
<
<
 Jan 21 Present LeetCode 1 solutions Proof By Induction (Faulty) Proof: Right-handed people do not exist Proof: Candy Bars 03InductionPrograms.pptx LeetCode1
>
>
 Jan 21 Present LeetCode 1 solutions Proof By Induction (Faulty) Proof: Right-handed people do not exist Proof: Candy Bars 03InductionPrograms.pptx LeetCode1

 Jan 23 Proof By Induction: Proving programs correct by induction AlgorithmProofs.pptx Jan 25 Graph Theory Ch 22 GraphTheory.pptx Jan 28 Graph Theory Proof Example Present LeetCode 2 solutions Ch 23 Course Project Instructions LeetCode2

#### Revision 12018-12-17 - JimSkon

Line: 1 to 1
>
>
 META TOPICPARENT name="WebHome"

### MATH 368 Design & Analysis Algorithms

##### Location: Hayes 203, Time: 9:10-10:00, Days: MWF

 "People who analyze algorithms have double happiness. First of all they experience the sheer beauty of elegant mathematical patterns that surround elegant computational procedures. Then they receive a practical payoff when their theories make it possible to get other jobs done more quickly and more economically.'' Donald E. Knuth

### Objectives

This course introduces students to the analysis and design of computer algorithms. Upon completion of this course, students will be able to do the following:

1. analyze the asymptotic performance of algorithms;
2. demonstrate a familiarity with major algorithms and data structures;
3. apply important algorithmic design paradigms and methods of analysis; and
4. synthesize efficient algorithms in common engineering design situations.
Prerequisite: MATH 222 and SCMP 118 or PHYS 270 or equivalent.

#### Course Information

 James Skon Office Hayes Hall 309c Office Hours: MTWHF 10:00-11:00 Phone: (740) 427-5369 Textbook: Introduction to Algorithms, 3rd Edition, MIT Press, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, ISBN 0262033844 Room and Time: Hayes 203, Time: 8:10-9:00, Days: MWF Paperless: This course is intentionally paperless. All assignments are turned in online through Moodle. The instructor will normally not accept work written or printed on paper. (Any exceptions must be pre-approved by the instructor).

 Class Attendance/Participation 10% Problem Sets 30% LeetCode Assignments 20% Exams 20% Final Project/Presentation 20%

### Email help

While students are encouraged to use office hours instead of email, the instructor will respond to short questions when appropriate. In order to ensure that they will be correctly handled by the instructor’s filter, the subject of all emails must start with “MATH 391:”; any email without this header runs the risk of being filtered.

### Lectures and Lecture Slides

Lecture slides will be available on this site by the day of the presentation. They are intended to help you reconstruct the work from class, but are not intended as a substitute for taking notes.

It is expected that you have read the assigned reading BEFORE class. We will be discussing the topic, and each student is expected to contribute to the conversations. Your participation grade will be partially dependent on your involvement in the discussions.

### Problem Sets

Due date: Unless otherwise stated, Problem Sets are due by 5:00pm the day before they will be presented in class. There will be a 12 hour grace period during which the student will received a penalty equal to 5% of the value of the assignment; any assignments submitted more than 12 hours late will not be accepted. Exception: Each student may have a 24 hour extension on one assignment without penalty. This extension will be applied to the first assignment submitted outside the grace period (or retroactively used to cancel one grace-period penalty if not used by the end of the semester.)

Submission Methods: Assignments must be typed and submitted through the Moodle website. The instructor will not accept submissions through email, Moodle submissions in any format other than pdf, or hard copies submitted directly to him.

Missing Assignments: Problem sets are an important part of this class; the effort spent on them is a crucial part of the learning process. Failure to submit assignments is unacceptable: students earning 0s on two assignments cannot receive a grade higher than a B- for the course; students earning three 0s will receive an automatic F for the course.

Problem Set Work Teams: Two person teams may be randomly assigned for some problem sets. The teams should work together, discussing the solutions. However, each team member is responsible to write up their own solution and turn is in. Thus while teams may share the same solution, they also may might be the same. Each assignment will include an estimation of the percentage of work done but each member (from the perspective of each person). For example: "Work distribution: Carmen: 55%, myself: 45%". The instructor will monitor this for patterns across multiple partners.

Problem Set Presentations: Each team must prepare to make a presentation of each problem. The instructor will review these before class, and determine which team will present which problems. The students class participation grade will depend in part of the level of preparation for the solution presentation.

Presentations: Students should be prepared to present and discuss their solutions formally in class the day specifies in the schedule.

### LeetCode Assignments

Due Date: As with problem sets, the assignments are due by 5:00pm the day before they will be presented in class, with wth same rules for lateness.

Submission Methods: Assignments ust be submitted online with source code, runs showing a variety of test cases that demonstrate all major aspects of the problem space, a writeup of the computational and space complexity as requested in the assignments.

Collaboration: Students should conform to the "group work" policy below.

Presentations: Students should be prepared to present and discuss their solution formally in class the day specifies in the schedule. Be prepared to justify the solutions correctness as well as it computational analysis.

### Collaboration

In order to facilitate learning, students are encouraged to discuss homework and LeetCode problems amongst themselves. Copying a solution is not, however, the same as “discussing.'' A good rule of thumb is the “cup of coffee'' rule. After discussing a problem, you should not take away any written record or notes of the discussion. Go have a cup of coffee or cocoa, and read the front page of the newspaper. If you can still re-create the problem solution afterward from memory, then you have learned something, and are not simply copying. (The “group problems” are exempt from this, as they are intended to be done together.)

### Term Project

20% of your grade will consist of a semester long research project, collimating in a 30 minute presentation at the end of the class. This project can be one of the following two types:

1. (Theory) A review, analysis, and presentation of a relatively recent algorithm of some notability (something from the past 5-10 years). This should include a comprehensive explanation of the algorithm operation and complexity (space and time), a comparison with other techniques, and a review of the proof of both the analysis and the correctness of the algorithm.
2. (Practice) The implementation, analysis, and testing of some significant algorithm technique or method not explored in this class. You find a problem from this class, or from work you have done or are doing elsewhere, and explore the use of one or more advanced algorithmic technique. This should also include an actual comparative runtime comparison with other techniques varying both the problem size, and the type, of the datasets.
The results of either will be presented during the finals period in a 30 minute time slot. The presentation will be evaluated by both the instructor, and the other students.

Two person teams can be considered for this project, but you must justify this option with clear evidence that it is significantly more work then a single person project. For example, you could explore and compare two distinct approaches, or do a combination of 1 & 2 above, or explore something that has significant complexity in and of itself.

### Plagiarism

All work turned in is expected to be your own. It is likely that proof, algorithm and code solutions for most problems exist online. Generally you should not search for any of these solutions. If you do use online or written documents, you must fully disclose and reference everything used, and be prepared to lose some credit if the help is deemed to be beyond that which you should used. The rule of thump is you can use references to help understand the problems and terminology, but should not use (and copy or modify) complete or partial solutions found online. Plagiarism detection methods may be used for detection of copying, and student will be subject to AIB notification in such cases.

Review the slides. It is you responsibility to be familiar with the following:
• Logarithms
• Graphs
• Proof notation
• Pseudocode
• Heaps
• Array v. Lists
review.basic_tools.pptx
Jan 14 Introduction
• Joseph Flavius
• Course Details
Ch 1 Josephus   01intro.pptx
Jan 16

Programming Environment

• repl.it
• LeetCode
Bring Laptop to class!

Jan 18 Proof By Induction
• Proof: Tiling
• Proof: A tree of n nodes has n-1 edges
Ch 2     02induction.pptx LeetCode0
Jan 21

Present LeetCode 1 solutions

Proof By Induction

• (Faulty) Proof: Right-handed people do not exist
• Proof: Candy Bars
03InductionPrograms.pptx LeetCode1
Jan 23 Proof By Induction:
• Proving programs correct by induction
AlgorithmProofs.pptx
Jan 25 Graph Theory Ch 22     GraphTheory.pptx
Jan 28 Graph Theory Proof Example Present LeetCode 2 solutions Ch 23 Course Project Instructions     LeetCode2
Jan 30 Present Problem Set 1 Solutions         Problem Set 1
Feb 1 Greedy Algorithms
• Disjkstra's Algorithm
dijkstra.pptx
Feb 4

Greedy Algorithms

• Classroom Scheduling
intervalScheduling.pptx
knapsack.pptx

Feb 6 Runtime Analysis
• Asymptotic notation
• Worst-case analysis
• Binary search
• Problem bounds
Present Problem Set 2 Solutions
Ch 3       Problem Set 2
Solutions
Feb 8 Runtime Analysis. Ch 3     asymptotic.pptx
Feb 11 Project Overview
Runtime Analysis

Feb 13 Greedy Algorithms
• Overview
• Huffman Codes
CH 16     greedyOverview.ppt
Feb 15 Huffman Codes
Heaps and Priority Queues
Ch 17       LeetCode3
Problem Set 3
Feb 18

Minimum Spanning Trees

• Prim’s Algorithm
• Kruskal’s Algorithm
• Union-Find Structure
Ch 22, 23     kruskal.pptx Presentation Topic Submit
Feb 20 More on Union-Find and MST
Midterm Questions
01UnionFind.pdf
Feb 22 Exam 1   Exam Study Guide
Feb 25

Divide and Conquer

• Sorting
Ch 4, 7 MidtermSolutions.pdf   DivideConquer.pptx
Feb 27 Analyzing Recurrence relations CH 4.5     recurences.pptx LeetCode4
Mar 1 Art Gallary?         Problem Set 4
Moodle
Spring Break
Mar 18 Analyzing Recurrence relations CH 4     recurences.pptx
Mar 20 Analyzing Recurrence relations CH 4 Master Theorem   recurences.pptx
Mar 22 Analyzing Recurrence relations CH 4
Mar 25

Divide and conquer

• Inversion Counting
• Minimum Distance
4 DivideAndConquerNotes.pdf InversionCounting.pptx closestpoint.pptx   Problem Set 5 Moodle
Mar 27 Linear Sorting 8   linearsorting.pptx LeetCode5
Mar 29

Dynamic Programming

• Introduction
15     dynamic-programming.ppt
Apr 1

Dynamic Programming

• Linear Sorting
15       LeetCode6
Apr 3

Dynamic Programming

• Rodcutting
15     rodcut.pptx
Apr 5

Dynamic Programming

• Weighted Interval Selection
weighted_interval_selection.pptx LeetCode7
Apr 8

Dynamic Programming

• Russian Doll Envelope
15 Russian Doll Envelope     Problem Set 6
Apr 10 Searching
• Hashing
11     HashingIntro.ppt LeetCode8
Apr 12

Searching

• Hashing Consideration
11     HashingConsiderations.ppt Presentation Outline
Apr 15
• Present Problem Set 6 Solutions
• Present LeetCode 8 solutions
Exam 2 Study Guide
Apr 17 Tree Structures 12&18 B-Tree Simulation
B+ Tree Simulation
Trees.pptx
Apr 19           Problem Set 7
Apr 22

Exam 2

LeetCode9
Apr 24 P and NP, nondeterminism, reductions 34     AlgorithmicIntractability.pptx
Apr 26 P and NP, nondeterminism, reductions 34 Reduction Video   AlgorithmicIntractability.pptx
Apr 29 Reductions
• Subset Sum
• Hamiltonian Path
SubsetSumProof.ppt
May 1 Reductions         Problem Set 8 Moodle
May 3 Reductions

Statement on Title XI

Kenyon College does not discriminate in its educational programs and activities on the basis of race, color, national origin, ancestry, sex, gender, gender identity, gender expression, sexual orientation, disability, age, religion, medical condition, veteran status, marital status, genetic information, or any other characteristic protected by institutional policy or state, local, or federal law. The requirement of non-discrimination in educational programs and activities extends to employment and admission.

All employees, including faculty, are considered Responsible Employees and must notify the College's Civil Rights & Title IX Coordinator with any relevant information.

For further information, please refer to the following Kenyon College policies:

Sexual Misconduct & Harassment: Title IX, VAWA, Title VII:

https://www.kenyon.edu/directories/offices-services/ocr/title-ix-vawa/kenyon-policies/title-ix-policy/

Discrimination & Discriminatory Harassment Policy (non sex or gender):

https://www.kenyon.edu/directories/offices-services/ocr/discrimination/