Course Information: (Spring 2008)
 
Section(s): Section A: MWF 10:00 - 10:50 GC-263

Instructor:
Terry Bridgman
Office: Chauvenet Hall 279
Phone: (303) 384-2447
email: tbridgma@mines.edu
Office Hours: Tues 1:00 - 3:00, or by appointment

Course Description: An introductory course in discrete mathematics and algebraic structures. Topics include: formal logic; proofs, recursion, analysis of algorithms; sets and combinatorics; relations, functions, and matrices; Boolean algebra and computer logic; trees, graphs, finite-state machines, and regular languages. Prerequisite: MATH 213 or MATH 223/224

Text: Mathematical Structures for Computer Science, 6th ed.,
- Judith L. Gersting
Topics:
Formal Logic Ch 1: 1-4
Proofs, Recursion, and Analysis of Algorithms Ch 2: 1-2, 4-5
Sets, Combinatorics and Probability Ch 3: 1-4,6-7
Relations, Functions, and Matrices Ch 4: 1,4
Graphs and Trees Ch 5: 1
Graphs Algorithms Ch 6: 2

Grading:
20% Discretionary
50% Tests - 2 in-class tests
30% Final Exam - comprehensive
A: 90% - 100%
B: 80% - 89%
C: 70% - 79%
D: 60% - 69%
F: < 60%