Chevron Left
Retour à Algorithmic Toolbox

Avis et commentaires pour d'étudiants pour Algorithmic Toolbox par Université de Californie à San Diego

6,025 évaluations
1,268 avis

À propos du cours

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)....

Meilleurs avis


Jan 20, 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.


Sep 29, 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.

Filtrer par :

1026 - 1050 sur 1,198 Avis pour Algorithmic Toolbox

par Jimmy

Mar 24, 2016

I really think this is a good course, but some of them is hard to understand for me as beginner.

par Shashank P

Jan 25, 2019

i feel a bit of diificulty in understanding some concepts.But the assignments are top class.

par Alberto B

Nov 26, 2016

I think that some assignations are too difficult, and some indeed few explanations are poor

par Pranshu P

Jul 21, 2019

Well structured course, helped me understand how to use the different types of algorithms.

par Pradeep B R

Feb 01, 2017

Course covers most of the classic algorithms problems. There should have been final exam.

par Alexander T

Apr 19, 2016

Немного легко для продвинутого программиста, а вообще курс очень интересный, многое узнал.

par Rohan K

Jun 03, 2017

Assignments are difficult. Instructors are good but the course might seem a little fast.

par Gokula K

May 02, 2016

It is a great course. But explanation could be made simpler in proof part of the course.

par Abhinaba M

Oct 31, 2019

The Course is very informative and educational. It has come to benefit me in many ways.

par Paulo A

Jul 17, 2016

The dynamic programming classes could be really improved, but, overall, a solid course.

par Jenna W

Jul 02, 2016

Once they dig into the material, the difficulty ramps up, and it's absolutely worth it!

par abdulla m

May 18, 2018

week 3 is the worst part of this course. the explaination is not clear niether helpful

par Kalin D D

Sep 25, 2018

It will be good idea after solving a problem to be able to see a referent solution

par Vivek B

Oct 06, 2016

Explanation could have been more clear, especially for polynomial multiplication.

par Muhammad A H M M

Jul 17, 2019

great assignments and quizes but teaching videos are not that helpful sometimes

par Andrew Z

Nov 24, 2018

DP is not such clear. I have to read a lot from other place to understand it.

par Monmohan

Jan 16, 2020

Great assignments. They are really the key to building the thinking muscle

par Rohit K

Jul 23, 2019

Great course, helped me in moving from brute-force to optimized solutions.

par Ayush P

Jun 21, 2018

The course was really good and helped me understand algorithmic thinking.

par Bahaa I

Mar 15, 2019

The Course was really informative. But the staff contact was very poor

par julio c d M

Feb 23, 2020

It encourages you to investigate and generate new ideas. Good course.

par Nikhil S

Jan 22, 2020

this course is very helpful for me.thanks for provide me this course


Dec 27, 2019

It is nice that the algorithms are "free" from programming language.

par Abhishek j

Jan 07, 2018

Some of the videos weren't very explanatory but overall it was good.

par ben r b

Apr 03, 2017

The only, issue: we does not have the data set to validate our code.