Course:
Course Number:    
Discrete Structures
14    
Description:
Review of propositional and predicate logic. Methods of theorem proving; strong and weak induction. Finite and infinite sets, set operations. Functions, including surjections, injections, bijections. Equivalence relations and partial orderings. Matrices and matrix operations. Combinatorics, including permutations and combinations. Graphs, including simple graphs, directed graphs, trees, Euler circuits, Hamilton circuits. Introductions to computational complexity, big-O notation, intractibility. Introduction to recurrence relations. (3 hours lecture, 1 hour laboratory.) Credit given for this course or New College NM3, or MATH 14.
Prerequisites:
Credits:    
CSC 15, MATH 11 or Three years of high school math
3    


Close