(CS)计算机科学SlefLearning建议
SlefLearningComputerScience
My 10-step self-taught CS curriculum - any recommendations?
![]()
UPDATE: Thank you all for your feedback! Any future edits will be applied to the updated list in another post: Link to the updated list
Hi, everyone!
I’ve had a great passion for computer science and coding since high school, but I chose medicine eventually and I’ve recently graduated as a physician.
Due to some changes in my situation, I’m gonna have a few hours of free time each day for the next 2 or 3 years. I decided to use this opportunity and learn CS as my serious “hobby”; both to improve my creativity and problem-solving skills and to create something out of my “medical software/website” ideas that come to my mind every once in a while. My goal is not getting a job as a software engineer, I just love CS per se and simply enjoy learning it! To this end, I made my personal curriculum, but I’m not 100% confident if that’s the ideal study plan to learn CS.
Each step has one “recommended course” (often the one recommended by this great guide: Teach Yourself Computer Science), but given my non-technical background, I think it would be difficult for me to dive right into those courses, so I have gathered a few “intermediate” courses for each step as some sort of introduction/backup to take before/instead of the recommended course.
Math is a special subject for me. After 7+ years of studying medicine, it’s inevitable to forget most of the math I had learned back in high-school. So I need a deep and comprehensive review. I will be (re-)studying high-school math (3.1, 3.2, and 3.3 in the list below) along with the first 3 steps of the curriculum and before getting to the actual “Step 3”.
Step 0: “Coding”
- 0.0 Harvard’s CS50x: Introduction to Computer Science
- 0.1 MIT 6.0001: Introduction to CS and Programming in Python - OCW
- 0.2 MIT 6.0002: Introduction to Computational Thinking and Data Science - OCW
- 0.3 (Maybe!) The Missing Semester of Your CS Education - MIT CSAIL
- 0.4 (Also maybe!) CS50’s Web Programming with Python and JavaScript
I know there are lots of alternatives for learning web development, but I like the way this guy teaches. Alternatives (just in case): W3Schools Online Web Tutorials, freeCodeCamp and its Youtube tutorials for HTML, CSS, and JavaScript, and so on…
- Book: Automate the Boring Stuff with Python
- Practice (a lot!): Codewars
Step 1: “Programming”
- 1.1 University of Washington’s CSE341: Programming Languages (Also available on Coursera)
- 1.2 [Recommended Course] Berkeley CS 61A: Structure and Interpretation of Computer Programs
- 1.3 Stanford’s CS106B: Programming Abstractions (Mainly to learn C++)
- 1.4 Stanford’s CS107: Programming Paradigms
- Recommended Book: Composing Programs
Step 2: Computer Architecture/Systems
- 2.1 Nand2Tetris Part 1 and Part 2 - Coursera
- 2.2 [Recommended Course] CMU’s 15-213: Introduction to Computer Systems
- 2.3 MIT 6.004: Computation Structures - OCW (Not sure about this one!)
- Recommended Book: Computer Systems: A Programmer’s Perspective, 3rd Edition
Step 3: Mathematics
- 3.1 High school math - Khan Academy
- 3.2 AP®︎ Calculus BC - also Khan Academy
- 3.3 Essence of calculus - 3Blue1Brown’s Youtube playlist
Time for serious stuff! I’m not really sure about the order/content or even if by taking previous courses I’m ready to take the next ones:
- 3.4 MIT 18.01: Calculus I - OCW
- 3.5 Introduction to Discrete Mathematics for Computer Science - Coursera specialization by UC San Diego
- 3.6 MIT 18.02: Calculus II - OCW
- 3.7 [Recommended Course] MIT 6.042J: Mathematics for Computer Science - OCW
I don’t know whether I “have to” take the following courses or I’ll be OK moving on without learning these topics. Of course, I can take them later on if necessary.
- 3.8 Essence of linear algebra - 3Blue1Brown’s Youtube playlist
- 3.9 MIT 18.06: Linear Algebra - OCW
- 3.10 Set Theory - Eddie Woo’s Youtube playlist
- 3.11 Introduction to Logic - Coursera (Stanford)
- 3.12 Analytic Combinatorics - Coursera (Princeton)
Step 4: Algorithms & Data Structures
- 4.1 Algorithms - Coursera specialization by Stanford OR
- 4.1 Data Structures and Algorithms - Coursera specialization by UC San Diego (Not sure about this one!)
- 4.2 MIT 6.006: Introduction to Algorithms - OCW
- 4.3 [Recommended Course] SBU CSE 373: Analysis of Algorithms
- 4.4 MIT 6.046J: Design and Analysis of Algorithms - OCW
- 4.5 Harvard’s CS 224: Advanced Algorithms
- Recommended Book: The Algorithm Design Manual
- Practice: LeetCode
Step 5: Operating Systems
- 5.1 [Recommended Course] UC Berkeley’s CS 162: Operating Systems and Systems Programming
- Recommended Book: Operating Systems: Three Easy Pieces
Step 6: Computer Networking [I couldn’t find a high-quality resource for this step, any input would be appreciated!]
- 6.1 [Recommended Course] Stanford’s CS144: Introduction to Computer Networking - Youtube playlist
- Recommended Book: Computer Networking: a Top Down Approach
Step 7: Databases
- 7.1 [Recommended Course] Berkeley CS 186: Introduction to Database Systems - Youtube channel
- 7.2 Georgia Tech’s CS 6400: Database Systems Concepts and Design
- Recommended Book: Architecture of a Database System (link to PDF file)
- Recommended Readings: Readings in Database Systems - the “Redbook”
Step 8: Languages & Compilers
- 8.1 [Recommended Course] Stanford’s CS 143: Compilers
- 8.2 Georgia Tech’s CS 8803 O08: Compilers - Theory and Practice
- Recommended Book: Crafting Interpreters
Step 9: Distributed Systems
- 9.1 MIT 6.033: Computer System Engineering - OCW
- 9.2 [Recommended Course] MIT 6.824: Distributed Systems - MIT CSAIL
- Recommended Book: Designing Data-Intensive Applications - Pirated PDF can be found online :|
- Recommended Papers: Distributed Systems Reading Group
Thanks for reading… Any suggestions and recommendations on the selection or the order/priority of these resources and steps would be much appreciated!
PS: Sorry for my poor English!
Update
My (5+5)-step self-taught CS curriculum [Updated]
![]()
UPDATE - README FIRST! This is by no means a “one size fits all” curriculum, nor am I an evil creature trying to misguide those new in this field! This is my PERSONAL roadmap that I will use, adapted to reflect my background, situation, and preferences. The main reason I posted this list and the original one is simply to get feedback and guidance from all of you, fantastic people! If anyone wants to change and use this list as their own study plan, feel free to do so. But remember there’s a huge amount of such curated lists all over the internet (which I used myself to create this personal one!), as many have mentioned in the comments.
I recently posted a list of resources I’m going to use as a self-taught CS “curriculum” and got some fantastic feedback! Thank you all for your kind and thoughtful suggestions! Here is the updated list based on the feedback you provided. Any future updates will be applied here.
A little bit of clarification (apparently needed!): I am a young physician and at the same time a big fan of CS since I was in high-school! I don’t want to learn computer science or programming just to get a job, I already have one :) Also I don’t care if it takes a few years to complete even the first 5 steps.
To read my full explanation and see the old list, please check out my original post.
[I’ll study high-school math during steps 0 and 1, but to keep it simple, I’ve put it under step 2.]
Step 0: “Coding”
- 0.00 Harvard CS50x: Introduction to Computer Science
- 0.01 MIT 6.0001: Introduction to CS and Programming in Python - OCW
- Book: Automate the Boring Stuff with Python
- Practice (a lot!): Codewars and Project-Based Learning
The following courses are optional for me:
- 0.02 The Missing Semester of Your CS Education - MIT CSAIL
- 0.03 CS50x Web Programming with Python and JavaScript
- 0.04 Full stack open - University of Helsinki
Step 1: “Programming”
- 1.01 MIT 6.0002: Introduction to Computational Thinking and Data Science - OCW
- 1.02 Berkeley CS 61A: Structure and Interpretation of Computer Programs
- Book: Composing Programs
Optional:
Step 2: Mathematics
- 2.01 High school math - Khan Academy
- 2.02 Set Theory - Eddie Woo’s Youtube playlist
- 2.03 Introduction to Mathematical Thinking - Coursera (Stanford)
- 2.04 AP Calculus BC - Khan Academy
- 2.05 MIT 6.042J: Mathematics for Computer Science - OLL
Additional, non-required courses (just in case, because I like math!):
- 2.06 Introduction to Logic - Coursera (Stanford)
- 2.07 Essence of calculus - 3Blue1Brown’s Youtube playlist
- 2.08 Essence of linear algebra - 3Blue1Brown’s Youtube playlist
- 2.09 Analytic Combinatorics - Coursera (Princeton)
- 2.10 MIT 18.01: Calculus I - OCW
- 2.11 MIT 18.02: Calculus II - OCW
- 2.12 MIT 18.03: Differential Equations - OCW
- 2.13 MIT 18.06: Linear Algebra - OLL
- 2.14 MIT 6.036: Introduction to Machine Learning - OLL
Step 3: Algorithms & Data Structures
- 3.01 Algorithms - Coursera specialization by Stanford OR
- 3.01 MIT 6.006: Introduction to Algorithms - OCW
- 3.02 MIT 6.046J: Design and Analysis of Algorithms - OCW
- Book: The Algorithm Design Manual
- Practice: Techie Delight
Advanced (optional):
Step 4: Computer Architecture/Systems
- 4.01 Nand2Tetris Part 1 and Part 2 - Coursera
- 4.02 CMU 15-213: Introduction to Computer Systems
- Book: Computer Systems: A Programmer’s Perspective
Note: The following 5 steps are optional and not as “required” as the previous ones.
Extra Step 1: Operating Systems
- 5.01 UC Berkeley CS 162: Operating Systems and Systems Programming
- Book: Operating Systems: Three Easy Pieces
Even more advanced (optional):
- 5.02 Georgia Tech CS 6200: Introduction to Operating Systems
- 5.03 Georgia Tech CS 6210: Advanced Operating Systems
Extra Step 2: Computer Networking
- 6.01 Stanford CS144: Introduction to Computer Networking - Youtube playlist
- Book: Computer Networking: a Top Down Approach
Extra Step 3: Databases
- 7.01 Berkeley CS 186: Introduction to Database Systems - Youtube channel
- 7.02 Georgia Tech CS 6400: Database Systems Concepts and Design
- Book: Architecture of a Database System (Link to PDF file)
- Readings: Readings in Database Systems - the “Redbook”
Extra Step 4: Languages & Compilers
- 8.01 Stanford CS 143: Compilers
- Book: Crafting Interpreters
Next-level:
Extra Step 5: Distributed Systems
- 9.01 MIT 6.033: Computer System Engineering - OCW
- 9.02 MIT 6.172: Performance Engineering of Software Systems - OCW
- 9.03 MIT 6.824: Distributed Systems - MIT CSAIL
- Book: Designing Data-Intensive Applications (Link to Amazon)
- Papers: Distributed Systems Reading Group
That’s it! Again, any feedback would be appreciated!
CS - OSSU [Github] Other
https://github.com/ossu/computer-science

