Chevron Left
Volver a Algorithmic Thinking (Part 1)

Opiniones y comentarios de aprendices correspondientes a Algorithmic Thinking (Part 1) por parte de Universidad Rice

4.6
estrellas
354 calificaciones

Acerca del Curso

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 course builds on the principles that you learned in our Principles of Computing course and is designed to train students in the mathematical concepts and process of "Algorithmic Thinking", allowing them to build simpler, more efficient solutions to real-world computational problems. In part 1 of this course, we will study the notion of algorithmic efficiency and consider its application to several problems from graph theory. As the central part of the course, students will implement several important graph algorithms in Python 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. Recommended Background - Students should be comfortable writing intermediate size (300+ line) programs in Python and have a basic understanding of searching, sorting, and recursion. Students should also have a solid math background that includes algebra, pre-calculus and a familiarity with the math concepts covered in "Principles of Computing"....

Principales reseñas

OT

28 de sep. de 2018

very educational. I've learnt not only about graph theory but also how to use matplotlib and timeit libraries. The assignments were quite challengeable but rewarding.

MR

16 de sep. de 2019

The class is very useful, I already see the improvement in the codes that I write. And the assignments are very well-designed and truly helpful.

Filtrar por:

1 - 25 de 70 revisiones para Algorithmic Thinking (Part 1)

por Ian B

25 de jul. de 2017

por Yair B

30 de abr. de 2016

por Alvin L

22 de nov. de 2017

por Zoltán T

18 de jul. de 2019

por Max B

21 de mar. de 2019

por Daniel W

8 de ene. de 2020

por Stephen H

7 de may. de 2016

por Eelko d G

17 de nov. de 2016

por Yu(Helena) H

2 de dic. de 2016

por 周玮晨

21 de ago. de 2018

por Rudy H

6 de mar. de 2019

por Julian O

21 de mar. de 2018

por Artur P

20 de sep. de 2018

por Todd R

29 de ago. de 2016

por Olga T

28 de sep. de 2018

por Maysam Q R

17 de sep. de 2019

por Márton A N

8 de mar. de 2018

por Gerardo G

8 de mar. de 2019

por Tairan Y

13 de may. de 2018

por Aaron M

22 de mar. de 2018

por Vern K

26 de jul. de 2018

por Andrew F

5 de mar. de 2018

por Adam C

9 de jul. de 2019

por Rita I G

7 de feb. de 2019

por 이선재

11 de dic. de 2020