INFO 150, Fall 2019

Syllabus and Course Schedule

Prof. Peter J. Haas

Course Goals:

The primary goal is to teach students to think mathematically and, importantly, to communicate their thinking to others using mathematical language. The emphasis is on the type of computational thinking needed to build and analyze systems for solving problems in real-world domains.

Course Objectives:

Students will be able to

Class Schedule and Readings

Reading assignments are from Ensley and Crawley: Discrete Mathematics: Mathematial Reasoning and Proof with Puzzles, Patterns, and Games

Class meetings are MW 2:30-3:45 in CS 140. There are two midterm evening exams, as indicated.

The following class schedule is approximate and subject to revision:

Week 1Course Overview; First Examples; Number Puzzles and SequencesSecs 1.1 and 1.2 
Week 2Truth-tellers, Liars, and Propositional Logic; PredicatesSecs 1.3 and 1.4 
Week 3Translating Predicates and Quantifiers; ImplicationsSecs 1.4 and 1.5 + Notes 
Week 4Brute-Force Search; Mathematical Writing; Proofs About NumbersSecs 2.1 and 2.2 + Notes 
week 5More Proofs About Numbers; Mathematical InductionSecs 2.2 and 2.3 
Week 6More Induction: Sums and Correctness ProofsSecs 2.3 and 2.4 + Notes 
Week 7Sets: Definitions, Operations, Properties; FunctionsSecs 3.1-3.3 and 4.1-4.2Midterm 1
Week 8More Functions; Relations; Intro to CombinatoricsSecs 4.3-4.5 and 5.1 
Week 9More Combinatorics: Counting and Binomial TheoremSecs 5.2-5.4 
Week 10Security of Passwords; ProbabilitySecs 6.1-6.2 + NotesMidterm 2
Week 11More probability: Games and SimulationSecs 6.3-6.5 
Week 12No Class This Week (Thanksgiving)  
Week 13Matrices and GraphsSecs 6.6 and 7.4 + Appendix B 
Week 14More on Graphs: Trees, Counting and ProofsSecs 7.1, 7.2, 7.4 
Week 15Graphs in Puzzles and Games; Course ReviewSec 7.5 
Week 16  Final Exam

Last modified 7 December 2018