CMSC250-Discrete Structures (Spring 2010)


This course will cover fundamental mathematical concepts related to computer science, including: Finite and infinite sets, relations, functions, and propositional logic. Introduction to other techniques, modeling and solving problems in computer science. Introduction to permutations, combinations, graphs, and trees with selected applications.
For further information, please see the Syllabus.

Instructor: Yiannis Aloimonos, 4475 A.V.Williams,
Office hours:
Mon 11-12
Tue: 12:30-1:30
wed: 1-2
Textbook: Discrete Mathematics with Applications, by Susanna S. Epp

TA Office hours in AVW 1112

Mon 1-3pm Angela
Tue 3-5m Ran
Thu 12:30-2:30pm Angela
Fri 10-12pm Ran

Course weights: Coursework will count toward the final grade according to the following percentages
  • Homework: assigned weekly 15% (equally weighted)
  • Quizzes: weekly in discussion section 15% (equally weighted)
  • Midterms: three midterms 40% (equally weighted)
  • Final: will be comprehensive 30%

Exams: Exams will be held during lecture. Anticipated exam dates
  • Exam #1: Monday, March 8
  • Exam #2: Wednesday, April 14
  • Exam #3: Monday, May 3
  • Final: TBA

Lecture Notes

Supplementary Materials


Web Accessibility