Chevron Left
Retour à Combinatorics and Probability

Combinatorics and Probability, Université de Californie à San Diego

4.6
228 notes
44 avis

À propos de ce cours

Counting is one of the basic mathematically related tasks we encounter on a day to day basis. The main question here is the following. If we need to count something, can we do anything better than just counting all objects one by one? Do we need to create a list of all phone numbers to ensure that there are enough phone numbers for everyone? Is there a way to tell that our algorithm will run in a reasonable time before implementing and actually running it? All these questions are addressed by a mathematical field called Combinatorics. In this course we discuss most standard combinatorial settings that can help to answer questions of this type. We will especially concentrate on developing the ability to distinguish these settings in real life and algorithmic problems. This will help the learner to actually implement new knowledge. Apart from that we will discuss recursive technique for counting that is important for algorithmic implementations. One of the main `consumers’ of Combinatorics is Probability Theory. This area is connected with numerous sides of life, on one hand being an important concept in everyday life and on the other hand being an indispensable tool in such modern and important fields as Statistics and Machine Learning. In this course we will concentrate on providing the working knowledge of basics of probability and a good intuition in this area. The practice shows that such an intuition is not easy to develop. In the end of the course we will create a program that successfully plays a tricky and very counterintuitive dice game. As prerequisites we assume only basic math (e.g., we expect you to know what is a square or how to add fractions), basic programming in python (functions, loops, recursion), common sense and curiosity. Our intended audience are all people that work or plan to work in IT, starting from motivated high school students....

Meilleurs avis

par ZB

Oct 13, 2018

I really enjoyed taking this course. The teaching was pretty good and some of the quiz questions will challenge you if you haven't done Combinatorics before.

par CZ

Sep 11, 2018

The final project is hard for me cuz I don't have Python experience. and the logic is a little bit complicated. That's not for absolutely beginners!

Filtrer par :

44 avis

par Shubham Kumar Pandey

Apr 19, 2019

Especially the probability part was very good.

par Peter Nicewicz

Apr 06, 2019

Fantastic course! Really like Vladimir Podolskii's explanations and sense of humor. Great dice game at the end!

par vicky Li

Mar 06, 2019

The course is structured reasonably well. I especially liked how the quizzes were setup, there were lots of them testing my understanding from different angles.

However, I felt some of the videos could do with a bit more editing (with the typos and etc.). While these errors were pointed out as quizzes inside the video, it gets a bit distracting. Furthermore, for some of the weeks (week 4 say), there were a lot more material comparing to others (week 6 say). It felt a bit strange with such a huge change in workload to me personally and would have been nice to be slightly more consistent.

Overall, I enjoyed the course and felt like I have learnt the basics for what I wanted. Thanks.

par Mike Papageorge

Mar 03, 2019

Quite enjoyable, however Alex is not the strongest presenter though his passion is evident :)

par Remy E. Francis

Feb 07, 2019

Sometimes difficult to follow along with the accent for material that I already found new and challenging. Needed to supplement with Khan Academy and other sources.

par Michael Khor Hock Eu

Jan 22, 2019

Prof Vlad has really great examples!

par Ziqi Yuan

Dec 31, 2018

Great! Challenging final project but worth trying!

par Serhat Giydiren

Dec 22, 2018

Excellent, thanks.

par Bryan W Berry

Nov 27, 2018

Much stronger than the first course in this series. I very much enjoyed Vladimir and Alexander's lectures. The weakest part, unfortunately, were Alexander Shen's weeks. I must credit him, however, for being very responsive on the forum.

par Miguel Diaz

Nov 26, 2018

Super interesting the topic about combinatorics