Chevron Left
返回到 算法思想(第 2 部分)

學生對 莱斯大学 提供的 算法思想(第 2 部分) 的評價和反饋

4.7
170 個評分
29 條評論

課程概述

Experienced Computer Scientists analyze and solve computational problems at a level of abstraction that is beyond that of any particular programming language. This two-part class is designed to train students in the mathematical concepts and process of "Algorithmic Thinking", allowing them to build simpler, more efficient solutions to computational problems. In part 2 of this course, we will study advanced algorithmic techniques such as divide-and-conquer and dynamic programming. As the central part of the course, students will implement several algorithms in Python that incorporate these techniques and then use these algorithms to analyze two large real-world data sets. The main focus of these tasks is to understand interaction between the algorithms and the structure of the data sets being analyzed by these algorithms. Once students have completed this class, they will have both the mathematical and programming skills to analyze, design, and program solutions to a wide range of computational problems. While this class will use Python as its vehicle of choice to practice Algorithmic Thinking, the concepts that you will learn in this class transcend any particular programming language....

熱門審閱

RL

Mar 25, 2018

Great class...Luay's lectures and problem sets were a great continuation to what Joe and Scott started. I suppose I will get started on Course 7 shortly.

JO

Apr 29, 2018

Excellent class in the series. Even if computational biology is not your thing, the assignments are really interesting, fun and informative.

篩選依據:

26 - 算法思想(第 2 部分) 的 29 個評論(共 29 個)

創建者 Todd R

Sep 04, 2016

.

創建者 Martin W

Feb 03, 2017

Really like the mix of theory and practical application

創建者 Daniel W

Jan 08, 2020

Pros:

Lots of good material to learn. Challenging. Lectures are easy to understand.

Cons:

More dense, textbook-jargon "CS major" feel to this class than the others. Expect to spend more hours and have less fun vs. parts 1-4. Much easier to get discouraged. Major problems waiting for assignments to go through peer grading process, sometimes taking *weeks*.

Suggestions:

More basic handouts such as: 1) Set notation cheat sheet. 2) Pseudocode examples fully decoded into simple language. Also, watching a visualization of the base-pairing algorithm (Needleman-Wunsch) is highly recommended for understanding what you're trying to do. You can google it, but it would be nice if they added it to the course. Also, more smiling.

In summary, it's a challenging course and I'm a better programmer for having finished it. However, it's more daunting, took me longer, and lacks the easy going/encouraging/illustrative style of the earlier courses. Peer grading takes way too long, especially if you're paying for a subscription.

(My review applies to both Algorithmic Thinking Parts 1 and 2)

創建者 Roberto M P F M

Jun 10, 2019

The content is great, but it is taking ages for me to have my last assignment reviewed