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?
제공자:
Mathematical Thinking in Computer Science
캘리포니아 샌디에고 대학교이 강좌에 대하여
귀하가 습득할 기술
- Mathematical Induction
- Proof Theory
- Discrete Mathematics
- Mathematical Logic
제공자:

캘리포니아 샌디에고 대학교
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.
강의 계획표 - 이 강좌에서 배울 내용
Making Convincing Arguments
Why some arguments are convincing and some others are not? What makes an argument convincing? How can you establish your argument in such a way that there is no room for doubt left? How can mathematical thinking help with this? In this section, we start digging into these questions. Our goal is to learn by examples how to understand proofs, how to discover them on your own, how to explain them, and — last but not least — how to enjoy them: we will see how a small remark or a simple observation can turn a seemingly non-trivial question into an obvious one.
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.
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 discrete mathematics and computer science. In particular, you will see them frequently in algorithms — for analysing correctness and running time of algorithms as well as for implementing efficient solutions. For some computational problems (e.g., exploring networks), recursive solutions are the most natural ones. The main idea of recursion and induction is to decompose a given problem into smaller problems of the same type. Being able to see such decompositions is an important skill both in mathematics and in programming. We'll hone this skill by solving various problems together.
Logic
Mathematical logic plays a crucial and indispensable role in creating convincing arguments. We use the rules and language of mathematical logic while writing code, while reasoning and making decisions, and while using computer programs. This week we’ll learn the basics of mathematical logic, and we'll practice tricky and seemingly counterintuitive, but yet logical aspects of mathematical logic. This will help us to write readable and precise code, and to formulate our thoughts rigorously and concisely.
검토
- 5 stars63.98%
- 4 stars24.12%
- 3 stars6.98%
- 2 stars1.97%
- 1 star2.93%
MATHEMATICAL THINKING IN COMPUTER SCIENCE의 최상위 리뷰
Positive: Great material, full of concepts, the teaching is simple and interactive, quizzes are amazing. Negative: Too much python programming (need to be aware of python basics)
a lot of it was hard to understand but it was nice to learn through the puzzles. i was completely lost during the honors content, and i thought we weren't well-prepared for the programming assignments
Mathematical Thinking in Computer Science course is very interesting to solve the puzzles and to think solutions in more than one way, This was surely enthusiastic :-)
The excellent approaching of supplanting intuition with puzzles to help reason, before starting the lectures makes proof making one of the most fun parts in this course.
자주 묻는 질문
강의 및 과제를 언제 이용할 수 있게 되나요?
이 수료증을 구매하면 무엇을 이용할 수 있나요?
재정 지원을 받을 수 있나요?
궁금한 점이 더 있으신가요? 학습자 도움말 센터를 방문해 보세요.