Three hours of lecture and 80 minutes of lab each week. 4 credit(s) This course includes a study of mathematical structures most frequently encountered in Computer Science. Topics covered include sets, functions, mathematical induction, complexity analysis of algorithms, counting methods including probability, recurrence relations, graphs, trees, Boolean logic, and relations. Proofs using mathematical induction will be emphasized. Other proof techniques will be developed. Lab fee. Offered in Fall Semester.