If you ask yourself these questions as well, and you don’t want to invest time (yet) into learning computer science, here’s the story of my experience. In this article, I’ll answer the following questions:
Why learn computer science? What was my study plan? What resources did I use? Did I learn something useful that can be transferred to my day to day job as a developer?
I began with this fantastic list of resources: teach yourself computer science. It’s basically a guideline on how to study computer science as a software engineer, without spending a lot of money trying to enter MIT. [Read: Are EVs too expensive? Here are 5 common myths, debunked]
So, why learn computer science by yourself?
That’s a simple but important question: why would we do that in the first place? For every project which requires a good amount of motivation, I try first to define proper goals:
Computer science 101: the study plan
I’m not interested in trying to read every book about computer science. It should at least provide me some sense of understanding. That’s why my study plan focused on memory retention, understanding and building a quick reference about what I’ve learned, to be able to come back to it easily. I’m trying to apply some active learning principles by doing as many exercises as I can, and asking myself questions while reviewing my mindmaps. Revisiting what I learned from one week to the next is really, really beneficial to improve my memory retention and my understanding.
What I’ve done so far
Here what I’ve precisely done during these (almost) 100 hours of computer science study, in chronological order.
I. Programming (32 hours 55m)
The article titled “teach yourself computer science” specified that I should follow “roughly” the order of study they propose, beginning by the programming field. Main Resource: Structure and Interpretation of Computer Programs (SICP) This book is considered by many as the bible every developer should read. It’s free and you can find the best epub and PDF versions here. You can find the solutions of the exercises here. I succeeded to do almost all exercises till 1.2.5 Greatest Common Divisors. Complementary Resource: Berkeley Videos The videos are available here. The notes of the course are here. If you search some sample exams from Berkeley, it’s here. These are a very good complement to the book: concepts are explained without asking you too much about Mathematics, in contrast with the book. If you want to study the SICP but your mathematical background is not strong enough, simply follow this course. My notes and exercises are here. What I’ve learned from SICP so far
The beginning of this book is very interesting to really understand the roots of functional programming and recursions. It defines a lot of terms programmers use every day, in a very precise manner. Perfect to be even more precise during technical discussions. The book pushed my analytic and solving problem skills with its exercises.
What can I use in real life? The whole discussion about recursion in the book helped me quite significantly to easily write them. It’s a topic I’ve always struggled a bit with. Now it’s a breeze to go through any problem I want to solve with recursion. What difficulties did I encounter? This book is not for math haters. It was written for MIT students who have already quite some mathematical knowledge. Without this prior knowledge, the exercises can be pretty difficult and frustrating at time. It was the cause of another problem: I spent too much time on the exercises. I could solve most of them but it took me hours in some cases. I decided from there that I would not spend more than 30 minutes on the exercises to keep the frustration low without discarding the huge benefit of doing them.
II. Discrete Mathematics (50 hours)
The more I was reading SICP, the more I found the exercises difficult, especially since it was dealing with some mathematical concepts that I was not aware of. Therefore, I decided to move on and to begin to studying the Mathematics subject. Main resource: Discrete mathematics and its applications Teach yourself computer science advises you to read the lecture notes by László Lovász, freely available here as a ps document. I converted it to PDF here for those who don’t know what a ps document is. I didn’t know either. However, I’ve chosen another main resource of study, apparently more beginner friendly: Discrete Mathematics and its Application by Kenneth H. Rosen. It’s a pretty big book, quite inexpensive in its earlier editions. In 50 hours I was able to finish the first chapter (propositional logic) and achieve 54 exercises. Complementary resource: MIT 6.042J mathematics for computer science, Fall 2010 These videos from MIT are more advanced courses about Discrete Mathematics. Again, they assume that you know quite a bit in Mathematics. Nevertheless, they are very interesting even though I had difficulties to follow them. In the worst case it will at least give you a good glimpse of what Discrete Mathematics is all about. One teacher (Tom Leighton) has better teaching skills than others. However, they all have a very deep knowledge of their respective subjects. What I learned so far
The book taught me the basics of logic, a very good skill to have as a developer. After all, our work is based on proper logic. Propositional logic with quantifiers and rule of inference. Basically it’s the way to write logical statements, verifying that logical statements make sense and proving their truth values. Basics of sets and graph theory, thanks to the videos. It’s very interesting and it’s pretty useful for a lot of things: state machines, networking…
What can I use in real life?
Truth tables can be very useful to sort out complex conditional statements or to refactor them. Recently I could apply DeMorgan laws to improve the readability of some conditional statements. Expressing confusing and short specifications with predicates, conjunctions and disjunctions (the language of propositional logic) can show contradictions and the details missing. It can summarize very succinctly complex specifications precisely. It can be a good bridge between the specs and the code itself.
What difficulties did I encounter?
Understanding how to write a mathematical proof is hard, especially when nobody can’t help you or correct your proof. I still lacked of some basics in Mathematics, especially needed for the videos from MIT.
III. Return to the basics of mathematics (11 hours 15)
After having some other (minor) problems with my Mathematics knowledge in Discrete Mathematics, I decided to come back to the basics. Another important reason which guided my choice: I really enjoyed doing some Mathematics. Without that, I would have not continued to study computer science. Don’t be confused: the Mathematics related to computer science are different from the one you studied (and maybe hated) at school. I would advise you to give it a try. At that point I decided to alternate between studying Discrete Mathematics and the basics of Mathematics.
Main resource: How to learn basic arithmetic fast
This video of 4 hours is really good to refresh a lot of things, from the sums and product through the percentages, exponents, logarithms… It covers a lot of ground very quickly with a lot of exercises. The tips given are very good as well to understand and solve basic problems quickly. You can see on youtube an hour long preview of the video. If you like it, you can buy it on Vimeo. What I learned so far
My mental calculation skills improved very well. If you have difficulties to calculate quickly percentages or even doing simple multiplications without a calculator, this course will help you a lot. Basics to manipulate fractions, exponents, square roots, logarithms and so on.
What can I use in real life?
Being able to calculate mentally is very helpful for a lot of things in real life. Calculating quickly promotions, roughly how expensive a full shopping cart will be… I can apply all this knowledge while studying computer science.
What difficulties did I encounter? After studying the SICP and Discrete Mathematics, it was very relaxing to finally understand everything with a bit of work. I didn’t have many difficulties.
My advice for beginners in computer science
If I could come back to the beginning of this adventure, I would have studied the different subjects in this order:
I. Basics Mathematics II. Discrete Mathematics III. SICP
I would have studied Basics and Discrete Mathematics in parallel and then moved onto the SICP, trying to get the Mathematics knowledge I still missed along the way.
Learning computer science: What’s next?
I will continue to learn the basics of Mathematics and Discrete Mathematics for at least 150 hours:
The little I know about it already helped me quite a bit in my daily developer life. I feel (and read) that it’s a foundation for every other field in computer science. I enjoy studying it! Again, it’s an essential component to stay motivated.
In short: a very good experience, underlying a many of my weaknesses but as well teaching me solid fundamentals I was missing. Keep in mind though: if you expect to be a super wizard programmer by studying computer science, you might be disappointed. Computer science is hard to study. It has strong theoretical sides and even if I already found some use of it in my daily work, it’s not mind-blowing at all. Going through this journey asks for work, patience, and dedication. Having clear goals, a concrete study plan and enjoying the process are mandatory. This article was written by Matthieu Cneude and was originally published on The Valuable Dev, a blog focusing on the important and timeless concepts in software development. You can read the piece here.
