Tag Archives: algorithms

Classic Computer Science Problems in Python

Posted on October 27, 2019 | 2 comments

I really enjoyed Classic Computer Science Problems in Python by David Kopec. It covers many different problems I hadn’t read detailed explanations of before. For example: neural networks, constraint-satisfaction problems, genetic algorithms and the minimax algorithm. Unlike many other books on algorithms and programming problems, this one builds up complete (but small) programs that are easy to explore on your own.

Continue reading →

2 Comments

Posted in Learning, Programming

Tagged , , ,

Coursera course review: Algorithms: Design and Analysis, Part 2

Posted on February 18, 2013 | 8 comments

I recently finished the Coursera course Algorithms: Design and Analysis, Part 2 by Professor Tim Roughgarden of Stanford. I’ve already reviewed part 1, and here are my thoughts on the second part.

The main theme of part 1 was the divide and conquer paradigm. In the second part the main themes were greedy algorithms, dynamic programming and NP-Complete problems. The lectures were excellent, with clear and easy to follow algorithm development and proofs. At six weeks, it was one week longer than part 1, and I found it quite a bit harder than part 1. Here’s more on each part. Continue reading →

8 Comments

Posted in Learning, Programming

Tagged , , , ,

Coursera course review: Design and Analysis of Algorithms I

Posted on May 8, 2012 | 22 comments

I recently finnished the Coursera course Design and Analysis of Algorithms I, given by Professor Tim Roughgarden of Stanford. This was my second on-line course from Coursera (last fall I took Introduction to Databases, which I wrote about here), and I thought it would be interesting to compare  the two.

Continue reading →

22 Comments

Posted in Learning, Programming

Tagged , , , ,