|
Welcome to Paul Artola's CMSC 203 Home Page! |
Grades are done! Happy Holidays and Happy New Year!
Computer Science 203, Discrete Structures, is a required course for Computer Science Majors. The class covers proof techniques, counting methods, and problem-solving strategies through topics such as logic, sets, numbers, functions, relations, combinatorics, modular arithmetic, summations, and recurrences.
Proof techniques including direct/indirect, contradiction, counterexample, counting/Pigeonhole Principle, and strong and weak mathematical induction will be covered, as will counting methods including the fundamental principle of counting, permutations, combinations, k-permutations, permutations with repeated elements, principle of inclusion/exclusion.
Important note about exam material and scheduling to make up a December 5 snow day is here.
Class-related materials available here are:
Thanks to Prof. Marc Pomplun of the University of Massachussets, Boston, for the slides!
Other math and computer science related materials:
Paul Artola, artola@umbc.edu