Math110
Discrete Mathematics 1
Faculty
Bartosz Kostka
Software Developer at Google Waterloo
Course length
Duration
Total hours
Credits
Language
Course type
Fee for single course
Fee for degree students
Skills you’ll learn
Overview
This course will develop the ability to strictly formulate thoughts, express them as mathematical proofs and will teach students the basic concepts, methods and models in discrete mathematics.
Learning highlights
- Ability to carry out formal reasoning with the use of mathematical methods of proving.
- Knowledge of core mathematical models: calculus of propositions and predicates and set theory.
- Applications of first order logic in problem solving.
- Knowledge of the basic concepts, theorems and algorithms of graph theory.
- Ability to model and analyze problems.
Course outline
15 classes
Session 1
Set theory
Session 2
Proof techniques I
Session 3
Proof techniques II
Session 4
Propositional Logic
Session 5
First-Order Logic I
Session 6
First-Order Logic II
Session 7
Midterm Exam
Session 8
Functions I
Session 9
Functions II
Session 10
Cardinality
Session 11
Graphs I
Session 12
Graphs II
Session 13
Recursion
Session 14
Review
Session 15
Final Exam
Course materials
Books
Prerequisites
Basics of Mathematics
Sep 27 - Oct 15, 2021
David Zmiaikou
PhD, Lecturer at the Belarusian State University
Algebra and Number Theory 1
Jan 31 - Feb 18, 2022
Laurent Cantier
Post-Doctoral Fellow at Universitat Autònoma de Barcelona
Combinatorics & Probability
Mar 14 - Apr 01, 2022
David Zmiaikou
PhD, Lecturer at the Belarusian State University
Methodology
Lectures
Problem solving sessions
Mid-term exam
Final exam
Students accumulate points by presenting their solutions during the problem solving sessions. Students can get up to 60 points that way. Exams provide an opportunity to get additional 80 points (30 midterm + 50 final).
In total, students can obtain 60+30+50=140 points. The final grade will be equal to P/140*100 (%), where P is the number of points obtained by a student.
Grading
Software developer at Google Canada. Member of the team responsible for the Google Kick Start competition. Former high-school teacher, where he mostly focused on personal tutoring with gifted students. Within 6 years, his students won 7 medals in International Olympiad in Informatics (5 gold, 1 silver, and 1 bronze) and 22 medals in Polish Olympiad in Informatics. He helped to organize many national and international competitions: a member of the IOI Host Scientific Committee in 2019 and Baltic OI Scientific Committee in 2015, among others. Now he focuses on educating the youngest generation, being the chair of the jury, a problemsetter, and a member of the organizing committee of the Polish Junior Olympiad in Informatics. Retired sports programmer, International Grandmaster on Codeforces.
See full profileApply for this course
Discrete Mathematics 1
by Bartosz Kostka
Total hours
45 Hours
Dates
May 02 - May 20, 2022
Fee for single course
€1500
Fee for degree students
€750
How to secure your spot
Complete the form below to kickstart your application
Schedule your Harbour.Space interview
If successful, get ready to join us on campus
FAQ
Will I receive a certificate after completion?
Yes. Upon completion of the course, you will receive a certificate signed by the director of the program your course belonged to.
Do I need a visa?
This depends on your case. Please check with the Spanish or Thai consulate in your country of residence about visa requirements. We will do our part to provide you with the necessary documents, such as the Certificate of Enrollment.
Can I get a discount?
Yes. The easiest way to enroll in a course at a discounted price is to register for multiple courses. Registering for multiple courses will reduce the cost per individual course. Please ask the Admissions Office for more information about the other kinds of discounts we offer and what you can do to receive one.