Welcome to CMSC 203 – Discrete Structures Spring 2003 Instructor: Paul Artola Spring 2003 CMSC 203 - Discrete Structures

Instructor – Paul Artola Office: Classroom Office Hours: Thursdays, 9:45-? PM Phone: 455-3000 (CSEE Dep.) E-Mail: artola@umbc.edu artola@comcast.net Spring 2003 CMSC 203 - Discrete Structures

CMSC 203 - Discrete Structures Now back to CMSC 203: Course Kit: Kenneth H. Rosen, Discrete Mathematics and its Applications (Available at the UMBC Bookstore) On the Web: http://www.csee.umbc.edu/~artola/spring03 (contains all kinds of course information and also these slides.) Spring 2003 CMSC 203 - Discrete Structures

CMSC 203 - Discrete Structures Your Evaluation exams (best 2 of 3) 200 pts final exam (cumulative) 100 pts homework sets (best 3 of 4) 72 pts in-class group work (best 2 of 3) 24 pts class participation (exercises + ???) 4 pts 400 pts: 360 (A) / 320 (B) / 280 (C) / ? (D) Spring 2003 CMSC 203 - Discrete Structures

Complaints about Grading If you think that the grading of your assignment or exam was unfair, write down your complaint (handwriting is OK), attach it to the assignment or exam, and give it to me in class. I will re-grade the exam/assignment and return it to you in class. Spring 2003 CMSC 203 - Discrete Structures

Why Care about Discrete Math? Digital computers are based on discrete “atoms” (bits). Therefore, both a computer’s structure (circuits) and operations (execution of algorithms) can be described by discrete math. Spring 2003 CMSC 203 - Discrete Structures

CMSC 203 - Discrete Structures Topics Covered Logic and Set Theory Functions and Sequences Algorithms & the Big-O! Applications of Number Theory Mathematical Reasoning & Induction Recursion & Counting Discrete Probability Binary Relations & Equivalence Relations Graph Theory Boolean Algebra Spring 2003 CMSC 203 - Discrete Structures