Last Modified: 01/13/12
|Prof. Ron Graham|
|Lecture||Mon/Wed||5:00pm - 6:20pm||CENTER 109|
|Discussion (optional)||Wed||3:00pm - 3:50pm||CENTER 109|
|Final Exam||3/19/12||7:00pm-9:59pm||CENTER 109|
We are using Piazza. To join the forum, click here.
If you ever wondered "What sort of mathematics do I need for computer science?", this course will provide some of the answers. In particular, you will have the opportunity to learn basic concepts about counting, permutations and combinations, decision trees, recurrences, discete probability and graph theory, among other things. These are some of the essential ingredients in the toolkit of every computer scientist.
You are welcome to browse around on this website. There is a lot of useful material on-line. In particular, all homework, homework solutions, and the midterm exams will be posted here, as will important announcements.
Please click here for a detailed course description as given in the undergraduate course listing.
There will be one midterm exam which is worth 30% of the grade, and a final exam will be worth 70% of the grade. Homework will be assigned each week (usually on Wednesday) but will not be collected or graded. Solutions will be posted a week after the homework is assigned. It is essential that you do the homework since this is the only way that you can gain mastery of the techniques we will study (and because the tests will be based in large part on the homework!).
From time to time I will post Extra Credit problems. These will typically be more difficult than the usual p/oblems, but solving them (or even working on them) could definitely impress the instructor! Extra credit is posted here.
The Jacobs School of Engineering code of Academic Integrity is here. You should read it!
The most recent announcements will posted first. It is a good idea to check these from time to time to be aware of changes in schedule, etc.
- Please join class discussion group which is hosted on Piazza. If you haven't received the email to join Piazza, use this link: http://www.piazza.com/ucsd/winter2012/cse21
The textbook material for this course is Lectures In Discrete Mathematics: Second Course. The material can be found at the following links:
You may want to print out this material for easy reference. A paperback version on this material is available from Amazon for $6.50 (used). While we won't cover all of this material in the lectures, you should read it in any case. There are a number of other sources on the Web that cover this material. For example, you can look at: http://www.macalester.edu/~hutchinson/book/book.html or http://www.cse.iitd.ernet.in/~bagchi/courses/discrete-book/fullbook.pdf.
NOTE: Subject to changes if unavoidable circumstances arise.
|1/09/12||Mon||Basic Counting and Listing - CL Section 1|
|1/11/12||Wed||Basic Counting and Listing - CL Section 2|
|1/16/12||Mon||No Class||Martin Luther King Day|
|1/18/12||Wed||Basic Counting and Listing - CL Sections 2-3|
|1/23/12||Mon||Basic Counting and Listing - CL Section 3|
|1/25/12||Wed||Basic Counting and Listing - CL Sections 3-4|
|1/30/12||Mon||Basic Counting and Listing - CL Section 4|
|2/06/12||Mon||Functions - Cont'd|
|2/08/12||Wed||Functions - Cont'd|
|2/20/12||Mon||No Class||President's Day|
|2/22/12||Wed||Decision Trees - Cont'd|
|2/27/12||Mon||Decision Trees - Cont'd|
|3/05/12||Mon||Recurrences - Cont'd|
|3/12/12||Mon||Graph Theory - Cont'd|
|3/14/12||Wed||Graph Theory Cont'd||Last Class|