Math 2701002  Discrete Structures  Fall 2007 
Class:  Dunn Hall 119, TR 11:2012:45  
Instructor:  Paul Balister  
Email:  pbalistr@memphis.edu  
Website:  http://www.msci.memphis.edu/~pbalistr/2701.html  
Office:  Dunn Hall 345, Tel: 6783138  
Office Hours:  Tuesdays 2:303:30 (or by appointment)  
Tutoring:  In addition to the COMP 2701 lab sessions, students can obtain help from the Computer Science Learning Center, especially on MW 12:001:00pm and MW 5:307:00pm, when Joe Burleson will be in the lab.  
Textbooks:  A Short Course in Discrete Mathematics and Mathematics for Algorithm and System Analysis, Edward A. Bender, S. Gill Williamson, ISBN 0486439461 and ISBN 0486442500. Also available online at http://www.math.ucsd.edu/~ebender/DiscreteText1/ and http://www.math.ucsd.edu/~ebender/DiscreteText2/. 

Description:  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. 

Goals:  The goal of this course is to expose you to some basic mathematical concepts and structures commonly used in computer science.  
Grading: 
Plus/minus grades will be used. Grading scale to be determined.  
Course Policies: 
Attendance Policy Late Policy Testing Policy Plagiarism, cheating, bad behavior in class  
Exam Dates: 

Homework 1  Due Tuesday, September 25.  
Homework 2  Due Tuesday, October 9.  
Test Example Questions 