Lectures

Hopefully you have enjoyed this course. Assuming that you have, today we discuss your options about what to do next in computer science.    More ›

This lecture references Videos 28.1-28.7.

In this lecture we introduce generators, which are a very “Pythonic” feature. They give us a way to speed up for-loops, and introduce us to an entirely new way of thinking about programs.    More ›

This lecture references Videos 30.6-30.8.

In the previous lecture, we talked about sorting, but the algorithms we introduced were pretty slow. In this lecture we show how to use recursion to create better sorting algorithms.    More ›

This lecture references Videos 30.1-30.5.

In this lecture we end with a preview of what higher-level computer science courses look like. We talk about the concept of sorting, and given an in-depth look at some of the algorithms available.    More ›

This lecture references Lesson 24, 25.

We saw how to handle errors in previous lecture. But now that we have classes, we can do so much more. This is why we are going to revist the topic.    More ›