Discrete Mathematics
605.203

Course Description
This course emphasizes the relationships between certain mathematical structures and various topics in computer science. Topics include set theory, graphs and trees, algorithms, propositional calculus, logic and induction, functions, relational algebra, and matrix algebra.
NOTE: A mathematics course beyond one year of calculus is needed for admission to the graduate computer science program. Students who lack this prerequisite can fulfill admission requirements by completing this course with a grade of A or B. This course DOES NOT count toward the Master of Science in Computer Science degree.

Syllabus

1. Sets
2. Functions
3. Propositional Calculus
4. Induction
5. Induction and Matrices
6. Relations
7. Relations & Graphs
8. Graphs
9. No Class (8/3)
10. No Class (8/10)
11. Trees
12. Final Exam

Prerequisites
Differential and integral calculus.

Instructor
Eleanor Chlan has a M.S. in computer science from the Johns Hopkins University Whiting School of Engineering, a B.S. in computational mathematics from Rochester Institute of Technology. She is currently a PhD student at UMBC studying computer graphics and visualization with Dr. David Ebert. In addition to teaching, Mrs. Chlan is the Special Student advisor for the computer science and information systems & technology programs. Prior to working for the University, Mrs. Chlan was a staff mathematician at the Applied Physics Laboratory.

Textbook
Discrete Mathematics, 4th ed., by Ross & Wrigh, Prentice Hall.

Return to Computer Science Courses | Computer Science  | Part-Time Engineering

Summer 2000-01