Contents
Summary
The OSSU curriculum is a complete education in computer science using online materials.
It’s not merely for career training or professional development.
It’s for those who want a proper, well-rounded grounding in concepts fundamental to all computing disciplines,
and for those who have the discipline, will, and (most importantly!) good habits to obtain this education largely on their own,
but with support from a worldwide community of fellow learners.
It is designed according to the degree requirements of undergraduate computer science majors, minus general education (non-CS) requirements,
as it is assumed most of the people following this curriculum are already educated outside the field of CS.
The courses themselves are among the very best in the world, often coming from Harvard, Princeton, MIT, etc.,
but specifically chosen to meet the following criteria.
Courses must:
- Be open for enrollment
- Run regularly (ideally in self-paced format, otherwise running multiple times per year)
- Be of generally high quality in teaching materials and pedagogical principles
- Match the curricular standards of the CS 2013: Curriculum Guidelines for Undergraduate Degree Programs in Computer Science
When no course meets the above criteria, the coursework is supplemented with a book.
When there are courses or books that don’t fit into the curriculum but are otherwise of high quality,
they belong in extras/courses or extras/readings.
Organization. The curriculum is designed as follows:
- Intro CS: for students to try out CS and see if it’s right for them
- Core CS: corresponds roughly to the first three years of a computer science curriculum, taking classes that all majors would be required to take
- Advanced CS: corresponds roughly to the final year of a computer science curriculum, taking electives according to the student’s interests
- Final Project: a project for students to validate, consolidate, and display their knowledge, to be evaluated by their peers worldwide
Duration. It is possible to finish within about 2 years if you plan carefully and devote roughly 20 hours/week to your studies. Learners can use this spread
to estimate their end date. Make a copy and input your start date and expected hours per week in the Timeline sheet. As you work through courses you can enter your actual course completion dates in the Curriculum Data sheet and get updated completion estimates.
Cost. All or nearly all course material is available for free. However, some courses may charge money for assignments/tests/projects to be graded.
Note that both Coursera and edX offer financial aid.
Decide how much or how little to spend based on your own time and budget;
just remember that you can’t purchase success!
Process. Students can work through the curriculum alone or in groups, in order or out of order.
- We recommend doing all courses in Core CS, only skipping a course when you are certain that you’ve already learned the material previously.
- For simplicity, we recommend working through courses (especially Core CS) in order from top to bottom, as they have already been topologically sorted by their prerequisites.
- Courses in Advanced CS are electives. Choose one subject (e.g. Advanced programming) you want to become an expert in and take all the courses under that heading. You can also create your own custom subject, but we recommend getting validation from the community on the subject you choose.
Content policy. If you plan on showing off some of your coursework publicly, you must share only files that you are allowed to.
Do NOT disrespect the code of conduct that you signed in the beginning of each course!
Getting help (Details about our FAQ and chatroom)
Community
- We have a discord server!
This should be your first stop to talk with other OSSU students. Why don’t you introduce yourself right now? Join the OSSU Discord
- You can also interact through GitHub issues. If there is a problem with a course, or a change needs to be made to the curriculum, this is the place to start the conversation. Read more here.
- Subscribe to our newsletter.
- Add Open Source Society University to your Linkedin profile!
- Note: There is an unmaintained and deprecated firebase app that you might find when searching OSSU. You can safely ignore it. Read more in the FAQ.
Curriculum
Curriculum version: 8.0.0 (see CHANGELOG)
Prerequisites
- Core CS assumes the student has already taken high school math, including algebra, geometry, and pre-calculus.
- Advanced CS assumes the student has already taken the entirety of Core CS
and is knowledgeable enough now to decide which electives to take. - Note that Advanced systems assumes the student has taken a basic physics course (e.g. AP Physics in high school).
Intro CS
Introduction to Programming
If you’ve never written a for-loop, or don’t know what a string is in programming, start here. This course is self-paced, allowing you to adjust the number of hours you spend per week to meet your needs.
Topics covered:simple programssimple data structures
| Courses | Duration | Effort | Prerequisites | Discussion |
|---|---|---|---|---|
| Python for Everybody | 10 weeks | 10 hours/week | none | chat |
Introduction to Computer Science
This course will introduce you to the world of computer science. Students who have been introduced to programming, either from the courses above or through study elsewhere, should take this course for a flavor of the material to come. If you finish the course wanting more, Computer Science is likely for you!
Topics covered:computationimperative programmingbasic data structures and algorithmsand more
| Courses | Duration | Effort | Prerequisites | Discussion |
|---|---|---|---|---|
| Introduction to Computer Science and Programming using Python (alt) | 9 weeks | 15 hours/week | high school algebra | chat |
Core CS
All coursework under Core CS is required, unless otherwise indicated.
Core programming
Topics covered:functional programmingdesign for testingprogram requirementscommon design patternsunit testingobject-oriented designstatic typingdynamic typingML-family languages (via Standard ML)Lisp-family languages (via Racket)Rubyand more
The How to Code courses are based on the textbook How to Design Programs. The First Edition is available for free online and includes problem sets and solutions. Students are encouraged to do these assignments.
| Courses | Duration | Effort | Prerequisites | Discussion |
|---|---|---|---|---|
| How to Code - Simple Data | 7 weeks | 8-10 hours/week | none | chat |
| How to Code - Complex Data | 6 weeks | 8-10 hours/week | How to Code: Simple Data | chat |
| Programming Languages, Part A | 5 weeks | 4-8 hours/week | How to Code (Hear instructor) | chat |
| Programming Languages, Part B | 3 weeks | 4-8 hours/week | Programming Languages, Part A | chat |
| Programming Languages, Part C | 3 weeks | 4-8 hours/week | Programming Languages, Part B | chat |
Core Math
In addition to their math elective, students must complete the following course on discrete mathematics.
Topics covered:discrete mathematicsmathematical proofsbasic statisticsO-notationdiscrete probabilityand more
| Courses | Duration | Effort | Notes | Prerequisites | Discussion |
|---|---|---|---|---|---|
| Calculus 1A: Differentiation (alt) | 13 weeks | 6-10 hours/week | The alternate covers this and the following 2 courses | high school math | chat |
| Calculus 1B: Integration | 13 weeks | 5-10 hours/week | - | Calculus 1A | chat |
| Calculus 1C: Coordinate Systems & Infinite Series | 6 weeks | 5-10 hours/week | - | Calculus 1B | chat |
| Mathematics for Computer Science (alt) | 13 weeks | 5 hours/week | An alternate version with solutions to the problem sets is here. Students struggling can consider the Discrete Mathematics Specialization first. It is more interactive but less comprehensive, and costs money to unlock full interactivity. | Calculus 1C | chat |
CS Tools
Understanding theory is important, but you will also be expected to create programs. There are a number of tools that are widely used to make that process easier. Learn them now to ease your future work writing programs.
Topics covered:terminals and shell scriptingvimcommand line environmentsversion controland more
| Courses | Duration | Effort | Prerequisites | Discussion |
|---|---|---|---|---|
| The Missing Semester of Your CS Education | 2 weeks | 12 hours/week | - | chat |
Core systems
Topics covered:procedural programmingmanual memory managementboolean algebragate logicmemorycomputer architectureassemblymachine languagevirtual machineshigh-level languagescompilersoperating systemsnetwork protocolsand more
| Courses | Duration | Effort | Additional Text / Assignments | Prerequisites | Discussion |
|---|---|---|---|---|---|
| Build a Modern Computer from First Principles: From Nand to Tetris (alt) | 6 weeks | 7-13 hours/week | - | C-like programming language | chat |
| Build a Modern Computer from First Principles: Nand to Tetris Part II | 6 weeks | 12-18 hours/week | - | one of these programming languages, From Nand to Tetris Part I | chat |
| Operating Systems: Three Easy Pieces | 10-12 weeks | 6-10 hours/week | - | algorithms, familiarity with C is useful | chat |
| Computer Networking: a Top-Down Approach | 8 weeks | 4–12 hours/week | Wireshark Labs | algebra, probability, basic CS | chat |
Core theory
Topics covered:divide and conquersorting and searchingrandomized algorithmsgraph searchshortest pathsdata structuresgreedy algorithmsminimum spanning treesdynamic programmingNP-completenessand more
| Courses | Duration | Effort | Prerequisites | Discussion |
|---|---|---|---|---|
| Divide and Conquer, Sorting and Searching, and Randomized Algorithms | 4 weeks | 4-8 hours/week | any programming language, Mathematics for Computer Science | chat |
| Graph Search, Shortest Paths, and Data Structures | 4 weeks | 4-8 hours/week | Divide and Conquer, Sorting and Searching, and Randomized Algorithms | chat |
| Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming | 4 weeks | 4-8 hours/week | Graph Search, Shortest Paths, and Data Structures | chat |
| Shortest Paths Revisited, NP-Complete Problems and What To Do About Them | 4 weeks | 4-8 hours/week | Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming | chat |
Core Security
Topics coveredConfidentiality, Integrity, AvailabilitySecure DesignDefensive ProgrammingThreats and AttacksNetwork SecurityCryptographyand more
Note: These courses are provisionally recommended. There is an open Request For Comment on security course selection. Contributors are encouraged to compare the various courses in the RFC and offer feedback.
| Courses | Duration | Effort | Prerequisites | Discussion |
|---|---|---|---|---|
| Information Security: Context and Introduction | 5 weeks | 3 hours/week | - | chat |
| Principles of Secure Coding | 4 weeks | 4 hours/week | - | chat |
| Identifying Security Vulnerabilities | 4 weeks | 4 hours/week | - | chat |
Choose one of the following:
Courses | Duration | Effort | Prerequisites | Discussion
:– | :–: | :–: | :–: | :–:
Identifying Security Vulnerabilities in C/C++Programming | 4 weeks | 5 hours/week | - | chat
Exploiting and Securing Vulnerabilities in Java Applications | 4 weeks | 5 hours/week | - | chat
Core applications
Topics covered:Agile methodologyRESTsoftware specificationsrefactoringrelational databasestransaction processingdata modelingneural networkssupervised learningunsupervised learningOpenGLraytracingand more
| Courses | Duration | Effort | Prerequisites | Discussion |
|---|---|---|---|---|
| Databases: Modeling and Theory | 2 weeks | 10 hours/week | core programming | chat |
| Databases: Relational Databases and SQL | 2 weeks | 10 hours/week | core programming | chat |
| Databases: Semistructured Data | 2 weeks | 10 hours/week | core programming | chat |
| Machine Learning | 11 weeks | 4-6 hours/week | linear algebra | chat |
| Computer Graphics | 6 weeks | 12 hours/week | C++ or Java, linear algebra | chat |
| Software Engineering: Introduction | 6 weeks | 8-10 hours/week | Core Programming, and a sizable project | chat |
| Software Development Capstone Project | 6-7 weeks | 8-10 hours/week | Software Engineering: Introduction | chat |
Advanced CS
After completing every required course in Core CS, students should choose a subset of courses from Advanced CS based on interest.
Not every course from a subcategory needs to be taken.
But students should take every course that is relevant to the field they intend to go into.
Advanced programming
Topics covered:debugging theory and practicegoal-oriented programmingparallel computingobject-oriented analysis and designUMLlarge-scale software architecture and designand more
| Courses | Duration | Effort | Prerequisites |
|---|---|---|---|
| Parallel Programming | 4 weeks | 6-8 hours/week | Scala programming |
| Compilers | 9 weeks | 6-8 hours/week | none |
| Introduction to Haskell | 14 weeks | - | - |
| Learn Prolog Now! (alt)* | 12 weeks | - | - |
| Software Debugging | 8 weeks | 6 hours/week | Python, object-oriented programming |
| Software Testing | 4 weeks | 6 hours/week | Python, programming experience |
| Software Architecture & Design | 8 weeks | 6 hours/week | software engineering in Java |
(*) book by Blackburn, Bos, Striegnitz (compiled from source, redistributed under CC license)
Advanced systems
Topics covered:digital signalingcombinational logicCMOS technologiessequential logicfinite state machinesprocessor instruction setscachespipeliningvirtualizationparallel processingvirtual memorysynchronization primitivessystem call interfaceand more
| Courses | Duration | Effort | Prerequisites |
|---|---|---|---|
| Computation Structures 1: Digital Circuits | 10 weeks | 6 hours/week | Nand2Tetris II |
| Computation Structures 2: Computer Architecture | 10 weeks | 6 hours/week | Computation Structures 1 |
| Computation Structures 3: Computer Organization | 10 weeks | 6 hours/week | Computation Structures 2 |
Advanced theory
Topics covered:formal languagesTuring machinescomputabilityevent-driven concurrencyautomatadistributed shared memoryconsensus algorithmsstate machine replicationcomputational geometry theorypropositional logicrelational logicHerbrand logicgame treesand more
| Courses | Duration | Effort | Prerequisites |
|---|---|---|---|
| Theory of Computation (Lectures) | 8 weeks | 10 hours/week | discrete mathematics, logic, algorithms |
| Computational Geometry | 16 weeks | 8 hours/week | algorithms, C++ |
| Game Theory | 8 weeks | 3 hours/week | mathematical thinking, probability, calculus |
Advanced math
| Courses | Duration | Effort | Prerequisites | Discussion |
|---|---|---|---|---|
| Essence of Linear Algebra | - | - | high school math | chat |
| Linear Algebra | 14 weeks | 12 hours/week | Essence of Linear Algebra | chat |
| Introduction to Logic | 10 weeks | 4-8 hours/week | set theory | chat |
| Probability | 24 weeks | 12 hours/week | Differentiation and Integration | chat |
Final project
OSS University is project-focused.
The assignments and exams for each course are to prepare you to use your knowledge to solve real-world problems.
After you’ve gotten through all of Core CS and the parts of Advanced CS relevant to you, you should think about a problem that you can solve using the knowledge you’ve acquired.
Not only does real project work look great on a resume, but the project will also validate and consolidate your knowledge.
You can create something entirely new, or you can find an existing project that needs help via websites like
CodeTriage
or
First Timers Only.
Students who would like more guidance in creating a project may choose to use a series of project oriented courses. Here is a sample of options (many more are available, at this point you should be capable of identifying a series that is interesting and relevant to you):
Courses | Duration | Effort | Prerequisites
:– | :–: | :–: | :–:
Fullstack Open | 12 weeks | 6 hours/week | programming
Modern Robotics (Specialization) | 26 weeks | 2-5 hours/week | freshman-level physics, linear algebra, calculus, linear ordinary differential equations
Data Mining (Specialization) | 30 weeks | 2-5 hours/week | machine learning
Big Data (Specialization) | 30 weeks | 3-5 hours/week | none
Internet of Things (Specialization) | 30 weeks | 1-5 hours/week | strong programming
Cloud Computing (Specialization) | 30 weeks | 2-6 hours/week | C++ programming
Data Science (Specialization) | 43 weeks | 1-6 hours/week | none
Functional Programming in Scala (Specialization) | 29 weeks | 4-5 hours/week | One year programming experience
Game Design and Development with Unity 2020 (Specialization) | 6 months | 5 hours/week | programming, interactive design
Evaluation
Upon completing your final project:
Submit your project’s information to PROJECTS via a pull request.
Put the OSSU-CS badge in the README of your repository!
- Markdown:
[](https://github.com/ossu/computer-science) - HTML:
<a href="https://github.com/ossu/computer-science"><img alt="Open Source Society University - Computer Science" src="https://img.shields.io/badge/OSSU-computer--science-blue.svg"></a>
- Markdown:
Use our community channels to announce it to your fellow students.
Solicit feedback from your OSSU peers.
You will not be “graded” in the traditional sense — everyone has their own measurements for what they consider a success.
The purpose of the evaluation is to act as your first announcement to the world that you are a computer scientist
and to get experience listening to feedback — both positive and negative.
The final project evaluation has a second purpose: to evaluate whether OSSU,
through its community and curriculum, is successful in its mission to guide independent learners in obtaining a world-class computer science education.
Cooperative work
You can create this project alone or with other students!
We love cooperative work!
Use our channels to communicate with other fellows to combine and create new projects!
Which programming languages should I use?
My friend, here is the best part of liberty!
You can use any language that you want to complete the final project.
The important thing is to internalize the core concepts and to be able to use them with whatever tool (programming language) that you wish.
Congratulations
After completing the requirements of the curriculum above, you will have completed the equivalent of a full bachelor’s degree in Computer Science. Congratulations!
What is next for you? The possibilities are boundless and overlapping:
- Look for a job as a developer!
- Check out the readings for classic books you can read that will sharpen your skills and expand your knowledge.
- Join a local developer meetup (e.g. via meetup.com).
- Pay attention to emerging technologies in the world of software development:
- Explore the actor model through Elixir, a new functional programming language for the web based on the battle-tested Erlang Virtual Machine!
- Explore borrowing and lifetimes through Rust, a systems language which achieves memory- and thread-safety without a garbage collector!
- Explore dependent type systems through Idris, a new Haskell-inspired language with unprecedented support for type-driven development.

Code of conduct
How to show your progress
Now that you have a copy of our official board, you just need to pass the cards to the Doing column or Done column as you progress in your study.
We also have labels to help you have more control through the process.
The meaning of each of these labels is:
Main Curriculum: cards with that label represent courses that are listed in our curriculum.Extra Resources: cards with that label represent courses that were added by the student.Doing: cards with that label represent courses the student is current doing.Done: cards with that label represent courses finished by the student.
Those cards should also have the link for at least one project/article built with the knowledge acquired in such course.Section: cards with that label represent the section that we have in our curriculum.
Those cards with theSectionlabel are only to help the organization of the Done column.
You should put the Course’s cards below its respective Section’s card.
The intention of this board is to provide our students a way to track their progress, and also the ability to show their progress through a public page for friends, family, employers, etc.
You can change the status of your board to be public or private.
Team
- Eric Douglas: founder of OSSU
- hanjiexi: lead technical maintainer
- waciumawanjohi: lead academic maintainer
- Contributors
(CS)计算机科学SlefLearning建议

