Winter 2020

Stanford University

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.

No data.

No data

Sldies available at Handouts

No videos available

Class problems and solutions available at Class problems

No other materials available

BijectionBinary relationCantor's diagonal argumentCardinality of the continuumCodomainConstant (mathematics)ContrapositionDeterministic finite automaton (DFA)Direct proofDomain of a functionEquivalence classEquivalence relationFormal languageFunction (mathematics)Function compositionGraph theoryInjective functionLogical connectiveMathematical inductionPredicate (mathematical logic)Proof by contradictionPropositional calculus (Propositional logic)Quantification (logic)Quantifier (logic)Reflexive relationSet (mathematics)Set theoryStrong inductionSurjective functionSymmetric relationTransitive relation