Mathematical thinking is crucial in all areas of computer science: algorithms, bioinformatics, computer graphics, data science, machine learning, etc. In this course, we will learn the most important tools used in discrete mathematics: induction, recursion, logic, invariants, examples, optimality. We will use these tools to answer typical programming questions like: How can we be certain a solution exists? Am I sure my program computes the optimal answer? Do each of these objects meet the given requirements?
Этот курс входит в специализацию ''Специализация Introduction to Discrete Mathematics for Computer Science'
от партнера
Об этом курсе
Приобретаемые навыки
- Mathematical Induction
- Proof Theory
- Discrete Mathematics
- Mathematical Logic
от партнера
Программа курса: что вы изучите
Making Convincing Arguments
How to Find an Example?
Recursion and Induction
Logic
Рецензии
- 5 stars63,93 %
- 4 stars24,12 %
- 3 stars7,06 %
- 2 stars1,94 %
- 1 star2,93 %
Лучшие отзывы о курсе MATHEMATICAL THINKING IN COMPUTER SCIENCE
though i stuck somewhere but mentors was always there to assist you. really found this course interesting and very helpful. solved so much of tricky puzzles, Good course
I loved this course! So many interesting things to think about, thoughtfully explained by brilliant instructors. The puzzles really get you thinking. Such genius to put them before the lectures!
I applaud the instructors for their efforts in explaining the concepts as they could be abstract and hard to explain in words! More examples to illustrate the concepts will be even more helpful!
Course was good, but sometimes i needed additional sources to understand topic better. Maybe, it was because of my english. Anyway it gave me a path what i should look for! Thank you!
Специализация Introduction to Discrete Mathematics for Computer Science: общие сведения

Часто задаваемые вопросы
Когда я получу доступ к лекциям и заданиям?
Что я получу, оплатив сертификацию?
Можно ли получить финансовую помощь?
Остались вопросы? Посетите Центр поддержки учащихся.