Computer Science · High school, AP and college

Computer Science, section by section.

13 sections and 87 topics in teaching order. Each topic: read it, flip the flashcards, then test your understanding. Every topic is free.

A

Introduction to computer science

What the field studies, where computing came from, and the ideas that run through every later chapter. · 3 topics

  1. A.1Algorithms and what computer science studies
  2. A.2A brief history of computing
  3. A.3The big themes of computer science and its impact on society
B

Data storage

How bits are stored in circuits, memory and disks, and how numbers, text, images and sound become bit patterns. · 10 topics

  1. B.1Bits, gates, and flip-flops
  2. B.2Main memory
  3. B.3Mass storage
  4. B.4Representing text, images, and sound as bits
  5. B.5The binary system
  6. B.6Storing integers: two's complement and excess notation
  7. B.7Storing fractions: floating-point notation
  8. B.8Data and programming
  9. B.9Data compression
  10. B.10Detecting and correcting communication errors
C

Data manipulation

How a CPU runs a stored program: machine language, the fetch-execute cycle, and talking to devices. · 7 topics

  1. C.1Computer architecture: CPU and stored programs
  2. C.2Machine language
  3. C.3Program execution and the machine cycle
  4. C.4Arithmetic, logic, shift, and rotate instructions
  5. C.5Communicating with other devices
  6. C.6Programming data manipulation
  7. C.7Other architectures: pipelining and multiprocessors
D

Operating systems

The software that runs the machine: its parts, how it shares the CPU among processes, and how it stays secure. · 6 topics

  1. D.1The history of operating systems
  2. D.2Operating system architecture and booting
  3. D.3The memory manager and the file manager
  4. D.4Coordinating the machine: processes and scheduling
  5. D.5Competition among processes: semaphores and deadlock
  6. D.6Operating system security
E

Networking and the internet

How networks are built, how the internet and the web work, and how to defend them. · 7 topics

  1. E.1Network fundamentals
  2. E.2The internet: architecture and addressing
  3. E.3The World Wide Web
  4. E.4Internet protocols: layers, TCP, and UDP
  5. E.5A simple client-server program
  6. E.6Cybersecurity: attacks and defences
  7. E.7Cybersecurity: encryption and authentication
F

Algorithms

What an algorithm is, how to write and discover one, and how to judge whether it is correct and efficient. · 6 topics

  1. F.1The concept of an algorithm
  2. F.2Representing algorithms with pseudocode
  3. F.3Discovering algorithms: problem-solving strategies
  4. F.4Iterative structures: sequential search and insertion sort
  5. F.5Recursive structures: binary search
  6. F.6Efficiency and correctness
G

Programming languages

How languages evolved, the concepts they share, how they are translated, and the main paradigms. · 7 topics

  1. G.1Historical perspective: generations and paradigms
  2. G.2Traditional concepts: variables, types, and control
  3. G.3Procedural units: functions and parameters
  4. G.4Language implementation: translation and compilers
  5. G.5Object-oriented programming
  6. G.6Programming concurrent activities
  7. G.7Declarative programming
H

Software engineering

How large software is planned, built, tested and documented, and who owns and answers for it. · 9 topics

  1. H.1The software engineering discipline
  2. H.2The software life cycle
  3. H.3Software engineering methodologies
  4. H.4Modularity: coupling and cohesion
  5. H.5Tools of the trade: UML and design patterns
  6. H.6Quality assurance and testing
  7. H.7Documentation
  8. H.8The human-machine interface
  9. H.9Software ownership, liability, and the law
I

Data abstractions

Arrays, lists, stacks, queues and trees, and how they are built from memory cells and pointers. · 6 topics

  1. I.1Basic data structures
  2. I.2Related concepts: abstraction and pointers
  3. I.3Implementing data structures
  4. I.4A short case study: a binary tree
  5. I.5Customized data types, classes, and objects
  6. I.6Pointers in machine language
J

Database systems

Why databases exist, the relational model and SQL, keeping data consistent, and mining it. · 8 topics

  1. J.1Database fundamentals
  2. J.2The relational model
  3. J.3Querying with SQL
  4. J.4Object-oriented databases
  5. J.5Maintaining database integrity: transactions
  6. J.6Traditional file structures: indexed and hash files
  7. J.7Data mining, big data, and NoSQL
  8. J.8Social impact of database technology: privacy
K

Computer graphics

How 3D scenes are modelled, lit and rendered into images and animation. · 5 topics

  1. K.1The scope of graphics and an overview of 3D
  2. K.2Modeling objects
  3. K.3Rendering
  4. K.4Global lighting: ray tracing and radiosity
  5. K.5Animation
L

Artificial intelligence

How machines perceive, reason, learn and act, and what that means for people. · 7 topics

  1. L.1Intelligence and machines
  2. L.2Perception: vision and language
  3. L.3Reasoning: production systems and search
  4. L.4Additional areas: knowledge and learning
  5. L.5Artificial neural networks
  6. L.6Robotics
  7. L.7Considering the consequences of AI
M

Theory of computation

What computers can and cannot do in principle, and how hard problems are. · 6 topics

  1. M.1Functions and their computation
  2. M.2Turing machines
  3. M.3Universal programming languages
  4. M.4A noncomputable function: the halting problem
  5. M.5Complexity of problems: P and NP
  6. M.6Public-key cryptography
★

Unit quizzes and final exam

Question banks with a fresh draw on every attempt. Every quiz is free.

Section order follows Brookshear & Brylow, Computer Science: An Overview (13th ed.) chapter by chapter; topics follow its sections.