CSE 20: Discrete Mathematics (Fall, 2005)

Discussion Section: Mon 3:00 - 3:50 in Center 105 and Tue 1:00-1:50 in EBU3B-B225.

Course Objectives: This course provides the mathematical background necessary for reasoning in computer science. You will learn logic and basic proof techniques useful for the design and verification of programs and circuits.

Course Description: Basic discrete mathematical structures; sets, relations, functions, sequences, equivalence relations, partial orders, and number systems. Methods of reasoning and proofs; propositional logic, predicate logic, induction, recursion, and pigeonhole principle. Infinite sets and diagonalization. Basic counting techniques; permutations and combinations. Applications will be given to digital logic design, elementary number theory, design of programs, and proofs of program correctness.

Textbook: A Short Course in Discrete Mathematics by E. Bender and G. Williamson This is available at the Bookstore, or it can be downloaded for free from http://www.math.ucsd.edu/~ebender/DiscreteText1/index.html.

Recommended: How to Read and Do Proofs by Daniel Solow.

2000 Solved Problems in Discrete Mathematics by Seymour Lipshchutz.

Discrete Mathematics with Applications by Susanna Epp.sss