Computer science theory | Computing | Khan Academy
Explore advanced computer science topics from algorithms (how we solve common computing problems and measure our solutions' efficiency), to cryptography (how we protect secret information), to information theory (how we encode and compress information). Ideal for learners with some programming background.
En bref
Ajouté le
18 mars 2026
Matière et domaine
ai-and-automation · computational-systems-architecture
Niveaux scolaires
6e année–12e année (Terminale)
Type de page
Course
Introduction
Computer Science Theory Curriculum
- Algorithms: Covers fundamental sorting and search techniques, including Binary search, Selection sort, Insertion sort, Merge sort, and Quick sort.
- Recursion: Explores recursive algorithms, the factorial function, palindromes, computing powers, the Sierpinski gasket, and methods for improving recursive efficiency.
- Graph Theory: Introduction to graph representation and Breadth-first search (BFS).
- Ancient Cryptography: Historical encryption methods including the Caesar cipher, Polyalphabetic ciphers, the one-time pad, and the Enigma machine.
- Modern Cryptography: Advanced security concepts such as Public key cryptography, the discrete logarithm problem, Diffie-Hellman key exchange, and RSA encryption.
- Modular Arithmetic: Mathematical foundations including the modulo operator, congruence relations, the quotient remainder theorem, modular exponentiation, and modular inverses.
- Number Theory & Primality: Study of the fundamental theorem of arithmetic, Euler's totient function, the Euclidean algorithm, and various primality tests (e.g., Sieve of Eratosthenes, trial division).
- Computational Efficiency: Analysis of algorithmic efficiency, time complexity, and time-space tradeoffs.
- Computer Fundamentals: Basic overview of computer memory.
Avis de la communauté
Pas encore d’avis publiés. Soyez le premier à partager votre expérience.