Live data from Hacker News

A Self-Learning, Modern Computer Science Curriculum

functionalcs.github.io

11–20 of 32 posts

Re: A Self-Learning, Modern Computer Science Curriculum

#11
post #2

I've had this site bookmarked for at least a year and have really enjoyed watching the curriculum grow. Now only if I could start on it...

> if I could start on it

A suggestion for getting yourself to spend time on large projects: http://tynan.com/ornothing "Do it or nothing"

Re: A Self-Learning, Modern Computer Science Curriculum

#13
For a couple years, I went the self study route, using online resources coupled with text books. Eventually though, I ended up taking a few distant learning courses and found the accountability (i.e. deadlines, homework assignments, exams) helpful, keeping motivated. And now, I'm taking the online CS master's program from Georgia Tech, the OMSCS program. I'm actually only in my first semester and loving it!

Still, I appreciate and love all the online material (that's free!) but I tend to operate better when I can 1) Collaborate with other students (and professors) 2) Have deadlines

Re: A Self-Learning, Modern Computer Science Curriculum

#14
I don't really see Abstract Algebra as a super relevant topic for modern computer science. I agree on Linear Algebra and basic abstract algebra (like group theory, cyclic groups etc, stuff needed for understanding topics like RSA), but stuff like Galois theory and other advanced topics are just not relevant. They still teach you a different way to think about problems (which is good) but rather belong into a math curriculum than a CS one.

Re: A Self-Learning, Modern Computer Science Curriculum

#16

For a couple years, I went the self study route, using online resources coupled with text books. Eventually though, I ended up taking a few distant learning courses and found the accountability (i.e. deadlines, homework assignments, exams) helpful, keeping motivated. And now, I'm taking the online CS master's program from Georgia Tech, the OMSCS program. I'm actually only in my first semester and loving it! Still, I…

You can get pretty far online only, but the networking opportunities even in a non-top school are worth every penny.

It's interesting finding a new job only to have existing classmates be excited for you to be there. Rumors begin spreading that you get shit done even quicker.

Re: A Self-Learning, Modern Computer Science Curriculum

#17

For a couple years, I went the self study route, using online resources coupled with text books. Eventually though, I ended up taking a few distant learning courses and found the accountability (i.e. deadlines, homework assignments, exams) helpful, keeping motivated. And now, I'm taking the online CS master's program from Georgia Tech, the OMSCS program. I'm actually only in my first semester and loving it! Still, I…

Can you elaborate on your background a bit, please? How did you satisfy the prerequisites of the program without a formal CS degree? I thought about applying myself but other than MOOCs and professional experience, I don't have much to show on a transcript.

Re: A Self-Learning, Modern Computer Science Curriculum

#20
post #14

I don't really see Abstract Algebra as a super relevant topic for modern computer science. I agree on Linear Algebra and basic abstract algebra (like group theory, cyclic groups etc, stuff needed for understanding topics like RSA), but stuff like Galois theory and other advanced topics are just not relevant. They still teach you a different way to think about problems (which is good) but rather belong into a math cur…

Galois (finite) fields are very much relevant in error correction codes and cryptography. Any time you want to manipulate bytes (or words) as numbers which you can add/subtract and multiply/divide you end up learning about finite fields. In fact, doing CRC or even XOR sums you are already making the first step towards the topic.

A recent problem I needed a solution for: given n blocks of data of equal length generate all possible XOR sums of the blocks in-place (no additional memory). The answer is an irreducible polynomial of degree n with a primitive root over GF(2).

Post reply on HN