Time and Place: TR 3:30 pm-4:45 pm Whitehall Classroom Bldg Whitehall Classroom Bldg-Rm.238-CB
Professor:
Dr. J. Goldsmith
Office: 763E Anderson Hall
Office Hours: Mondays 4--5 PM, Tuesdays 1--2 PM,
and by appointment. Email questions encouraged and answered.
T.A.: To be announced.
Course Description:
Topics in discrete math aimed at applications in Computer Science.
Fundamental principles: set theory, induction, relations, functions,
Boolean algebra. Techniques of counting: permutations, combinations,
recurrences, algorithms to generate them. Introduction to graphs and
trees.
Prereqs:
MA-113 and CS-115
Textbook: K. Rosen, Discrete Mathematics and its Applications, Sixth Edition, McGraw Hill, 2006.
Grading:
There will be weekly homeworks due Thursday at the beginning of class except those weeks when there is an exam; assignments will be posted the previous Thursday on the web. The lowest homework grade will be dropped. Illegible work will not be graded. There will be two "mid"term exams and one final.
Homework will be 50% of your grade; the midterms will be 15% and the final 20%.
READ THIS:
Attendance in class and section is very strongly encouraged.
Copying of homework from other students or from other sources is strictly prohibited. Obtaining a solution from another source without citing the source is plagiarism. First time plagiarists receive a letter in their file and a 0 (which will not be dropped!) on the homework. Subsequent incidents---in this or other classes---will receive harsher penalties, ranging from an unreplaceable failing grade in the course to expulsion from UK. We strongly discourage you from searching for solutions on the web, but if you use such sources, DOCUMENT AND CITE THEM!!!!
You are encouraged to visit Dr. Goldsmith or your T.A. in their office hours or to send them email if you are stuck on homework problems. You do not need an appointment for regularly scheduled hours.
Week by Week Course Outline:
| Date | Topic | Chapter | Assignment |
|---|---|---|---|
| Aug. 26, 28 | Set theory | 2.1, 2.2 | HW 1 |
| Sep. 2, 4 | Functions and relations | 2.3, 5.1, 5., 5.5-6, 6.13 | HW 2 |
| Sep. 9, 11 | Mathematical proofs | 1 | HW 3 |
| Sep. 16, 18 | Mathematical induction and recursive definitions | 4 | HW 4 Practice Exam Solutions |
| Sep. 23 | REVIEW | ||
| Sep. 25 | MIDTERM | ||
| Sep. 30, Oct. 2 | Counting: unions and products, pigeon-hole principle | 5 | HW 5 |
| Oct. 7 | Permutations | ??? | |
| Oct. 9 | Jewish High Holy Day: no class | ||
| Oct. 14, 16 | Permutations, combinations, and seating charts | 4.3 | HW 6 |
| Oct. 21, 23 | Intro probability | 6 | HW 7 |
| Oct, 28, 30 | Inclusion/exclusion principle | 7.4--7.6 | HW 8 |
| Nov. 4 | ELECTION DAY! | NO CLASSES! | GO VOTE! |
| Nov. 5 | REVIEW | IN SECTION! | |
| Nov. 6 | MIDTERM | ||
| Nov. 11, 13 | Recurrences | 7 | HW 9 |
| Nov. 18, 20 | Graphs | 8 | HW 10 |
| Nov. 25 | Partial orders | ||
| Nov. 27 | Thanksgiving | ||
| Dec. 2, 4 | Graphs: planarity; cycles, colorings, matchings | 9 | HW 11 |
| Dec. 9, 11 | Trees: definitions, counting, spanning trees | 9.6--9.8 | HW 12 |
| Dec. 19 | FINAL: 3:30 PM on Friday, 12/19 |
|
webmaster@cs.engr.uky.edu
| This page last modified: Sunday, July 27, 2008 |