Syllabus

# Syllabus - ArsDigita University Month 2 Discrete...

This preview shows pages 1–2. Sign up to view the full content.

ArsDigita University Month 2: Discrete Mathematics - Professor Shai Simonson Syllabus Week 1: Introduction, Proofs, Logic, Boolean Algebra and applications, Sets and applications, Basic sums and functions. Reading: Rosen 1.1-1.8, 3.1-3.2, 5.5, 9.1-9.3 How to Read Mathematics ( http://academics.stonehill.edu/compsci/History_Math/math-read.htm ), Polya, How to Solve It . Lecture 1: What kinds of problems are solved in discrete math? What are proofs? Examples of proofs by contradiction, and proofs by induction: Triangle numbers, irrational numbers, and prime numbers. (3.1-3.2) Lecture 2: Boolean Algebra and formal logic. Applications in algorithms, complexity theory, AI, digital logic design and computer architecture. (1.1-1.2, 9.1-9.3) Lecture 3: More logic: quantifiers and predicates . Sets, operations on sets, using logic to prove identities on sets. (1.3-1.5) Lecture 4: Sets. Applications in counting (the inclusion-exclusion theorem), theory of computation and data structures. (5.5)

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This document was uploaded on 10/01/2011.

### Page1 / 2

Syllabus - ArsDigita University Month 2 Discrete...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online