CSE 20:
Discrete Mathematics
(Winter, 2006)
Home | Syllabus |
Schedule | Exams |
Homework
Instructor: Neil Rhodes
(nrhodes@cs.ucsd.edu)
Office hours: Tuesday: 5:00-6:00, Thursday 12:45-2:30 in EBU3B 2208.
TA: Doug Turnbull (dougturnbull@gmail.com)
Office hours: Monday: 1:00-2:00, Wednesday 11:00-12:00 in EBU3B 240A
Announcements
Latest information concerning possible changes
in office hours, reading assignments, etc.
March 6:
-
Final's Week Office Hours:
Doug: Monday 1-2pm EBU 240A, Tuesday 11-12pm EBU3B 4144, Thursday 11-12pm EBU3B 4144
Prof. Rhodes: Friday 11-12pm EBU3B 2208
The final review session will be on Wednesday (March 22) from 11:15-2pm in Center 217A.
(Try question E0 2.1, 2.16, 2.22, 2.23 before the review session.)
March 6:
- Doug's office hours on March 13 are canceled. Please email him at dturnbul@ cs.ucsd.edu if you have any questions.
Feb. 23:
-
We had no quiz/homework for the material covered this week. Here are some problems you
might want to do in preparation for the midterm:
- SF: 2.7, 2.10, 2.11, 2.15, 2.18
- SF Multiple choice: 6, 7, 8, 10, 16, 18
- Solow: 11.6, 11.7, 11.8, 11.10, 11.12, 11.14, 11.25
Feb. 22:
-
The Midterm review session has changed. It will not be on Sunday evening, but instead on Monday afternoon.
See the schedule page for details.
Jan. 31:
-
The solution to last quarter's midterm has a small error in the solution to question 6: it says
"We can use CNF form". Actually, it's using DNF form.
- Question 4 covers material we'll be doing in today's lecture: mod arithmetic won't be covered on the
first midterm.
Jan. 27 :
-
The inked slides for this week (Day5 and Day6) are unavailble (due to technical
difficulties).
If they can be reconstructed, I'll repost them and let you know.
- The midterm from last year (along with solution) is now available. See the Exams page.
- Homework for next week is up too (it won't be on a quiz, but will be useful to study for the midterm).
- A note on diagonalization: you are responsible for the diagonalization argument that shows the real numbers
are not countable, and for the argument that the powerset of a set has larger cardinality than
the set itself. However, the diagonalization argument for the halting problem you are not responsible
for (will not be covered on an exam) because:
- The intention was to give you a rationale for why the diagonalization argument is
important in CS. It's covered in complete detail in CSE 105.
- The argument I made in class was faulty; I'll discuss that in a future class.
You should still understand the first argument for being unable to write a general-purpose
halt program: the paradox with trouble.
Jan. 18 :
-
Since the Solow book is out of stock in the bookstore, and not yet available on reserve, the quiz tommorow will not contain any of the hw from that book.
However, since Amazon.com has
the book
in stock for $37 with immediate availability, there's no excuse not to have the book by early next week.
Therefore, next week's quiz *will* cover the Solow book.
Jan. 12 (Day 2):
-
There were a couple of people who came after class with questions about binary numbers.
See the webboard for a posting I've made talking more about
binary numbers.