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?

In the course, we use a try-this-before-we-explain-everything approach: you will be solving many interactive (and mobile friendly) puzzles that were carefully designed to allow you to invent many of the important ideas and concepts yourself.

Prerequisites:
1. We assume only basic math (e.g., we expect you to know what is a square or how to add fractions), common sense and curiosity.
2. Basic programming knowledge is necessary as some quizzes require programming in Python.

Course Reviews

N.A.

ratings
  • 5 stars0
  • 4 stars0
  • 3 stars0
  • 2 stars0
  • 1 stars0

No Reviews found for this course.

HACER ESTE CURSO IR AL CURSO

*Irás a la plataforma donde se impartirá el mooc y donde podrás registrarte

  • GRATIS
  • 10-12-2018FECHA INICIO
  • University of California, San Diego Higher School of Economics
  • Alexander S. Kulikov, Michael Levin and Vladimir Podolskii

Profesores

ALUMNOS MATRICULADOS

    Cursos Relacionados: