Two tracks, one graph

Computer Science holds the order; Complementary Studies keeps its own

Computer Science is the recommended path — modules in order, then specialization, then research. Everything you already study lives in Complementary Studies, with its own order and its own XP, linked to the path instead of duplicated into it.

See it as a graph →

Stage · Your StateKnowledge

Module

Foundations of Computer Science

480h plannedNot started

Programming & Computational Thinking

programming
abstraction
functions
recursion
decomposition

Discrete Mathematics & Logic

propositional logic
predicate logic
sets
induction
proofs
combinatorics

Data Structures I

arrays
linked lists
stacks
queues
hash tables
trees

Probability & Statistics

foundation for algorithms, AI, ML, and research

Mathematics for Computing

linear algebra

Calculus

limits
derivatives
integrals
sequences and series
multivariable calculus
differential equations

Questions & Scientific Thinking

turning curiosity into a computational question

Module

Algorithms & Software

532h plannedNot started

Data Structures II

balanced trees
heaps
graphs
tries
union-find

Algorithms

sorting
searching
divide & conquer
greedy
dynamic programming
graph algorithms
shortest paths
MST

Software Construction

modularity
testing
debugging
version control
API design
software architecture

Programming Paradigms

imperative
object-oriented
functional
logic
concurrent
declarative

Computability & Complexity

Turing machines
decidability
reductions
P/NP
complexity classes

Algorithm Laboratory

Dijkstra
A*
PageRank
hash tables
B-trees
sorting algorithms

Linear Programming & Optimization

simplex method
duality
shadow prices
integer programming
branch and bound
max-flow min-cut

Numerical Methods

numerical error
root finding
linear systems
interpolation
numerical integration
differential equation solvers

Formal Languages & Automata

finite automata
regular expressions
non-regularity proofs
context-free grammars
pushdown automata

Module

How Computers Actually Work

400h plannedNot started

Digital Logic & Computer Organization

logic gates
ALU
CPU
memory
instruction set
computer

C & Assembly

pointers
memory
stack
heap
assembly
ABI
calling conventions

Computer Architecture

pipelines
cache
branch prediction
memory hierarchy
multicore
SIMD
GPUs

Operating Systems I

processes
threads
scheduling
virtual memory
filesystem
concurrency

Systems Laboratory

build a CPU
assembly
C
memory manager
scheduler
file system

Module

Systems

314h plannedNot started

Operating Systems II

kernel
system calls
IPC
synchronization
virtualization
security boundaries

Computer Networks

physical
link
IP
routing
TCP
HTTP
distributed applications

Database Systems

relational model
SQL
storage engines
indexes
query optimizer
transactions
recovery

Distributed Systems I

clocks
RPC
replication
consistency
consensus
fault tolerance

Parallel Computing

parallel architectures
decomposition
speedup and scalability
OpenMP
MPI

Module

Software + Distributed Computing

500h plannedNot started

Software Engineering

requirements
architecture
testing
CI/CD
observability
technical debt

Distributed Systems II

Raft
Paxos
Byzantine fault tolerance
distributed databases
eventual consistency
CRDTs

Distributed Systems III

consensus variants
group membership
causal consistency
database replication
peer-to-peer systems
shared logs
network ordering

Programming Languages

interpreters
type systems
semantics
functional programming
runtime systems

Compilers

lexer
parser
AST
semantic analysis
IR
optimization
machine code

Security & Cryptography

cryptography
authentication
authorization
secure systems
network security
threat modeling

Distributed Systems Lab

build a replicated database, then break it: partition, node failure, clock skew, packet loss

Module

Intelligence + Theory

500h plannedNot started

Artificial Intelligence

search
planning
knowledge representation
reasoning
decision making
probabilistic AI

Machine Learning

probability
linear algebra
optimization
machine learning
deep learning

Data Mining

KDD process
data warehouses and OLAP
frequent patterns
clustering
outlier detection
text mining

Deep Learning

neural networks
CNNs
RNNs
transformers
representation learning
generative models

Information Theory

entropy
information
compression
communication
coding
information limits

Formal Methods

formal specification
verification
model checking
theorem proving
program correctness

AI / ML Laboratory

question
hypothesis
dataset
model
experiment
evaluation
reproduce
challenge

Module

Graduate Studies

180h plannedNot started

Academic Writing

papers
LaTeX
abstracts
thesis structure
publication

Research Statistics & Experiments

hypothesis testing
experimental design
significance
effect size
reproducibility

Graduate Academic Culture

peer review
research ethics
advising
conferences
thesis defense

Specialization

Choose one track of depth after the modules above.

Track A — Systems

advanced OS
distributed systems
databases
cloud computing
high performance computing
computer architecture

Not started

Track B — AI

advanced machine learning
deep learning
computer vision
NLP
reinforcement learning
generative AI

Not started

Track C — Theory

advanced algorithms
complexity
cryptography
information theory
formal methods
computational geometry

Not started

Track D — Software

programming languages
compilers
type systems
program analysis
software verification
developer tools

Not started

Computer Graphics

rendering pipeline
geometric transformations
rasterization
shading and illumination
ray tracing

Not started

Image Processing

image representation
spatial filtering
edge detection
segmentation
frequency domain
compression

Not started

Research & Independent Computing

No final subject. One question of your own.

question
→
literature
→
papers
→
hypothesis
→
implementation
→
experiment
→
result
→
reflection
→
new question

Enter →