80 likes | 129 Views
Welcome to CMSC 203 – Discrete Structures Fall 2002. Instructor: Paul Artola. Instructor – Paul Artola. Office: Classroom Office Hours: Thursdays, 9:30-? PM Phone: 455-3000 (CSEE Dep.) E-Mail: artola@umbc.edu artola@comcast.net. Now back to CMSC 203:.
E N D
Welcome toCMSC 203 – Discrete StructuresFall 2002 Instructor: Paul Artola CMSC 203 - Discrete Structures
Instructor – Paul Artola • Office: Classroom • Office Hours: Thursdays, 9:30-? PM • Phone: 455-3000 (CSEE Dep.) • E-Mail: artola@umbc.edu artola@comcast.net 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/fall2002 • (contains all kinds of course information and also my slides in PDF and HTML formats, updated after each session) CMSC 203 - Discrete Structures
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) 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. 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. 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 • Recurrence Relations • Binary Relations & Equivalence Relations • Boolean Algebra CMSC 203 - Discrete Structures