UMBC CMSC 203
UMBC CMSC 203 * CSEE

CMSC 203, Section 0401, Fall 2004
Discrete Structures

Syllabus

Course Website: http://www.cs.umbc.edu/~mgasto1/203

Instructor

Instructor: Matt Gaston
Office: ITE 339
Office Hours: TuTh, 10:30-11:30am, and by appointment.

Grader: Deepak Bote
Office: ITE 344
Office Hours: Wednesdays, 4:00-5:00pm


Class Time and Location

Section 0401 meets in Social Sciences 113 from 1:00pm - 2:15pm Tuesday and Thursday


Course Description

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.


Textbook

Required: Kenneth H. Rosen. Discrete Mathematics and its Applications. Fifth Edition. McGraw-Hill, 2003. ISBN: 00-07-293033-0.

The textbook has a website with additional and helpful information.


Requisites


Course Outline

The structure of the course will follow the structure of the text. We will cover roughly one chapter per week, with room built into the schedule for flexibility paced on the progress and expertise of the class. One goal is to provide at least an introduction to special topics in discrete mathematics near the end of the semester. These topics include graphs, relations, trees, and formal languages.

See the course schedule for details.


Course Mailing List

A course mailing list has been established for distributing news and discussing course-related topics. Students should feel free to post general problems, questions, and answers to the list for the benefit of the entire class. At no time should students post problem set solutions or solutions to exam questions to the course mailing list. This will be the sole responsibility of the course staff.

To subscribe, compose an email in plain text (not HTML) to listproc@listproc.umbc.edu with a blank subject and the following message replacing Your Name with your actual name. Also be sure NOT to put any spaces in the list name:

sub cmsc203-0401 Your Name

Although not required, it is highly recommended that you subscribe to the course mailing list. If you do not subscribe to the list, there is no guarantee that you will receive up-to-date information about the course.

To post to the course mailing list, send email to cmsc203-0401@listproc.umbc.edu


Grading

Your final grade will be composed of :

Your final grade will be determined according to the general criteria:

90% <= A <= 100%
80% <= B < 90%
70% <= C < 80%
60% <= D < 70%
0% <= F < 60%


Problem Sets

There will be ten (10) problem sets assigned over the course of the semester. Each problem will be assigned at least one week in advance of its due date. Problem set solutions will be turned in at the start of class on the designated due date. No late submissions will be accepted.

All problem set solutions are required to be typeset with proper mathematical notation. I highly recommend the use of the LaTeX text formatting system. If you choose another text processing system, you are responsible for ensuring the mathematical notation in your turned in solutions is accurate and correct. Borrowing from previous instructors, I've set up a LaTeX resource page with links to good LaTeX websites and links to example files. There are also several excellent texts and references available at almost any book store.

All solutions are required to be your own, individual work. You may, and are encouraged, to discuss methods, concepts, and assignments with anyone; however, the solutions turned in must be your own work. A good rule of thumb is to be alone when you sit down to actually generate solutions to the assigned problem sets. If you receive any help in producing problem set solutions, the source of the help must be documented in your submission (to include help from websites).


Lectures and Readings

You are expected to attend all classes. You are responsible for all material covered in the lecture, even if they are not in the textbook. You are responsible for the material in the readings, even if they are not covered during lecture. If you miss a class, you are responsible for getting the notes and any verbal information given during class from a fellow classmate. (If handouts were given out, you may come to my office to get them.)


Exams

The exams will be closed-book and closed-notes. Test dates for the first two exams and final exam will be announced well in advance. In the case of verifiable medical excuses or other such dire circumstances, arrangements must be made with the instructor for a makeup exam. You are responsible for initiating these arrangements, not your instructor, preferably before the exam.


UMBC Statement of Values for Academic Integrity

By enrolling in this course, each student assumes the responsibilities of an active participant in UMBC's scholarly community in which everyone's academic work and behavior are held to the highest standards of honesty. Cheating, fabrication, plagiarism, and helping others to commit these acts are all forms of academic dishonesty, and they are wrong. Academic misconduct could result in disciplinary action that may include, but is not limited to, suspension or dismissal. To read the full Student Academic Conduct Policy, consult the UMBC Student Handbook, or the UMBC Policies section of the UMBC Directory. [Statement adopted by UMBC's Undergraduate Council and Provost's Office.]

For additional details on university policies on academic integrity, see the Faculty Handbook, Section 14.2 -- POLICY ON FACULTY, STUDENT, AND INSTITUITIONAL RIGHTS AND RESPONSIBILITIES FOR ACADEMIC INTEGRITY

Any violation of the UMBC academic honesty policy will carry a minimum penalty of a zero (0) grade on the grade component in question and a full letter grade reduction of the final grade.


Last Modified: Friday, 01-Apr-2005 03:35:18 PM EST