À propos de ce cours : 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.
Les destinataires de ce cours : Our intended audience are all people that work or plan to work in IT, starting from motivated high school students. 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.
Créé par : Université de Californie, San Diego, Université nationale de recherche, École des hautes études en sciences économiques
Enseigné par : Alexander S. Kulikov, Visiting Professor
Department of Computer Science and EngineeringEnseigné par : Michael Levin, Lecturer
Computer ScienceEnseigné par : Vladimir Podolskii, Associate Professor
Computer Science Department
| Informations de base | Cours 1 de 5 dans Introduction to Discrete Mathematics for Computer Science Specialization |
| Niveau | Débutant |
| Engagement | 6 weeks, 2–5 hours/week |
| Langue | English |
| Comment réussir | Réussissez tous les devoirs notés pour terminer le cours. |
| Notes des utilisateurs |
Programme de cours
SEMAINE 1
Making Convincing Arguments
Why some arguments are convincing and some are not? What makes an argument convincing? How to establish your argument in such a way that there is no possible room for doubt left? How mathematical thinking can help with this? In this week we will start digging into these questions. We will see how a small remark or a simple observation can turn a seemingly non-trivial question into an obvious one. Through various examples we will observe a parallel between constructing a rigorous argument and mathematical reasoning.
10 vidéos, 4 lectures
- Vidéo: Proofs?
- LTI Item: Puzzle: Tile a Chessboard
- Vidéo: Proof by Example
- Vidéo: Impossibility Proof
- Vidéo: Impossibility Proof, II and Conclusion
- Reading: Slides
- Reading: Python
- Vidéo: One Example is Enough
- Vidéo: Splitting an Octagon
- Vidéo: Making Fun in Real Life: Tensegrities
- Vidéo: Know Your Rights
- Vidéo: Nobody Can Win All The Time: Nonexisting Examples
- Reading: Slides
- Reading: Acknowledgements
Noté: Tiles, dominos, black and white, even and odd
Noté: Puzzle: Two Congruent Parts
Noté: Puzzle: Pluses, Minuses and Splitting
SEMAINE 2
How to Find an Example?
How can we be certain that an object with certain requirements exist? One way to show this, is to go through all objects and check whether at least one of them meets the requirements. However, in many cases, the search space is enormous. A computer may help, but some reasoning that narrows the search space is important both for computer search and for "bare hands" work. In this module, we will learn various techniques for showing that an object exists and that an object is optimal among all other objects. As usual, we'll practice solving many interactive puzzles. We'll show also some computer programs that help us to construct an example.
16 vidéos, 5 lectures, 1 quiz pour s'exercer
- Vidéo: Narrowing the Search
- Vidéo: Multiplicative Magic Squares
- Vidéo: More Puzzles
- Vidéo: Integer Linear Combinations
- Vidéo: Paths In a Graph
- Reading: Slides
- LTI Item: Puzzle: N Queens (Optional)
- Vidéo: N Queens: Brute Force Search (Optional)
- Reading: N Queens: Brute Force Solution Code (Optional)
- Vidéo: N Queens: Backtracking: Example (Optional)
- Vidéo: N Queens: Backtracking: Code (Optional)
- Reading: N Queens: Backtracking Solution Code (Optional)
- LTI Item: Puzzle: 16 Diagonals (Optional)
- Vidéo: 16 Diagonals (Optional)
- Practice Quiz: Number of Solutions for the 8 Queens Puzzle (Optional)
- Reading: Slides (Optional)
- Vidéo: Warm-up
- Vidéo: Subset without x and 100-x
- Vidéo: Rooks on a Chessboard
- Vidéo: Knights on a Chessboard
- Vidéo: Bishops on a Chessboard
- Vidéo: Subset without x and 2x
- Reading: Slides
Noté: Puzzle: Magic Square 3 times 3
Noté: Puzzle: Different People Have Different Coins
Noté: Puzzle: Free accomodation
Noté: Is there...
Noté: Maximum Number of Two-digit Integers
Noté: Puzzle: Maximum Number of Rooks on a Chessboard
Noté: Puzzle: Maximum Number of Knights on a Chessboard
Noté: Puzzle: Maximum Number of Bishops on a Chessboard
Noté: Puzzle: Subset without x and 2x
SEMAINE 3
Recursion and Induction
We'll discover two powerful methods of defining objects, proving concepts, and implementing programs — recursion and induction. These two methods are heavily used, in particular, in algorithms — for analysing correctness and running time of algorithms as well as for implementing efficient solutions. You will see that induction is as simple as falling dominos, but allows to make convincing arguments for arbitrarily large and complex problems by decomposing them and moving step by step. You will learn how famous Gauss unexpectedly solved his teacher's problem intended to keep him busy the whole lesson in just two minutes, and in the end you will be able to prove his formula using induction. You will be able to generalize scary arithmetic exercises and then solve them easily using induction.
13 vidéos, 2 lectures
- Vidéo: Coin Problem
- Vidéo: Hanoi Towers
- Reading: Slides
- Vidéo: Introduction, Lines and Triangles Problem
- Vidéo: Lines and Triangles: Proof by Induction
- Vidéo: Connecting Points
- Vidéo: Odd Points: Proof by Induction
- Vidéo: Sums of Numbers
- Vidéo: Bernoulli's Inequality
- Notebook: Bernoulli's Inequality
- Vidéo: Coins Problem
- Vidéo: Cutting a Triangle
- Vidéo: Flawed Induction Proofs
- Vidéo: Alternating Sum
- Reading: Slides
Noté: Largest Amount that Cannot Be Paid with 5- and 7-Coins
Noté: Pay Any Large Amount with 5- and 7-Coins
Noté: Puzzle: Hanoi Towers
Noté: Number of Moves to Solve the Hanoi Towers Puzzle
Noté: Puzzle: Two Cells of Opposite Colors
Noté: Puzzle: Connect Points
Noté: Induction
SEMAINE 4
Logic
We have already invoked mathematical logic when we discussed how to make convincing arguments by giving examples. This week we will turn mathematical logic full on. We will discuss its basic operations and rules. We will see how logic can play a crucial and indispensable role in creating convincing arguments. We will discuss how to construct a negation to the statement, and you will see how to win an argument by showing your opponent is wrong with just one example called counterexample!. We will see tricky and seemingly counterintuitive, but yet (an unintentional pun) logical aspects of mathematical logic. We will see one of the oldest approaches to making convincing arguments: Reductio ad Absurdum.
10 vidéos, 2 lectures
- Vidéo: Counterexamples
- Vidéo: Basic Logic Constructs
- Vidéo: If-Then Generalization, Quantification
- Reading: Slides
- Vidéo: Reductio ad Absurdum
- Vidéo: Balls in Boxes
- Vidéo: Numbers in Tables
- Vidéo: Pigeonhole Principle
- Vidéo: An (-1,0,1) Antimagic Square
- Vidéo: Handshakes
- Reading: Slides
Noté: Puzzle: Always Prime?
Noté: Examples, Counterexamples and Logic
Noté: Puzzle: Balls in Boxes
Noté: Puzzle: Numbers in Boxes
Noté: Puzzle: Numbers on the Chessboard
Noté: Numbers in Boxes
Noté: How to Pick Socks
Noté: Pigeonhole Principle
Noté: Puzzle: An (-1,0,1) Antimagic Square
SEMAINE 5
Invariants
"There are things that never change". Apart from being just a philosophical statement, this phrase turns out to be an important idea that can actually help. In this module we will see how it can help in problem solving. Things that do not change are called invariants in mathematics. They form an important tool of proving with numerous applications, including estimating running time of programs and algorithms. We will get some intuition of what they are, see how they can look like, and get some practice in using them.
11 vidéos, 4 lectures, 3 quiz pour s'exercer
- Vidéo: `Homework Assignment' Problem
- Reading: Slides
- Practice Quiz: Coffee with Milk
- Vidéo: Invariants
- Practice Quiz: More Coffee
- Vidéo: More Coffee
- Vidéo: Debugging Problem
- Reading: Slides
- Practice Quiz: Football Fans
- Vidéo: Termination
- Vidéo: Arthur’s Books
- Reading: Slides
- Vidéo: Even and Odd Numbers
- Vidéo: Summing up Digits
- Vidéo: Switching Signs
- Vidéo: Advanced Signs Switching
- Reading: Slides
Noté: Puzzle: Sums of Rows and Columns
Noté: 'Homework Assignment' Problem
Noté: 'Homework Assignment' Problem 2
Noté: Chess Tournaments
Noté: Debugging Problem
Noté: Merging Bank Accounts
Noté: Puzzle: Arthur's Books
Noté: Puzzle: Piece on a Chessboard
Noté: Operations on Even and Odd Numbers
Noté: Puzzle: Summing Up Digits
Noté: Puzzle: Switching Signs
Noté: Recolouring Chessboard
SEMAINE 6
Solving a 15-Puzzle
In this module, we consider a well known 15-puzzle where one needs to restore order among 15 square pieces in a square box. It turns out that the behavior of this puzzle is determined by mathematics: it is solvable if and only if the corresponding permutation is even. We will learn the basic properties of even and odd permutations. The task is to write a program that determines whether a permutation is even or odd. There is also a more difficult bonus task: to write a program that actually computes a solution (sequence of moves) for a given position assuming that this position is solvable.
8 vidéos, 3 lectures, 1 quiz pour s'exercer
- Vidéo: Permutations
- Vidéo: Proof: The Difficult Part
- Vidéo: Mission Impossible
- Vidéo: Classify a Permutation as Even/Odd
- Vidéo: Bonus Track: Fast Classification
- Reading: Slides
- Vidéo: Project: The Task
- Reading: Even permutations
- Reading: Bonus Track: Finding The Sequence of Moves
- Practice Quiz: Bonus Track: Algorithm for 15-Puzzle
- Vidéo: Quiz Hint: Why Every Even Permutation Is Solvable
Noté: Puzzle: 15
Noté: Transpositions and Permutations
Noté: Neighbor transpositions
Noté: Is a permutation even?
FAQ
Comment cela fonctionne
Coursework
Each course is like an interactive textbook, featuring pre-recorded videos, quizzes and projects.
Help from Your Peers
Connect with thousands of other learners and debate ideas, discuss course material, and get help mastering concepts.
Certificates
Earn official recognition for your work, and share your success with friends, colleagues, and employers.
Créateurs
Université de Californie, San Diego
UC San Diego is an academic powerhouse and economic engine, recognized as one of the top 10 public universities by U.S. News and World Report. Innovation is central to who we are and what we do. Here, students learn that knowledge isn't just acquired in the classroom—life is their laboratory.
Université nationale de recherche, École des hautes études en sciences économiques
National Research University - Higher School of Economics (HSE) is one of the top research universities in Russia. Established in 1992 to promote new research and teaching in economics and related disciplines, it now offers programs at all levels of university education across an extraordinary range of fields of study including business, sociology, cultural studies, philosophy, political science, international relations, law, Asian studies, media and communications, IT, mathematics, engineering, and more.
Learn more on www.hse.ru
Tarification
| Acheter le cours | |
|---|---|
| Accéder au contenu du cours | Disponible |
| Accéder au contenu noté | Disponible |
| Recevoir une Note Finale | Disponible |
| Obtenir un Certificat de Cours partageable | Disponible |
Notation et examens
There are many very interesting cases in this course! I will definitely recommend it to others!
The course is well structured, and made interesting with interactive puzzles.
Nice course! I want to say thanks to teachers. Course was informative and new for me!
Coursera propose un accès universel à la meilleure formation au monde,
en partenariat avec des universités et des organisations du plus haut niveau, pour proposer des cours en ligne.
© 2018 Coursera Inc. Tous droits réservés.
Perfect!