Introduction
According to Wikipedia, Computer Science is "the scientific and practical approach to computation and its applications." As this is a scientific discipline, and a branch of Mathematics, it is only fitting that a core component of any Master's programme in Computer Science should include a module on the Mathematics of Computer Science.
In this course, we will be looking at mathematical tools which are useful to us as computer scientists, and which will prove useful in various areas of computer science, such as Artificial Intelligence, Information Systems, Theoretical Computer Science, and in Research.
The course is made up of a number of sections, each containing lecture material which can be worked through at your own pace, and exercises which are to be completed (see the section on assessment).
Course Overview
Mathematics for Computer Science
- Formal Logic
- Proof Methods
- Probability
- Discrete Mathematics
- Sets
- Functions
- Relations
- Formal languages; DFA’s, NFA’s
- Regular Expressions
- Context-Free Grammars
- Turing Machines
- NP-Completeness
Course Assessment
For those who would like to participate in this course and receive acknowledgement for participation and completion of this course, you can apply for the course badge. In order to apply for the course badge, you will need to have an online platform for submitting exercises and assignments. Some suggestions are a blog, an Evernote notbook, or the Etherpad.
Mathematics of Computer Science badge
For more information, please take a look at the Course Assessment page.
About the Organizer
My name is Ralfe Poisson (@ralfe), and I am busy completing my Open Master's degree in Computer Science. You can read more about this on my blog. The reason for creating this course is that I am using the publication of open courses as a public assessment mechanism for the content which I am studying as part of my Open Masters. I invite any and all feedback, comments, criticisms, and suggestions. Feel free to contact me via Twitter at @ralfe .