Most placement prep assumes you can already read code. This course starts one step earlier and walks the whole loop: what a program *is*, how a computer stores and moves data, how to express a problem as instructions, and how to debug when it does not work.

Every lesson is short, written in plain language, and ends with something you can check yourself. There is no sign-up wall, no trial, and no paid tier — finish all four modules and you get a verifiable TieEdu certificate plus your XP on the leaderboard.

**Who this is for:** first-year and second-year students, commerce and arts students switching into tech, and anyone who has been copying code without understanding it.

**What you need:** nothing. A browser and a sense of curiosity.

A free, end-to-end introduction to how programs actually work

Coding Foundations: From Zero to Your First Program

Most data-structure teaching stops at "a hash map is O(1), a tree is O(log n)" and leaves you to guess which one your problem needs. This course is about the second half: the part where the constraints decide, the constant factors show up in a profile, and you have to defend the choice.

Every structure here is implemented from scratch in TypeScript — the hash table with resizing, the red-black tree with all three fix-up cases, the array-backed binary heap, BFS and Dijkstra — and then measured rather than asserted about. The questions are the ones that actually come up: why adversarial hash collisions are a denial-of-service vector, when a binary search loses to a linear scan on cache behaviour, and when an adjacency matrix is genuinely the right answer.

It is a paid course because it assumes you can already program and already have the C course's grounding in pointers and memory. If you are not comfortable reading a loop that walks a linked structure, start with C Programming first.

Courses for CSE students

Coding Foundations: From Zero to Your First Program

Advanced Data Structures: Choosing Well Under Real Constraints