Roberts Hall 412

M, T, W, Th, F: 7:30 - 8:35

F: 8:45 - 9:50

Homework…………………..35%

Quizzes……………………...30%

Midterm………….…………..15%

Final………………………….20%

Extra Credit

Homework:

This class is “flipped” meaning that it is expected you will spend time outside of the classroom learning the material, and we will spend inside the classroom working on hands on problems and the homework. Homework will be graded in two parts, individual and group.
40% Group Homework - Time will be given for people to work on the problems individually, and then they may pair up to compare answers before submitting for grading.
60% Individual Homework - The last portion of class will be given to students to work on their homework individually. This is due at the beginning of the next class period.

Weekly Quiz:

This course covers a lot of material in a very condensed amount of time. In an effort to make sure people do not get left behind, there will be a quickly quiz over that week’s material. The quiz is broken down as follows:

30% - Every class period there will be one question from each lecture video. This question is taken directly from the video lectures. This is an attempt to reward watching the video. Points will be summed up over the week and added to the weekly quiz.

40% - New questions over material

30% - Questions collected from classmates (see extra credit)

Extra Credit:

There are two opportunities for extra credit:

Quiz questions - Submit 3 questions related to the topic that are interesting, relevant, appropriate application of the learning material for the week, I will add 1 point to your final for every week of class (up to 6 extra credit points on final). Due Friday morning before class every week.

Project - Create a program (in the language of your choice) that is in some way related to the material we’ve covered in class. There’s a lot of leeway with this project, and we will discuss it more as the course progresses.

WEEK | DAY | Reading | Content | Lectures | |
---|---|---|---|---|---|

Week 1 | Monday | Introduction | |||

Tuesday | 1.1 - 1.3 | existential vs. universal statements, sets, relations
Class 1 Slides |
Lesson 1 | Lesson 2 | |

Wednesday | 2.1 - 2.4 | propositional logic, compound statements, arguments, digital circuits
Class 2 Slides |
Lesson 3 | Lesson 4 | |

Thursday | 3.1 - 3.4 | predicate logic, quantifiers, limits, proofs
Class 3 Slides |
Lesson 5 | Lesson 6 | |

Friday | Class 4 Slides |
Lesson 7 | |||

Friday | QUIZ |
Github Source Tree |
|||

Week 2 | Monday | Memorial Day | |||

Tuesday | 4.1 - 4.4 | rational numbers, divisibility, prime numbers, quotient-remainder theorem | Lesson 8 | Lesson 9 | |

Wednesday | Class 5 Slides | Lesson 10 | |||

Thursday | 4.5-4.8 | unique factorization, irrational numbers, Euclid's algorithm
Class 6 Slides |
Lesson 11 | Lesson 12 | |

Friday | Class 7 Slides | Lesson 13 | |||

Friday | QUIZ |
pycharm
Visual Studio Python Plugin for VS |
|||

Week 3 | Monday | 11.1-11.2, 5.1-5.2 | asymptotic notation, sequences and series
Class 8 Slides |
Lesson 14 | Lesson 15 |

Tuesday |
Class 9 Slides |
Lesson 16 | |||

Wednesday | 5.6-5.8 | recurrence relations, proof by mathematical induction
Class 10 Slides |
Lesson 17 | ||

Thursday |
Class 11 Slides |
Lesson 18 | Lesson 19 | ||

Friday | 6.1 - 6.2 | set properties, functions
Class 12 Slides |
Lesson 20 | Lesson 21 | |

Friday | MIDTERM |
SSH Shell Download
Bootstrap |
|||

Week 4 | Monday | 7.1 - 7.3 | set partitions, function composition, properties of functions
Class 13 Slides |
Lesson 22 | Lesson 23 |

Tuesday | Class 14 Slides | Lesson 24 | |||

Wednesday | 8.1 - 8.3 | relations, equivalence relations, partitions, equivalence classes, partial orders
Class 15 Slides |
Lesson 25 | Lesson 26 | |

Thursday | Class 16 Slides | Lesson 27 | |||

Friday | 8.4 - 8.5 | RSA cryptography
Class 17 Slides |
Lesson 28 | Lesson 29 | |

Friday | QUIZ | ||||

Week 5 | Monday | 9.1 - 9.4 | probability, multiplication rule, addition rule, pigeonhole principle
Class 18 Slides |
Lesson 30 | Lesson 31 |

Tuesday | Lesson 32 | ||||

Wednesday | 9.5 - 9.7 | permutations and combinations, binomial theorem
Class 19 Slides |
Lesson 33 | ||

Thursday | Class 20 Slides | Lesson 34 | |||

Friday | Class 21 Slides | Lesson 35 | |||

Friday | QUIZ | ||||

Week 6 | Monday | Review | Review 1 Slides | ||

Tuesday | Review | Review 2 Slides | |||

Wednesday | FINAL | ||||

Thursday | |||||

Friday | 10.1 - 10.2 | graph terminology, complete and bipartite graphs,Eulerian and Hamiltonian circuits, travelling salesman problem | Lesson 36 | Lesson 37 | |

Friday |

Because this is a flipped classroom, having late assignments generally means you were not in class. Below is the penalties associated with missing class:

**1st class missed:**You can download that day's lecture slides to find both the quiz questions and the homework. The quiz will only count for for half the points and the homework will not have any late penalty.**2nd class missed:**Same as above, but now you will not receive any credit for the quiz portion**3rd or more classes missed:**Same as above, but now 2 points will be deducted for every class missed after 2.**Exceptions:**If you need to take a day off for a reasonable reason (determined by instructor), at least 24 hours notification is required, or proof of an emergency why you were not able to make it to class

**Asymptotic Notation: **

- Khan Academy Asymptotic Notation Series Description: A series of lessons covering Big-O, Big-Omega, and Big- Theta, and even a practice quiz. It does not use videos, rather is blog style.
- XOAX Algorithms Lesson 6: Big O, Big Omega, and Big Theta Notation Length: 6:47 Description: For this algorithms video lesson, we explain and demonstrate the main asymptotic bounds associated with measuring algorithm performance: big O, big omega, and big theta. in algorithm analysis, we are more with how an algorithm scales than the exact time of execution. This is sometimes referred to as complexity analysis.
- Big-O Cheat SheetConvenient Reference guide for Big - O

- Khan Academy Proof by Induction Length: 9:22 Description: Proving an expression for the sum of all positive integers up to and including n by induction

- Recurrence relations made easy (including Fibonacci sequence) Length: 13:04 Description: 3 typical exam questions that cover all you need to know. Includes the nth number in the Fibonacci sequence.