1 / 7

Welcome to CMSC 203 – Discrete Structures Fall 2002

Delve into the fundamentals of discrete mathematics with CMSC 203. Explore logic, algorithms, number theory, and more. Enhance your understanding of digital systems and computer operations shaped by discrete math concepts. Stay engaged with course materials available online and excel in exams, homework assignments, and class participation. Instructor: Paul Artola provides a comprehensive learning experience. Embrace the significance of discrete math in computer science and equip yourself with essential knowledge for future endeavors in the field.

pbremner
Download Presentation

Welcome to CMSC 203 – Discrete Structures Fall 2002

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Welcome toCMSC 203 – Discrete StructuresFall 2002 Instructor: Paul Artola CMSC 203 - Discrete Structures

  2. 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

  3. 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

  4. 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

  5. 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

  6. 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

  7. 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

More Related