Previous Announcements


Just a few weeks left now...!

We still have a few activities left in what remains of our time together. It all begins with the Binary Search Tree this week.

I'm sure you're going to enjoy it! ;)

I'll see you in class...


Sorting, Searching → Graphs & Trees

We've had some time to play around with Sorting and Searching, and we've made some initial forays into the Elevator project, supported (we hope) by the use of git and soon, GitHub.

The really big news, however, is that we're just about to enter the final unit of this course, on Trees and Graphs. We're going to put together all the concepts that we've been developing to this point and apply them to a number of really interesting types of problems.

*This* is the unit you've been waiting for (whether you knew it or not)! I'm looking forward to getting started on it with you this week.

I'll see you in class...


Happy Spring Break!

I hope you're enjoying your time off this week. I know I am...!

When we get back at the beginning of April we're going to be introducing new topics, and a new way of working with your files: version control!

It's going to change your life... Can't wait to share it with you!

See you in class...


Implementing Lists and Stacks

Now that we've figured out our Nodes and Unsorted Lists, let's see if we can't take things one step deeper: can we make a Stack using our UnorderedList class? And what does an OrderedList look like?

Once we've played around with these ideas a little bit we'll be ready to take a more serious look at the various sorting and searching algorithms. This unit includes a major assignment for you: a research paper! :)

I just love research papers! I'm sure you're going to enjoy it.

See you in class...


Stacks and Queues and Deques, oh my!

We've taken a quick look at recursion and some of the interesting things you can accomplish there... and we'll continue to use recursion throughout the rest of the semester.

This week we're going to introduce some new abstract data structures (ADTs) that you haven't seen before, including the Stack, the Queue, and the Deque. You'll be implementing these structures in Python, and looking at a few of the different ways that they can be used to solve various algorithmic problems.

It's going to be a lot of fun, and I'm sure you're going to enjoy it!

I'll see you in class...

See previous announcements.


Happy Valentine's Day!

Today, we officially move on to the curriculum for our course.

At last!

You may still be putting the finishing touches on your Wardrobe project, and that's fine. We're going to be writing classes for this course for the rest of the year, so you're going to become very familiar with that process soon.

I'll see you in class...


Crash Course, part 2

Congratulations on flying through the first two weeks of our course! We've had a chance to review some of the fundamental control structures and data structures in Python.

In the next two weeks we'll conclude our "Python crash course" with a brief look at dictionaries and then an intense study of object-oriented programming in Python. We'll be using OOP structures throughout this entire class so it will be worth our time to make sure you have a solid understanding of those ideas.

Here we go...!

I'll see you in class...


Welcome to Advanced Topics!

I am so excited to be working with you in here! This class is a challenging, fast-paced introduction to some of the more interesting topics that we didn't get a chance to cover in your introductory class.

This is not an easy course—we'll be dealing with some abstract topics that take a little getting used to—but if you're into the idea of digging deep into algorithms, this is the place!

If you've found this website, then you're probably taking the class. Take a few moments to look around. Look at the schedule, look at our assignments for the first week, and get Miniconda installed on your machine (if it isn't there already). The sooner you complete the review assignment, the sooner we can get down to The Business.

See you soon!