UMBC CMSC 203, Section 0401 - Spring 2005
Discrete Structures
Instructor: Eric Eaton
Monday/Wednesday 5:30-6:45 pm, LH 3
This course introduces the fundamental tools, topics and concepts of
discrete mathematics needed to study computer science. This course
emphasizes counting methods, proof techniques and problem-solving
strategies. Topics include Boolean algebra; set theory; symbolic
logic; predicate calculus; number theory; the methods of direct,
indirect and inductive proofs; objective functions; equivalence
relations; graphs; set partitions; combinatorics; modular arithmetic;
summations; and recurrences. By the end of the course, students should
be able to formulate problems precisely, solve the problems, apply
formal proof techniques, and explain their reasoning.
News . . .
- 5/16: I've listed suggested sample problems for the final exam on the homework page. These are not for submission; they are only study aids.
- 5/4: Homework 10 has been posted. (Last homework! Yay!)
- 4/27: Homework 9 has been posted.
- 4/20: The final extra credit assignment is now online.
- 4/20: Homework 8 has been posted.
- 4/14: There will be a group review session this Friday from 3-4pm for exam 2. There will be a sign on my office door specifying the location. Please bring questions on exam 2 topics.
- 4/13: I've listed suggested sample problems for Exam 2 on the homework page. These are not for submission; these are only to help you study.
- 4/6: Homework 7 has been posted.
- 3/28: Homework 6 has been posted. I hope you enjoyed your spring break!
- 3/9: Homework 5 has been posted.
- 3/3: There will be a group review session this Friday (tomorrow) from 1-2pm. There will be a sign on my office door specifying the location, which I expect to be just down the hall. Please bring questions on exam 1 topics.
- 3/2: I've listed suggested sample problems on the homework page (not for submission; they're only to help you study) and exam resources on the course resources page. The "Sets, Logic, & Proofs Cheat Sheet" is an especially useful study guide.
- 2/28: The due date for homework 4 problems from section 2.4 has been extended to 3/9/2005. Homework 4 problems from sections 2.2 and 2.3 are still due 3/2/2005 as scheduled. Also, exam 1 is next Monday; it will cover sections 1.1-2.3, and any material outside the textbook covered in class. In order for you to be successful, please begin studying early and solve problems as practice. I will provide you with a list of suggested practice problems on Wednesday that will help you prepare for the exam.
- 2/23: Homework 4 has been posted.
- 2/16: This is a change to the lecture schedule. Today's lecture covered through section 1.8. Next Monday's lecture, listed as "Algorithms II", will cover 2.1-2.3.
- 2/16: Homework 3 has been posted.
- 2/9: Homework 2 has been posted. Note that LaTeX is still required for this assignment. Remember to put a statement at the top of your homework specifying your outside sources, EVEN if you didn't use any.
- 2/2: Grader office hours are TuTh 1-4pm.
-
01/31:
Welcome to CMSC 203-0401!
Course Info . . .