COMP 172-01, Discrete Structures for Computer Science, Fall 2007

Abstract

At end of this course you should be able to: • Use logical notation to define and reason about fundamental mathematical concepts such as sets, relations, functions, and integers. • Evaluate elementary mathematical arguments. • Synthesize induction hypotheses and simple induction proofs. • Calculate numbers of possible outcomes of elementary combinatorial processes such as permutations and combinations. • Analyze the running time of non-recursive algorithms with loops by means of counting. • Analyze the running time of divide and conquer recursive algorithms by means of recurrence equations. • Use trees and graphs to formulate computational problems.