Chevron Left
Вернуться к Algorithmic Toolbox

Отзывы учащихся о курсе Algorithmic Toolbox от партнера Калифорнийский университет в Сан-Диего

4.6
звезд
Оценки: 9,777
Рецензии: 2,068

О курсе

The course covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming. We will learn a lot of theory: how to sort data and how it helps for searching; how to break a large problem into pieces and solve them recursively; when it makes sense to proceed greedily; how dynamic programming is used in genomic studies. You will practice solving computational problems, designing new algorithms, and implementing solutions efficiently (so that they run in less than a second)....

Лучшие рецензии

SG
19 янв. 2017 г.

I liked the fact that the algorithms are not just the introductory searching and sorting algorithms. The assignments are fairly difficult (I have decent scripting experience), but not impossibly so.

MM
28 сент. 2017 г.

good course, I like the fact you can use a lot of languages for you programming exercises, the content is really helpful, I would like to have more indications from the grading system to save time.

Фильтр по:

1926–1950 из 1,992 отзывов о курсе Algorithmic Toolbox

автор: Mayank M

10 июля 2020 г.

NEED TO IN MORE DEPTH AND MORE TOPICS NEED TO BE COVERED.

автор: Krikchai P

9 мая 2020 г.

subtitle does not match with audio.

unclear explanation.

автор: Kuldeep G

23 авг. 2020 г.

I think that video lectures can be made more detailed.

автор: Alakesh B

27 июля 2020 г.

Weeks 5 and 6 were a nightmare. Very poorly taught.

автор: Rishi V R

6 июля 2020 г.

More clear explanation with examples are needed

автор: Jayakumari M

4 мар. 2020 г.

Few videos in week 6 are not loading properly.

автор: siddhartha b

5 июня 2020 г.

I learned a lot with the help of this course.

автор: Sanatan S

29 июня 2020 г.

An okay course, a bit less implementative.

автор: GUDLA M S 1

6 июня 2020 г.

the teachers were good and explaining well

автор: Erickson N R I

5 нояб. 2020 г.

I didn't get anything after the 2nd week

автор: Apurv A S

5 апр. 2020 г.

The assignment questions were very tough

автор: HARSH S G

31 июля 2020 г.

Can be made a bit easy to understand.

автор: Sawan P

29 июня 2020 г.

Video Explaination should be improved

автор: Jitendra S

13 авг. 2017 г.

Need to more practise question

автор: Bijoy D

15 июня 2020 г.

explanations are not so good

автор: Nicolas E

26 окт. 2016 г.

A little light on the theory

автор: Aryan V

7 июля 2019 г.

subtitle donot work on pc

автор: Alan Z

17 мая 2018 г.

Not well designed course

автор: harshit s

21 июня 2020 г.

not good for begineers

автор: Ashwin M

15 мая 2020 г.

Advanced for beginners

автор: 刘晓菡

2 мар. 2018 г.

kind of difficult

автор: Liangqu C

22 сент. 2017 г.

Feel not great

автор: Yi L

27 мая 2019 г.

继续努力

автор: Nuthalapati s s

20 нояб. 2020 г.

ok

автор: Zhongyu K

13 мая 2016 г.

Even though this course covers a lot fundamentals for introduction to algorithm, the course itself is not designed as good as I expected. For starters, the weekly problem designs aren't very good. Some problem statements are ambiguous and not very clear unless you read more than one time or take a closer look at the examples. Often, the input format/arguments are designed to take redundant info. Some problem even has more than one possible correct outputs, which is just confusing for learning purpose.

In terms of lecture videos, it's good that there are some classic algorithm problems being demonstrated in the video, however the linkage between how to express a problem in mathematical languages is poorly explained. For example, in the lecture of edit distance, the realization of the matrix was not well explained at all. I personally appreciate a lot of the thorough proving steps introduced in the lectures, however I personally think the proofs are often not well explained to the audience (I also understand that it's more difficult to explain proving steps). Considering the large variety of audience, I would recommend the instructors separate the comprehensive more in-depth knowledge into optional videos, in this way the audiences could decide if they want to spend time in optional videos or not based on their own needs, meanwhile the instructors could spend a little bit more time to explain the difficult concepts better. Overall, I know that talking and analyzing algorithms can be kinda of boring and challenging, but I wish the course videos could be stated in a more interesting and intriguing way.