Set (mathematics)

Deterministic finite automaton (DFA)

Set theory

Proof by contradiction

Contraposition

Quantification (logic)

Logical connective

Predicate (mathematical logic)

Function (mathematics)

Constant (mathematics)

Quantifier (logic)

Binary relation

Reflexive relation

Symmetric relation

Transitive relation

Equivalence relation

Equivalence class

Domain of a function

Codomain

Injective function

Surjective function

Bijection

Function composition

Cardinality of the continuum

Cantor's diagonal argument

Graph theory

Mathematical induction

Strong induction

Formal language

Direct proof

Propositional calculus (Propositional logic)

CS 103A Math Problem-Solving Strategies Stanford University Winter 2020 CS 103A serves as an additional review course for CS103 students, focusing on strengthening proof-based mathematics skills and general problem-solving strategies in a context closely tied to CS103. Math, like programming, is a skill that takes practice to develop. In CS103A, we'll
provide extra review of the topics from CS103 and discuss general problem-solving
strategies that often come up in proof-based mathematics. We hope that the course
helps solidify the concepts from CS103 and provides you with a set of tools you can
use to confront challenging math problems with confidence.

If you're interested in taking CS103 but feel like you could use a little bit more practice
and review, this is the course for you!  CS103A has CS103 as a corequisite. This class is specifically designed as an add-on
course for CS103 and the material and presentation will be tailored to current CS103
students. As a result, you must be enrolled in CS103 to take CS103A. 

CS 103A Math Problem-Solving Strategies

Mathematical Foundations

Translation

Circuits

Equivalences

Boolean Algebra

Canonical Forms

Predicate Logic

Proofs for Propositional Logic

Proofs for Predicate Logic

English Proofs

Modular arithmetic

Primes

Greatest Common Divisor (GCD)

Euclidian Algorithm

Modular Equations

Modular Exponentiation

Induction

Strong Induction

Recursively Defined Functions

Recursively Defined Sets

Structural Induction

Relation (mathematics)

Nondeterministic Finite Automata (NFA)

More Structural Induction

Directed Graphs

Relating DFAs, NFAs, and REs

Regular expression

Finite State Machine (FSM)

Limitations of DFAs, NFAs, and REs

Context-Free Grammar (CFG)

FSM Minimization

CSE 311 Foundations of Computing I University of Washington Autumn 2021 CSE 311 introduces theoretical computer science, the theory background necessary for other CSE courses, and how to construct rigorous, formal arguments. Topics include logic, set theory, modular arithmetic, induction, regular expression, and relations.  1. Teach you the theory background needed for other CSE courses
    – only topics used in many areas of CSE
1. Teach you how to make and communicate rigorous and formal arguments
    – want to know for certain that systems work
1. Introduce you to theoretical CS
    – may be the only theory course you take  There is no required text for the course. For the first 6-7 weeks of the course, the following textbook can be useful: Rosen, Discrete Mathematics and Its Applications, McGraw-Hill. (Course materials will reference problem numbers from the 6th edition, but more recent versions include the same material.) It should be available through the bookstore and on short-term loan from the Engineering Library.

On occasion, there may be required readings during the course when there is insufficient time to fully cover the material during lecture. If this occurs, the readings will be posted on the web site and students will be notified of the reading via email or the message board.

CSE 311 Foundations of Computing I

Theoretical Computer Science

Set (mathematics)

2 courses cover this concept

CS 103A Math Problem-Solving Strategies

CSE 311 Foundations of Computing I