Computer Science L1 covers algorithmic foundations, programming (mostly Python in French universities), discrete mathematics, computer architecture, operating systems and networks. Core notions to master: control structures (sequence, conditional, loop), recursion with base case and decreasing variant, complexity analysis (O(1), O(log n), O(n), O(n log n), O(n²), O(2ⁿ)) focusing on the worst case, classical sorts (selection, bubble, insertion, merge, quick) and binary search, data structures (stacks, queues, linked lists, binary trees, hash tables). Discrete maths brings logic, set theory, combinatorics, induction proofs and graph theory. Architecture covers binary representation, logic gates and the Von Neumann model. OS topics include processes vs threads, scheduling, virtual memory and Unix shell. Networking introduces the OSI/TCP-IP layers and key protocols (HTTP, DNS, TCP, UDP, IP).

EduFiche turns your computer science lecture notes and Python lab work into structured revision sheets in 30 seconds.