I201/C251 - Learning Goals
- Below is a list of Units and Topics from the "IEEE/ACM Computing
Curricula 2001"
- Each Topic is prefixed with a Marker designating to what extent each topic
will be covered in INFO I201/CSCI C251.
- The Markers are:
- (M) - Mastery
means the student will be able to exhibit knowledge of the material
and/or skill with the procedure, in a new but appropriate context, even
when not instructed to do so.
- (F) - Familiarity
means the student will be able to answer questions about the material
and/or to use the procedure, in a new but appropriate context, when
instructed to do so.
- (E) - Exposure
means the student will have heard the term and/or seen the procedure,
but may not be able to discuss or use it effectively without further
instruction.
- Each
of these Topics along with its Marker specifies the learning goals for INFO
I201/CSCI C251.
- DS1. Functions, relations, and sets [core]
- (F) Functions (surjections, injections, inverses, composition)
- (F) Relations (reflexivity, symmetry, transitivity, equivalence relations)
- (M) Sets (Venn diagrams, complements, Cartesian products, power sets)
- (F) Cardinality and countability
- DS2. Basic logic [core]
- (F) Propositional logic
- (M) Logical connectives
- (M) Truth tables
- (F) Predicate logic
- (F) Universal and existential quantification
- (E) Modus ponens and modus tollens
- DS3. Proof techniques [core]
- (F) Notions of implication, converse, inverse, contrapositive, negation, and contradiction
- (F) The structure of formal proofs
- (E) Direct proofs
- (E) Proof by counterexample, contraposition, contradiction
- (E) Mathematical induction
- DS4. Basics of counting [core]
- (M) Counting arguments
- Sum and product rule
- Inclusion-exclusion principle
- Arithmetic and geometric progressions
- (F) The pigeonhole principle
- (F) Permutations and combinations
- DS5. Graphs and trees [core]
- (F) Trees
- (F) Undirected graphs
- (F) Directed graphs
- (F) Spanning trees
- (F) Traversal strategies
- AL5. Basic computability [core]
- (E) Finite-state machines
- (E) Context-free grammars
- (E) The halting problem
Last Updated:
08/12/2009