CSE 20Discrete MathematicsSpring 2011University of California, San Diego

Course Information

- Objective of this course is to introduce discrete mathematics for computer system designs.
Instructor

- CK Cheng, CSE2130, ckcheng+20@ucsd.edu, 858 534-6184
Schedule

- Outlines (Use index to locate the sections in textbooks)
- Lectures: 3:30-4:50PM TTh, Center 216.
- Discussion: 12:00-12:50PM W, Center 214. No discussion section on 6/1.
- Office hours: 2:00-3:00PM T, 1:30-2:30PM Th, CSE 2130.
- Office hours: 1:30-2:30PM F 5/20.
- Office hours: 1:30-2:30PM F 5/27.
Annoucement

- WebCT for CSE 20 is open. Discussion boards available for questions and discussions. (Login with your student account at http://webct.ucsd.edu)
Teaching Assistants

Peng Du, 20hrs/week

- E-mail: pedu@cs.ucsd.edu
- Office Hours: EBU3B 2146, 6/2(Thu) 11:30am-1:00pm, 6/6(Mon) 10:00am-1:00pm
Han Suk Kim, 10hrs/week,

- E-mail: hskim@cs.ucsd.edu
- Office Hours: EUB3B 250A, Wed 4:00pm-6:00pm, 6/4(Sat) 11:00am-2:00pm
Iman Sadeghi, 10hrs/week,

- E-mail: ta.cse20@gmail.com
- Office Hours: EBU3B 240A, Fri 4:00pm-5:00pm, 6/3(Fri) 4:00pm-6:00pm
Ashutosh Devkota

- E-mail: adevkota@ucsd.edu
- Office Hours: Outside Prof. Cheng's office, 6/5(Sun) 3:00pm
Textbooks

- Chapters from Letctures in Discrete Mathematics by Edward A. Bender and S. Gill Williamson
- Discrete Mathematics, by Seymour Lipschutz and Marc Lipson, Schaum's Outline Series, Third Edition, McGraw Hill, 2009
Lecture Notes

- Lecture 1: Number Systems.
- Lecture 2: Binary Codes. Exercise: problems 2.8-18 in pages BF21-22 and problems 10-12 in pages BF23-25.
- Lecture 3,4: Negative Numbers and Subtraction.
- Exercise before midterm 1 Solution
- Exercise on Residual Number Systems: Problems 11.14-15, 11.17-18, 11.56-60 (Schaum's).
- Lecture 5: Residual Number System.
- Lecture 6: Chinese Remainder Theorem.
- Lecture 7: Boolean Algebra.
- Exercise on Boolean Algebra: Problems 15.1, 15.5-15, 15.22-26, 15.30-33 (Schaum's).
- Lecture 8: Boolean Postulates and Theorems.
- Lecture 9: Boolean Algebra: Theorems and Proofs.
- Lecture 10: Boolean Algebra: Transformations and Summary
- More exercises on Boolean Algebra, and solution.
- midterm 2 in Winter 2010, and solution.
- Lecture 10: Boolean Algebra: Transformations and Summary
- Lecture 11: Function
- Lecture 12: Homogeneous Linear Recursion
- Exercise on recursion: Problems 6.11-12, 31-35 (Schaum's).
- Th 5/12: Midterm 2. Coverage: Lecture notes 6-12 and exercises, closed book test.
- Lecture 13: Counting
- Exercise on pigeonhole principle: Problems 6.7-10, 21-30 (Schaum's).
- Lecture 14: Karnaugh Maps I
- Lecture 15: Karnaugh Maps II
- Lecture 16: Boolean Algebra: Applications
- More Exercises on Boolean Algebra: Problems 15.18-21, 35-42, 15.60-75 (Schaum's).
- Final and solution in Winter 2010. Skip problems 9-11..
- Exercises in Winter 2010, and Solutions. Skip the last part: Item 5. Counting.
Quiz Solutions and Useful Links

- Final Exam Solution and grading policy Problem Four Problem Nine
- Quiz 10-11.
- Quiz 6-7-8-9.
- Midterm two Solution and grading policy Statistics
- Quiz 4-5.
- Midterm one Solution and grading policy Statistics
- Quiz 1-2-3.
- binary number systems : includes signed operation multiplication, etc.
- mixed bases.
- binary/octal/decimal/hex.
Grading

- Quizzes and Office-Hr visits: 5%
- Midterm 1: 25% (Th 4/14)
- Midterm 2: 30% (Th 5/12)
- Final Exam: 40% (3:00-6:00PM, M 6/6)