CSE 20: Discrete Mathematics (Winter 2012)
Instructor: Joseph Pasquale
Teaching Assistant: Anshuman Gupta, a2gupta@ucsd.edu
Teaching Assistant: Rossana Motta, rmotta@ucsd.edu
Teaching Assistant: Srdjan Krstic, skrstic@ucsd.edu
Lectures: Tue/Thu 12:30-1:50, PCYNH 106
Discussion 1: Wed 12:00-12:50, WLH 2204
Discussion 2: Wed 1:00-1:50, WLH 2204
Messages
-
The course is completed. Best wishes with your future studies at UCSD.
-
Final grades have been submitted. You'll be able to access them the standard way via the registrar. You will be able to view your final exams at the beginning of spring quarter, where they will be available in the undergraduate office.
Description
This course is on discrete mathematics
for computer science students.
Topics will include
formal logic,
methods of proof (including induction),
set theory,
graph theory,
recurrence relations,
and some advanced topics to be determined.
The course is organized of the following:
-
Lectures: the lectures comprise the core material
-
Discussion: the discussion sections are led by the TA, and may be
organized as discussions on specific topics or question/answer sessions
-
Readings: the readings in the textbook supplement the lectures
-
Homework: homework problems will be assigned every week
-
Exams: there are two midterm exams and a final exam (all closed-book) covering the material presented in the lectures
Lectures
The notes for each lecture will be posted here one day prior to that lecture's class (generally in the evening, by 9pm).
-
Jan 10: Lecture 1, Formal Logic
-
Jan 12: Lecture 2, Propositional Logic
-
Jan 17: Lecture 3, Predicate Logic
-
Jan 19: Lecture 4, Logic in Mathematics
-
Jan 24, 26: Lecture 5, Methods of Proof
-
Jan 31: *** MIDTERM 1 ***
-
Feb 2: Lecture 6, Graphs
-
Feb 7: Lecture 7, Sets
-
Feb 9: Lecture 8, Functions
-
Feb 14: Lecture 9, Relations
-
Feb 16: Lecture 10, Partial Orderings
-
Feb 21: Lecture 11, Graph Theory
-
Feb 23: Lecture 11 cont', Graph Theory
-
Feb 28: *** MIDTERM 2 ***
-
Ma 1: Lecture 12, Recurrence Relations
-
Mar 6: Lecture 13, Closed-Form Solutions
-
Mar 8: Lecture 14, Recursive Definitions
-
Mar 13: Lecture 15, Proof by Induction
-
Mar 15: Lecture 16, Recursive Data Structures
References
-
Textbook: Essentials of Discrete Mathematics, 2nd ed. by David J. Hunter,
Jones and Bartlett Publishers, 2012.
Resources