CS student plan¶
~6 min
In short¶
You are studying computer science or IT, and you have a degree that takes eight semesters. That gives you a long runway, but it is also easy to lose a year to exams and drift. This plan lines the work up with your semesters, so that each stretch has one main job: foundations first, then problem-solving and core subjects, then projects, then applying.
The general roadmap for a semester-by-semester path is in the foundations section: the roadmap. Use it for your first look at the whole course. This page adds the job-search layer.
How the eight semesters line up¶
| Semesters | Main job | Where to work |
|---|---|---|
| 1 and 2 | Programming basics, the terminal, git, and how a computer works | Free courses such as CS50x and Missing Semester |
| 3 and 4 | Data structures, algorithms, and core subjects | DSA and CS fundamentals |
| 5 and 6 | Projects you can explain, a clean resume, a public code profile | Projects and resume |
| 7 and 8 | Applying, mock rounds, and offers | Applying |
If you are already past semester two, do not go back to the start. Find your current semester in the table and begin there, then fill the gaps as you meet them.
Your exam calendar is the real timetable. Avoid heavy practice in exam weeks.
Foundations you should not skip¶
Some free courses are strong enough to use as your main reference for the early semesters:
- CS50x from Harvard covers C, Python, SQL, HTML, CSS and JavaScript, with eleven weeks of material and a final project. It is free through OpenCourseWare, with no prerequisites (https://cs50.harvard.edu/x/, checked 18 Oct 2026). The verified certificate is paid through edX, which you do not need.
- MIT's Missing Semester teaches the shell, git, debugging, and code quality. It is a good companion to any programming course (https://missing.csail.mit.edu/, checked 18 Oct 2026).
- freeCodeCamp has learning paths for web and general programming (https://www.freecodecamp.org/learn).
Problem-solving and core subjects¶
Pick a single practice route for DSA and stick with it for a whole semester. The DSA section covers topic order, practice method, and free sites. For core subjects, MIT OpenCourseWare has a well-known algorithms course, 6.006 (https://ocw.mit.edu/courses/6-006-introduction-to-algorithms-spring-2020/). NPTEL, from IITs and IISc, offers many more courses (https://nptel.ac.in/). Use them alongside your university syllabus, not instead of it.
Projects and the public record¶
Two or three projects you can explain are worth more than a long list of tutorials. Build one project that uses a database, one that calls an API or serves a web page, and one that you use yourself. Keep your code on GitHub with clear commit messages and a readme.
Applying as a student¶
Campus drives are run by your placement cell, and they follow the eligibility notice for your branch and year. Read it early. Off-campus applications also matter, and they often follow the process in applying. Begin your application log in semester five, even if you are not applying yet.
Honest limits¶
No plan can promise you an internship or a job. Companies do not publish a required number of problems or hours. Entry-level pay varies widely across companies, and self-reported pay sites are not a promise of what you will be offered.
Targets, in order¶
Work down this list in order. There is no deadline. Skip a row you already have and come back to a row you are not ready for.
| # | Target | You can move on when |
|---|---|---|
| 1 | Shell and git basics, Missing Semester lectures | You can make a commit and push it to GitHub |
| 2 | First half of CS50x, one small program each week | You have written a program that reads input and saves output to a file |
| 3 | Second half of CS50x, final project started | You can explain the final project's design in five minutes |
| 4 | Arrays, strings, hashing; one problem set per week | You can solve an easy problem and explain the approach |
| 5 | Trees, graphs, recursion; time-boxed solving and a mistakes log | You can solve a medium tree problem without help |
| 6 | Core subjects: operating systems and databases notes | You can explain a process and a SQL join in your own words |
| 7 | Networks basics; first real project with a database | The project runs on your machine and has a readme |
| 8 | Dynamic programming basics; second project with an API | You can name the trade-offs in your project's design |
| 9 | Resume draft; GitHub cleanup; one mock round with a friend | Your resume lines each have a matching project |
| 10 | Weekly problem sets and one timed session | You can finish a timed easy-to-medium set |
| 11 | Applications to campus and off-campus roles; log in use | You have applied to a set of roles and recorded each one |
| 12 | Mock rounds, feedback review, and a plan for the next cycle | You know your next three fixes and have scheduled them |
Try this¶
What to do this week: Find your current semester in the table above. Open CS50x and watch its first lecture, or open the Missing Semester first lecture if you already know C or Python. Set a fixed weekly hour block for it in your calendar, and keep it.
Sources¶
- Harvard CS50x: https://cs50.harvard.edu/x/ (checked 18 Oct 2026)
- MIT Missing Semester: https://missing.csail.mit.edu/ (checked 18 Oct 2026)
- freeCodeCamp learning paths: https://www.freecodecamp.org/learn (checked 18 Oct 2026)
- MIT OpenCourseWare, 6.006 Introduction to Algorithms: https://ocw.mit.edu/courses/6-006-introduction-to-algorithms-spring-2020/ (checked 18 Oct 2026)
- NPTEL: https://nptel.ac.in/ (checked 18 Oct 2026)
- Tech Interview Handbook, study plan: https://www.techinterviewhandbook.org/coding-interview-study-plan/ (checked 18 Oct 2026)