Presentation on theme: "Fall 2002CMSC 203 - Discrete Structures1 Welcome to CMSC 203 – Discrete Structures Fall 2002 Instructor: Paul Artola Instructor: Paul Artola."— Presentation transcript:
Fall 2002CMSC Discrete Structures1 Welcome to CMSC 203 – Discrete Structures Fall 2002 Instructor: Paul Artola Instructor: Paul Artola
Fall 2002CMSC Discrete Structures2 Instructor – Paul Artola Office: Classroom Office Hours: Thursdays, 9:30-? PM Phone: (CSEE Dep.)
Fall 2002CMSC Discrete Structures3 Now back to CMSC 203: Course Kit: Kenneth H. Rosen, Discrete Mathematics and its Applications (Available at the UMBC Bookstore) On the Web: (contains all kinds of course information and also my slides in PDF and HTML formats, updated after each session)
Fall 2002CMSC Discrete Structures5 Complaints about Grading If you think that the grading of your assignment or exam was unfair, write down your complaint (handwriting is OK), write down your complaint (handwriting is OK), attach it to the assignment or exam, attach it to the assignment or exam, and give it to me in class. and give it to me in class. I will re-grade the exam/assignment and return it to you in class.
Fall 2002CMSC Discrete Structures6 Why Care about Discrete Math? Digital computers are based on discrete “atoms” (bits).Digital computers are based on discrete “atoms” (bits). Therefore, both a computer’sTherefore, both a computer’s –structure (circuits) and –operations (execution of algorithms) can be described by discrete math. can be described by discrete math.
Fall 2002CMSC Discrete Structures7 Topics Covered Logic and Set TheoryLogic and Set Theory Functions and SequencesFunctions and Sequences Algorithms & the Big-O!Algorithms & the Big-O! Applications of Number TheoryApplications of Number Theory Mathematical Reasoning & InductionMathematical Reasoning & Induction Recursion & CountingRecursion & Counting Recurrence RelationsRecurrence Relations Binary Relations & Equivalence RelationsBinary Relations & Equivalence Relations Boolean AlgebraBoolean Algebra