COT 3100 -- Applied Discrete Structures
Computer & Information Sciences & Engineering Department
University of Florida, Spring 1999
http://www.cise.ufl.edu/~mssz/DiscreteMath/Top-Level.html jjeffers@cise.ufl.edu, Office: CSE/E432, Phone: 392-xxxx
yf0@cise.ufl.edu, Office: CSE/E426, Phone: 392-6860
juin@cise.ufl.edu, Office: CSE/E426, Phone: 392-6860
as1@cise.ufl.edu, Office: CSE/E426, Phone: 392-6860
jzhao@cise.ufl.edu, Office: CSE/E432, Phone: 392-xxxx
DESCRIPTION: COT3100 covers the mathematics of discrete
events, i.e., events that involve distinct
elements, finite structures of distinct
elements, or discretely sampled versions of
continuous phenomena such as movement.
TEXTBOOKS:
OTHER REQUIREMENTS: You must have an E-mail account and access to the Internet and World-Wide Web. You may obtain this without additional charge at CIRCA (5th floor CSE building, during normal business hours - 8am to 5pm).
EVALUATION: Homework and Quizzes (30%) + Midterm Exams (50%) + Final Exam (20%)
QUIZZES will be given in class and are closed book and closed notes format. However, ONE 8.5'' X 11'' double-sided page of paper containing your ORIGINAL notes may be allowed (TBD). The quizzes will be short (approximately 10 minutes in length) and will be announced at least one week in advance. Absolutely No Make-Up Quizzes will be Given For Any Reason. The quizzes are equally weighted EXCEPT for the first quiz, which has half the weight of subsequent quizzes.
HOMEWORKS are assignments done outside of class. Group study is encouraged, but these are INDIVIDUAL projects. Any copying will be considered cheating. Please understand that there is a not-so-subtle difference between discussing your homework with a colleague or friend and copying it wholly or in part.
HOMEWORK DUE AT THE BEGINNING OF CLASS. LATE HOMEWORKS ARE PENALIZED BY 10% FOR EACH CALENDAR DAY LATE. HOMEWORKS MORE THAN 2 CALENDAR DAYS LATE WILL NOT BE ACCEPTED!
Homework extensions may be allowed only for documented, unavoidable conflicts REPORTED IN ADVANCE AND ALLOWED BY THE INSTRUCTOR. Only DOCUMENTED emergency medical excuses can be accepted after a project is due.
The homeworks will all be equally weighted, EXCEPT that the first homework has half the weight of subsequent assignments.
EXAMS: All exams are closed-book, closed-notes. No cheating of any kind will be tolerated. There will be two midterm exams and one final exam. The final exam code for this class is 26E.
RETURN POLICY: Every attempt will be made to return homework and exams as soon as possible. When they are graded and recorded, they will be turned back during class. Grades will be reported on the Internet only in terms of a confidential code that you provide to the instructor. To comply with the Buckley Act, no Social Security Number will be used.
COVERAGE:
1. Logic, Algorithms, and Complexity CH. 1-2 2. Proofs, Integers, and Counting Techniques CH. 3-5 3. Relations, Graphs, and Trees CH. 6-8 4. Boolean Algebra and Applications CH. 9 5. Theory of Computation CH. 10
GRADING: Standard with NO CURVING OF ANY SCORES, as follows:
90 - 100 : A 85 - 89 : B+ 80 - 84 : B 75 - 79 : C+ 70 - 74 : C 65 - 69 : D+ 60 - 64 : D 0 - 59 : E
DISHONESTY: Under no circumstances will acts of academic dishonesty be tolerated. You will be individually responsible for knowledge of all material in the course, including any topics, ideas, methods or skills acquired through group or team activities. Any suspected incidents of dishonesty will be promptly referred to the Director for Student Judicial Affairs and the Student Honor Court. Refer to the pamphlet entitled Academic Honesty, Student Judicial Process, Guide for Students, from the Office for Student Services (392-1261)