CSE 21

Mathematics for Algorithm and Systems Analysis

Last Modified: 01/13/12

Instructor

Prof. Ron Graham
Email: graham@ucsd.edu
Office: EBU3b 2138
Office Hours
When: M 2-3
Where: CSE 2138

Teaching Assistants

Fjola Bjornsdottir
Email: fbjornsd@cs.ucsd.edu
Office: EBU3b 4254
Office Hours
When: M10-11am
W1:30-2:30pm
Where: B240A
Mohammad Moghimi
Email: mohammaducsd.edu
Office: EBU3b 2140
Office Hours
When: Th 12:30-1:30pm
F 2-3pm
Where: B260A

Tutors

Monica Gonsalves
Email: mgonsalves@ucsd.edu
Tutor Hours
When: T 4:00p-5:00p
F 4:00p-5:00p
Where: B240A
Chris Laguna
Email: cplaguna@ucsd.edu
Tutor Hours
When: M 1:30p-4:00p
Th 1:30-3:00p
Where: B260A

Class Meetings

DateTimeLocation
Lecture Mon/Wed5:00pm - 6:20pmCENTER 109
Discussion (optional) Wed3:00pm - 3:50pmCENTER 109
Final Exam 3/19/127:00pm-9:59pmCENTER 109

Forum

We are using Piazza. To join the forum, click here.

Welcome Message

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.

Course Description:

Please click here for a detailed course description as given in the undergraduate course listing.



Grading:

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!).



Extra Credit:

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.



Academic Integrity:

The Jacobs School of Engineering code of Academic Integrity is here. You should read it!

Announcements

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.


The Final Exam will be given on Monday, March 19, from 7:00 p.m.to 10:00 p.m. in our usual room Center 109. It will cover everything we have had in the course and in the homework. It will be CLOSED BOOK but you can bring to class two hand-written sheets of notes. You can also bring a calculator if you wish, but it shouldn't be needed since expressions can be left in unexpanded form, such as n! and S(n,k).

Note: My new office hours are Monday from 2 to 3.

- 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

Top

Textbook

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.

Top

Schedule

NOTE: Subject to changes if unavoidable circumstances arise.

DateDaySubjectNotes
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/01/12 Wed Functions
2/06/12 Mon Functions - Cont'd
2/08/12 Wed Functions - Cont'd
2/13/12 Mon Decision Trees
2/15/12 Wed Midterm
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
2/29/12 Wed Recurrences
3/05/12 Mon Recurrences - Cont'd
3/07/12 Wed Graph Theory
3/12/12 Mon Graph Theory - Cont'd
3/14/12 Wed Graph Theory Cont'd Last Class
3/19/12 Mon Final Exam

Top

Homework

Top