"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 
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:

Class Attendance/Participation  10% 
Problem Sets  30% 
LeetCode Assignments  20% 
Exams  20% 
Final Project/Presentation  20% 
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.
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.
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 graceperiod 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.
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.
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 recreate 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.)
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:
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.
Possible Sources: link
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.
Date  Lecture Content  Reading  Notes/Links  Slides  Assignment Due 

Review the slides. It is you responsibility to be familiar with the following:

Review Slides  
Jan 14  Introduction

Ch 1  Josephus Information Form 
Introduction  
Jan 16  Programming Environment

Bring Laptop to class! 

Jan 18  Proof By Induction

Ch 2  Induction  LeetCode0  
Jan 21  Proof By Induction

Ch 2  Proofs of Algorithms  
Jan 23  Present LeetCode1 solutions

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  
Jan 30  Present Problem Set 1 Solutions  Problem Set 1, tex Moodle 

Feb 1  Greedy Algorithms

dijkstra.pptx  
Feb 4  Greedy Algorithms

intervalScheduling.pptx knapsack.pptx 
LeetCode2  
Feb 6  Runtime Analysis

Ch 3  Problem Set 2 Solutions 

Feb 8  Runtime Analysis.  Ch 3  asymptotic.pptx  
Feb 11  Project Overview Runtime Analysis 

Feb 13  Greedy Algorithms

CH 16  greedyOverview.ppt  
Feb 15  Huffman Codes Heaps and Priority Queues 
Ch 17  LeetCode3 Problem Set 3 

Feb 18  Minimum Spanning Trees

Ch 22, 23  kruskal.pptx  Presentation Topic Submit  
Feb 20  More on UnionFind and MST Midterm Questions 
01UnionFind.pdf  
Feb 22  Exam 1  Exam Study Guide  
Feb 25  Divide and Conquer

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

4  DivideAndConquerNotes.pdf  InversionCounting.pptx closestpoint.pptx  Problem Set 5 Moodle 
Mar 27  Linear Sorting  8  linearsorting.pptx  LeetCode5  
Mar 29  Dynamic Programming

15  dynamicprogramming.ppt  
Apr 1  Dynamic Programming

15  LeetCode6  
Apr 3  Dynamic Programming

15  rodcut.pptx  
Apr 5  Dynamic Programming

weighted_interval_selection.pptx  LeetCode7  
Apr 8  Dynamic Programming

15  Russian Doll Envelope  Problem Set 6  
Apr 10  Searching

11  HashingIntro.ppt  LeetCode8  
Apr 12  Searching

11  HashingConsiderations.ppt  Presentation Outline  
Apr 15 

Exam 2 Study Guide  
Apr 17  Tree Structures  12&18  BTree 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

SubsetSumProof.ppt  
May 1  Reductions  Problem Set 8 Moodle  
May 3  Reductions  
May 9  Final Presentations 8:30  Presentation Time Sign Up  Moodle link to turn in presentation 
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 nondiscrimination 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:
Discrimination & Discriminatory Harassment Policy (non sex or gender):
https://www.kenyon.edu/directories/officesservices/ocr/discrimination/
ADA & Section 504:
https://www.kenyon.edu/directories/officesservices/ocr/discrimination/504adagrievance/studentgrievanceprocedureresolvingcomplaintsunderadasection504/