Skip to main content

Week 2 of Computer Science

"Having spent the last 11 days studying coding and computer science theory I can now claim to be an expert. "

 If only it were that easy.

 I have however, made plenty of progress: coding gets easier every day, the hours fly by as I read, code, debug, search forums, stare blankly, recode, then take a small bow when my program successfully adds 2 integers. I have now written around 20 original programs in Java (original in the sense that I composed them; they don't do anything original).

 The two data science courses on edX (Analytics and Foundations) are relatively straightforward implementations of R (there isn't any programming involved). They provide a good review of intro-level Statistics.

 The Data Science Specialization on Coursera (offered by John Hopkins University) is very challenging, especially the Intro to R Programming. There is a steep learning curve involved in completing the programming assignments. There are 3 parts to assignment 1: I spent Tuesday on Part 1, Thursday on Part 2 and haven't yet completed Part 3.  (For reference, Part 1 comprised 6 short lines of code.) The course is certainly good practice for situations where you might be expected to code in a completely new language with minimal training. A lot of my time is spent hunting in forums and reading help files in an attempt to get rid of those pesky error messages.

 The first course in the Saylor Academy Computer Science pathway took 11 days to complete-I passed the final exam this morning. It took around 30% of the suggested time allotment-I expect future courses will be more challenging.

 I decided not to continue with Computing:Art, Science and & Magic. The presentation was terse, abstract and in the end, opaque. I decided to stick with Java, C and Python for which there are plenty of excellent (and free) resources. It may be a course that I go back to in future after I have internalized the necessary computer science theory.

 I plan to finish the two calculus courses by the end of the month and start a linear algebra course in December.

 One thing that has really impressed me is the camaraderie of  the help forums: there are so many people helping each other out.


Comments

Post a Comment

Popular posts from this blog

Einstein's Logic Puzzle (SPOILER ALERT!)

On Monday I began working through a Discrete Math textbook in preparation for some courses I'll be taking in January. There was a beautiful logic problem in Chapter 1, apparently created by Einstein. This is one version of it: Five men with  different nationalities and with different jobs live in  con secutive houses on a street. These houses are painted  dif ferent colors. The men have different pets and have   dif ferent favorite drinks.  Determine who owns a zebra and  whose favorite drink is mineral water (which is one of the  favorite drinks) given these clues:  The Englishman lives  in the red house.  The Spaniard owns a dog.  The Japanese  man is a painter.  The Italian drinks tea.  The Norwegian  lives in the first house on the left.  The green house is  immediately to the right of the white one. The photogra pher  breeds snails.  The diplomat lives in the yellow house. ...
Post a Comment
Read more

Job as Entry Level Developer

After 4 months of work, sometimes focused, sometimes not, I accepted a job as an Entry Level Ruby on Rails Developer yesterday. This is after starting with zero knowledge on November 1, last year. Beyond knowing a little about coding (but getting the definitions of  REST and AJAX wrong), what were the reasons for the job offer?  I think it was the meetup group I started in January that made me stand out from the rest. The motivation for the meetup group was to help me become a better coder and to indulge my teacher instincts. After some initial meetings at the library and my home, an IT hub in town offered to host us. This meant extra advertising and prestige for the group. After announcing the meetup group at an Agile meetup group for developers, I got some volunteers to give talks. The first volunteer offered a talk on Ruby. As I was comfortable with Ruby I prepared a coding tutorial .  After the tutorial, which was attended by some beginners and some a...
Post a Comment
Read more

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...
Post a Comment
Read more