• About
• Publications
• Courses
  • CMSC 455/655
  • CMSC 483/691
  • CMSC 313
  • CMSC 203
• Parallel I/O
  • threaded copy
  • Freeloader
  • Concurrent cURL
• ARRIA
  • Parallel Patterns
  • Task graphs
• Distributed Algorithms
  • Graph Algorithms
  • Bioinspired Algorithms
  • Distributed Neural Net.
• Program Listing

CMSC 203: Discrete Structures
Fall 2013, Section 2
Instructor: Tyler Simon
Time: Tuesdays and Thursdays 1:00-2:15pm
Location: Academic IV, room 013

---

Overview

This is an undergraduate course on discrete mathematics for computer science which covers proof techniques, counting methods and problem-solving strategies through topics such as logic, sets, graph and number theory, functions, combinatorics, modular and binary arithmetic, summations, probability and recurrence relations.

• Contact Info
• Course Description
• Course Syllabus
• Homework Assignments

Resources

• Course Textbook on Amazon
• Introduction to Mathematical Thinking by Keith Devlin (recommended)
• UMBC CSEE Dept. Help Center (Additional help is available for CMSC 203)
• Common Number Sets
• Introduction to Finite Mathematics, by Kemeny, Snell and Thompson
• Logic Puzzle, Knights and Knaves
• Problems in Combinatorics and Graph Theory