Welcome to CMSC 203 Discrete Structures Fall 2002

Welcome to CMSC 203 – Discrete Structures Fall 2002 Instructor: Paul Artola Fall 2002 CMSC 203 - Discrete Structures 1

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

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/fall 2002 (contains all kinds of course information and also my slides in PDF and HTML formats, updated after each session) Fall 2002 CMSC 203 - Discrete Structures 3

Your Evaluation • exams (best 2 of 3) 200 pts • final exam (cumulative) 100 pts • homework sets (best 4 of 5) 96 pts • class participation (exercises + ? ? ? ) 4 pts • 400 pts: 360 (A) / 320 (B) / 280 (C) / ? (D) Fall 2002 CMSC 203 - Discrete Structures 4

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. Fall 2002 CMSC 203 - Discrete Structures 5

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. Fall 2002 CMSC 203 - Discrete Structures 6

Topics Covered • Logic and Set Theory • Functions and Sequences • Algorithms & the Big-O! • Applications of Number Theory • Mathematical Reasoning & Induction • Recursion & Counting • Recurrence Relations • Binary Relations & Equivalence Relations • Boolean Algebra Fall 2002 CMSC 203 - Discrete Structures 7