excellent

very good

Excellent

very good

Perfect!

love it.

good

Overall this was a good course. I was also studying the topics from other sources and reading Discrete Mathematics and Its Applications by Rosen and doing all the exercises at the end of each section of Rosen. I felt like the lectures in this course give a very basic overview but do not really get you to the point that you will be ready to apply what you learn to different problem situations. For example, logic was covered in about 20 minutes worth of video but is a 100-page chapter in Rosen, and for one to feel comfortable doing exercises as presented in Rosen or as seen on the homework assignments of many universities, you will need more exposure to the material. This may have been the case because this course is titled Mathematical Thinking in Computer Science and was previously called What Is A Proof? and their intention was not to really teach anything other than that and the other courses in the Specialization will get more into the specifics topics covered in Discrete Mathematics. I still plan on taking the other courses in this specialization as I feel that after reading Rosen and working out the problems in Rosen, its nice hearing some of the material covered again and only serves to reinforce principles. This course has a nice amount of interactive exercises that allow one to practice solving puzzles of sorts. I enjoyed those, although do not think they are sufficient to overcome the lack of practice doing different problems. Note to instructors: More exercises in logic to assess and develop ability in logic would be nice as its a very important part of Discrete Mathematics. If logic is only covered in this class in the specialization and isn't retaught in more depth in the other courses in this specialization, then it is not really being covered properly in this Specialization in Discrete Mathematics.

Good overall, but week 6 in particular was below my expectations. The students should not be answering questions in order to correct errors in the lecturer's phrasing; you should simply do the sensible thing and re-record the lecture, ensuring accuracy before posting. The final (albeit optional) project of the course is to write a solver for the 15-puzzle. This involved some graph theory self study, since graph theory is out of the scope of this course. A hastily explained intro to graph theory during the final lecture without slides is not sufficient to prepare the students for this task. I would strongly suggest a revision of the entire 6th week.

This course helps you to put your arguments forward to convince self and other people. There are several techniques to do that. Sometimes providing a single example does the trick while providing counter examples become necessary in other situations. Learners of this course will get new insight about known puzzles. How to find examples is an important part of this course. Alex and Michale are pretty good to put the thoughts that they have. Other lecturers sometimes may confuse pupil. Overall a great start to learn discrete mathematics.

Pretty good course, although the topics were sometimes confusing. I think this is to be expected given the nature of the topic, as it's a whole new way of thinking about mathematical problems. I wish the course put some of the techniques used when solving the puzzles into a more explicit or formal context. After some of the puzzles, I was left wondering how to generalize the specific problem-solving technique or insight.

I followed along pretty well but there where a few parts that the instructors just sort of hand waved the developing the formula's needed to solve the theorems. Also the programming questions where always clear about how they wanted the return object represented. This led to some try and error, falling the question to see what little feed back it would give, making a change to the subroutine and then trying again.

I definitely enjoyed this course. The content was presented at an approachable level and the hands-on puzzles were fun lead-ins to the mathematical explanations. Some of the in-video pop-ups and polls seemed silly, though, and there were a couple small errors and content ordering issues (like pigeonhole principle taught repeatedly). Overall, though, I would take this again.

The course was well designed and of course the input from all the 3 instructors was quite appreciable but in fact at some points the reasons were not quite fulfilling the desired need as the course was much related to proofs hence I expected more powerful reasons but as a beginners lesson it was wonderful and to be very honest I am very much thankful to coursera.

the content of the course is put together in a great fashion.the quizzes, puzzles, and programming assignments were all very fun to do and made the lectures make more sense.my main complain is that some instructors made the pacing very confusing. i.e. spend too long explaining simple ideas and jumping fast over important confusing one.

A good introduction to people who are new to CS and want to get the basics right. The puzzles and quizzes are quite well designed, fun and with just the right amount of challenge most of the time. On the downside, it is a bit hard to follow some of the lecturers due to their communication styles. On the whole, a recommended course

There are many funny puzzles in this course.But i think the diffcult so low.assume you don't know how to proof it,you also can use force to find the answer.the knowledge of this course so wide,but not deep.of course the team are very hard,i wish you can continue to push out more course to improve us,Thanks for your efforts.

This course mostly deals with mathematical puzzles. I had fun solving those puzzles. But what I was really concerned about was the explanation part. Some of the explanations are sometimes really hard to grasp. Apart from that it is a nice course. I hope they will make clear explanations in future.

I like the new title "Mathematical Thinking in Computer Science" rather than "What is a proof?". Good course for beginners of the subject discrete mathematics. It really does what the title says. It helps improve your mathematical thinking and prepares you for computer science studies.

It is really good to start, very easy to digest and flows naturally. The only thing I have issues with is that programming is not my strong suit so it gets very hard for me to accomplish the programming tasks, and it took me a lot of time and a lot of stackoverflow searches.

The course went faster in some places but was excellent otherwise. The methodology of solving puzzles before a lecture is what I loved the most and that is probably the best part of the course. Looking forward to taking up other courses in the Specialization.

Some parts are very hard to follow. I found week 6 the most challenging because I have a sort of weak logical thinking base. Also I believe it should have been explained more clearly because programming mathematical statements isn't so easy.

It was a very engaging course presented in the most interactive way possible. The only problem I have is with the final week. The explanations seemed rush and not properly done. But other than that, I'd recommend this course to everyone.

Teaching mathematics seems tough, the course is a good attempt, congratulations to the instructors. The reason I don't give maximum rate is that I found myself frequently re-framing big parts of the explanations in order to understand.

Professor Alexander Shen's way of teaching and passion was really fun to see and although there weren't as many particular algorithms and such to directly apply in Computer Science, it was a good starting point to the specialization.