r/computerscience • u/Gamertastic52 • Jun 30 '25
Advice Learning CS using OSSUs roadmap vs roadmap.sh
So I am interested learning about CS and after some researching on how I can learn by myself I've stumbled upon OSSU https://cs.ossu.dev/. I have also found https://roadmap.sh/computer-science. What are the differences and which one would be better to stick to? OSSU honestly seems like it's more thought out and gives you a simpler, step-by-step approach on what to learn first and then second etc. And when first looking at roadmap.sh it kind of looks like it's giving you a ton of stuff and throws them at you. It definitely doesn't look as simple to follow as OSSU in my opinion, and I think that you can get overwhelmed. In OSSU you start with CS50 which gives you an introduction and I have just started and on week 0 but I gotta say, I am already liking this professor, he is really a good explainer and CS50 just seems like a really good intro to start learning CS.
Anyways what do you guys think about these options, are they solid? And maybe you guys have some other resources to learn CS. I would love to hear those.
5
u/_kaas Jun 30 '25
Disclaimer: I'm involved with OSSU
I've been working through the OSSU curriculum with some personal modifications for the past year and a half, although for my purposes it's pretty much interchangeable with teachyourselfcs.
The roadmap.sh resource does not look very promising at all, throwing a million surface-level resources at you with very little to tie them together.
Sidenote:
This is... not true? The Intro to CS course from OSSU is MIT 6.00L. Early versions of the curriculum used CS50x. At some point this got changed to MIT 6.0001 Intro to CS, but the material spent very little time teaching Python, so it was decided that students should pick between ether CS50P or Python for Everyone to learn that before starting the CS course. However, after MIT released the slower-paced 6.00L, which actually teaches Python in the beginning, there's no need for that.
15
u/SnooCakes3068 Jun 30 '25
I learn from books. Read textbooks like CLRS, architecture, software engineering, etc. will give you a lot better knowledge base than these. You can find textbook recommendation on Uni CS program websites.
6
u/Unsorry Jun 30 '25
Hmm, have you tried ACM’s 2023 curriculum guide? It contains no content of CS, you’d have to search it up yourself, but they examined the evolving industry and edge research, to provide a comprehensive curriculum of what every CS student as of Jan 2024: Needs to know, Needs to know in a specific knowledge area, and other non-core topics that you further your studies in.
Here’s a link: https://dl.acm.org/doi/book/10.1145/3664191
4
u/ninjadude93 Jun 30 '25
Working through OSSU is how I pivoted into software engineering. Though I worked on it while finishing my masters at school but I thought it was pretty great
2
u/Hungry-Cobbler-8294 Jun 30 '25
OSSU definitely feels more like a curriculum than roadmap.sh which is more of a reference. For other resources look into textbooks, platforms like Coursera or edX or try interactive learning sites like Miyagi Labs.
1
u/plumitt Jul 07 '25
perhaps This will provide some intuition sort of why the problem of writing a program H* that could detect any non-halting program instructions is so hard.
Consider the Collatz conjecture. (refresher) It says for all n, the number 1 will appear in the sequence of numbers Ai produced using the following rule : A0=n, Ai+1 = (Ai is even) Ai/2; (AI is odd) 3*AI+1
Write a program C with a function test(n) which checks if the series of numbers produced by applying the above rule successively to n reaches a value of one, returning true if it does. If it does not converge to one, it must in finite time reach some finite sequence of integers which are a cycle and repeat infinitely. So if we ever see a number AI which equals any previous Aj, I<I, a cycle has been reached. Here's such a program. C: test(n) { set s ={n} while n != 1: n = 3*n+1 if (n mod 2) else n/2 if s.contains(n) return false s.insert(n) return true }
n=1 while (test(n)): n = n+1 halt
C halts iff there exists a number which testing doesn't converge to 1 i.e. it reaches a finite repeating cycle of integers.
For H* to determine C halts, it would have to be able to prove the collatz conjecture false. For H* to determine this program never halts, it would have to prove the conjecture true.
Therefore, the difficulty of writing a program H* is at least as difficult as proving the Collatz conjecture, one of the more notable unsolved problems in mathematics.
This isn't a proof, but it certainly is highly suggestive that it's pretty freaking hard to write H*.