In addition to the COMP 2701 lab sessions, students can obtain help from the Computer Science Learning Center, especially on MW 12:00-1:00pm and MW 5:30-7:00pm, when Joe Burleson will be in the lab.

A Short Course in Discrete Mathematics and Mathematics for Algorithm and System Analysis, Edward A. Bender, S. Gill Williamson, ISBN 0-486-43946-1 and ISBN 0-486-44250-0. Also available on-line at http://www.math.ucsd.edu/~ebender/DiscreteText1/ and http://www.math.ucsd.edu/~ebender/DiscreteText2/.

MATH 2701 Discrete Structures (3 hours). Elementary logic; sets, relations, functions, orderings, equivalence relations, partitions: finite sets, modular arithmetic; natural numbers, mathematical induction, strings, string programs, connectedness, traversals, graph algorithms. NOTE: students may not receive credit for both MATH 2701 and MATH 2702. PREREQUISITE: MATH 1910, COREQUISITE: COMP 2701.

The goal of this course is to expose you to some basic mathematical concepts and structures commonly used in computer science.

Plus/minus grades will be used.

Grading scale to be determined.

Attendance Policy
No roll calls will be taken, however students are expected to attend every class. Any information missed due to an absence is the sole responsibility of the student.

Late Policy
All assignments are expected to be completed and submitted on schedule. Work is NOT accepted late unless prior arrangements are made with the instructor.

Testing Policy
All students should be present during exams. No makeup exams will be given except under exceptional circumstances.

Plagiarism, cheating, bad behavior in class
- will not be tolerated. See http://www.people.memphis.edu/~jaffairs/ for definitions of what counts as plagiarism, cheating, and bad behavior.