Skip to main content

Week 4 start

It has been three weeks-what have I learned?

       Sugata Mitra's credo is true- at least when it comes to computer programming. Anyone can learn programming online: there is a plethora of resources. Additionally, programming offers instant feedback-it's unlikely you will 'break' your computer and your program either works or it doesn't.
       Since last week I have discovered the Odin Project, a free online curriculum for web development. (Check out this post for some advice on following the Odin Project.) So far, it has been fantastic; I have a real sense of progress and I am accomplishing something. I am halfway through designing the Google Search page (it's not as easy as it sounds).
   
      Here's an update on the courses I'm working through:

      • Saylor Academy-CS102: Not as well resourced as the first course. I'm having trouble with the C++ compiler, some of the Unit 1 resources are a little opaque, but otherwise I still feel confident about investing my time with Saylor Academy. I've moved on to Unit 2-I'm reading through Introduction to Programming using Java, an excellent, free book.
      • I'm also working through the Harvard course CS50x. If you've already done CS101 from the Saylor Academy (which I recommend), the first couple of weeks will be straightforward. The Java you have learned will be more than adequate to complete the Week0 and 1 problem sets.
      • R-Programming is not a well designed course, but I plan to finish it anyway. I would recommend learning Java, Python or C# on Coursera or CodeAcademy for the programming aspect and Foundations of Data Analysis on edX to learn some R.
      • Also, I've completed Weeks 3 of Inititiation a la programmation en Java, Computer Science 101(Stanford)  and Introduction to Logic. I discovered the Khan Academy Math courses which are well designed and learn from your interaction with them.
Am I closer to securing a job? Not at all- but I've learned a lot and I've finished each day with a sense of accomplishment.


       

Comments

Popular posts from this blog

CodeSchool vs Codecademy(or 'How socket inherits event listening methods and implements asynchronicity')

In this review I'm going to focus on the pedagogy that I see evident in some CodeSchool courses and compare them to  Codecademy. By pedagogy, I mean: 'How does CodeSchool teach?' and ' Does it do a good job of teaching?'. I'm going to argue that despite high quality videos, colourful web pages, and often ssspppeeeeeakkkiiiing...rrrreeally...slowly..., CodeSchool's pedagogy is inferior to that of Codecademy. There are many fantastic resources for learning to code on the web, and CodeSchool is one of them. So far I have completed courses in Ruby, Rails, Javascript, HTML/CSS, Jquery and Git on CodeSchool. The courses have all included high quality videos and colourful, interactive exercises- as well as  massive  pdf files of the slides ( the files take more than a minute to load on my machine .) The question is: does the higher production value mean better educational quality? The 'Try' courses on CodeSchool(such as Try Ruby and Try jQuery) are f...

Algorithm Analysis - 1

Currently, I'm learning to perform algorithm analysis using Big-O notation. In one resource I found the following problem: You just dropped a box of glass toys and  n  toys in the box broke in half. You'd like to match the halves of the toys so that you could glue them together, but the only way to tell whether two halves belonged to one toy is to physically pick up the two pieces and try to fit them together. Express how long this matching process will take in terms of  n . The answer given is n^2 (n squared) with the following explanation:  You have to compare every piece with every other piece. If you have 1 toy and it breaks in half, you have 1 comparison to make. If you have 2 toys and they both break in half there are 4 pieces and you have to do 6 comparisons. If you have 3 toys, there are 6 pieces and you have to do 15 comparisons. If you have  N/2  toys, you have  N  pieces and you have to do N-1 + N-2 + N-3 + ... + 1 =(N)(N-1)/2...

Ruby, RSpec, Linux and Relational Algebra (or "What I'm doing this Christmas")

Last week was challenging- I'm beginning to appreciate the need for a programming buddy.  So far, I haven't found a Ruby IDE that helps with missing brackets or illegal syntax. This means hours spent looking for errors which more experience (or an IDE) would have solved in an instant. I've spent a lot of time on Stack Exchange looking for solutions to problems that many have already had- so far I haven't had to post a single new question (though it's evident that many people post duplicate questions, not having looked for a solution first). I spent longer on the Ruby project than anticipated, BUT I really enjoyed learning about Behaviour Driven Development. Thinking of tests in RSpec and then watching my Ruby script pass (eventually) was like passing an exam (though  one I had written myself). This week I'll be starting Rails-after I complete the CodeSchool Rails courses I'll go on to their RSpec course. Partly for the geek cred, partly out of curiosit...