(Sorry that my titles are getting repetitive. It's hard to be creative in this regard.)
Yesterday turned out to be a very productive day. As I noted in my previous entry, I had watched a lot of lectures from the algorithms class and completed the 2nd problem set. I also finished lecture 4 of Linear Algebra and before I went to sleep, I powered through the first problem set of the class. I was somewhat lazy on the problem set and didn't exactly nail all of the questions, but I was able to at least feel like I understand the material at some level. (It's still not my cup of tea, that's for sure). After waking up today, I got through unit 5 of the udacity 101 class (which mostly dealt with hash tables), and I'm now on unit 6, which seems to focus on recursion - my old nemesis. Although judging from the difficulty level of the class so far, I don't think it's going to challenge me as much as, say, the dynamic programming assignment from MIT 6.00 did (I think the stress of that problem set probably aged me a year or two - shiver).
Progress:
Introduction to Computer Science: 19 lectures, 10 problem sets
Programming Abstractions: 5 lectures, 1 problem set
Algorithms: 6.5 lecture sections, 2 problem sets
Linear Algebra: 4 lectures, 1 problem set
Udacity 101: 5+ units
Discrete Math: 1 lecture
My rough plan for the day is to try to finish or at least make significant headway on unit 6 of the udacity class, to play around a bit in C++ (perhaps do some preliminary work on a FreeCell implementation), and to watch another lecture from the discrete math class. If I have time, maybe I can squeeze in another Linear Algebra lecture.
No comments:
Post a Comment