For nonnegative functions f and g, what does f(n) ∈ O(g(n)) mean?

There are constants c > 0 and n₀ ≥ 0 such that f(n) ≤ c·g(n) for every n ≥ n₀.

How do O, Ω and Θ differ?

They give asymptotic upper, lower and tight bounds, respectively. They describe a specified cost function; O does not itself mean worst case.

What does binary search require, and when does it run in O(log n) time?

It repeatedly halves a search interval in data sorted under the comparison order. On an array with O(1) indexed access and constant-time comparisons, searching n elements takes O(log n) time.

How does insertion sort work, and what determines its time on nearly sorted input?

It inserts each item into a sorted prefix. The usual adjacent-shift or adjacent-swap version takes Θ(n+I) time, where I is the number of inversions. It is linear when I=O(n); small input alone does not change the worst-case Θ(n²) bound.

What constraints define REST, beyond resource URLs and HTTP method names?

Client–server separation, stateless requests, cache constraints, a uniform interface and a layered system; code-on-demand is optional. The uniform interface includes resource identification, manipulation through representations, self-descriptive messages and hypermedia-driven application state. REST is an architectural style, not merely CRUD over HTTP.

Which standard HTTP methods are idempotent, and what does that guarantee?

GET, HEAD, OPTIONS, TRACE, PUT and DELETE are idempotent by their defined semantics: repeating a request has the same intended server effect as performing it once. Responses and incidental logging can differ. POST and PATCH are not inherently idempotent, but an application can design particular operations to be retry-safe.

How does symmetric encryption differ from public-key cryptography?

Symmetric encryption, such as AES or ChaCha20, uses the same secret key to encrypt and decrypt. Public-key cryptography uses a related public/private key pair; depending on the scheme, it supports encryption, digital signatures or key agreement. These operations are not interchangeable.

In a typical certificate-authenticated TLS 1.3 handshake using ephemeral Diffie–Hellman, how are the server and session keys verified?

The client validates the server's certificate and identity, then verifies its CertificateVerify signature over the handshake transcript. Ephemeral Diffie–Hellman establishes a shared secret from which traffic keys are derived; Finished messages authenticate the transcript and confirm the derived keys. TLS 1.3 also supports other handshake modes.

6 min read

Technology, Cloud & AI English 3 Interactive Flashcard Decks

Computer Science Complete Study Guide: Master Key Concepts with Active Recall Flashcards

Q: How many flashcards should I study per day for Computer Science?

For sustainable long-term retention, start with 20 to 32 new cards per day (1 curated set) plus your daily review queue (typically 15–25 minutes total).

Q: Which level of Computer Science sets should I start with on flashcards.world?

Start with the Basic tier to verify your command of foundational terminology, then move to Intermediate once you score 85%+ on your first pass.

Comprehensive Computer Science study guide with curated basic, intermediate, and advanced flashcard sets, sample active-recall questions, and an 8-week study plan on flashcards.world.

Practice 3 Curated Computer Science Decks ↓ Browse All Computer Science Flashcards →

Interactive Premade Curricula

Computer Science Flashcard Decks (3)

Select any deck below to study cards with active recall, audio pronunciation, and FSRS spaced repetition, or filter by difficulty level.

Foundational EN → EN

Data Structures, Arrays, Hash Maps, Trees & Big-O Complexity

Practice Deck → More basic sets

Intermediate EN → EN

Algorithms, Sorting, Graph Traversal, Dynamic Programming & SQL/Databases

Practice Deck → More intermediate sets

Advanced EN → EN

Operating Systems, Concurrency, Networking Protocols & Distributed Systems

Practice Deck → More advanced sets

Explore All Computer Science Study Sets on flashcards.world

1. Why Active Recall & Spaced Repetition Work for Computer Science

Mastering Computer Science requires both deep conceptual understanding and rapid, accurate recall of core terminology, mechanisms, rules, and analytical frameworks. Whether you are preparing for university exams, professional certifications, or practical application, combining Active Recall (testing yourself before looking at the answer) with Spaced Repetition prevents the illusion of competence and locks complex Computer Science knowledge into long-term memory.

Below you will find a structured learning roadmap linking directly to curated Computer Science flashcard sets on flashcards.world across three progressive difficulty tiers.

2. Curated Computer Science Flashcard Sets on flashcards.world (By Level)

3. High-Yield Sample Flashcards Preview (Computer Science)

Level	Front (Prompt / Target)	Back (Answer / Explanation)
`basic`	For nonnegative functions f and g, what does f(n) ∈ O(g(n)) mean?	There are constants c > 0 and n₀ ≥ 0 such that f(n) ≤ c·g(n) for every n ≥ n₀.
`basic`	How do O, Ω and Θ differ?	They give asymptotic upper, lower and tight bounds, respectively. They describe a specified cost function; O does not itself mean worst case.
`basic`	What does binary search require, and when does it run in O(log n) time?	It repeatedly halves a search interval in data sorted under the comparison order. On an array with O(1) indexed access and constant-time comparisons, searching n elements takes O(log n) time.
`basic`	How does insertion sort work, and what determines its time on nearly sorted input?	It inserts each item into a sorted prefix. The usual adjacent-shift or adjacent-swap version takes Θ(n+I) time, where I is the number of inversions. It is linear when I=O(n); small input alone does not change the worst-case Θ(n²) bound.
`intermediate`	How do a process and a thread differ in a typical operating system?	A process is a resource and protection container with its own virtual address space. Threads within it share that address space and resources such as open files, but each has its own execution state, including registers, program counter and stack. Separate processes can explicitly share memory.
`intermediate`	What state is saved and restored during a CPU context switch?	The operating system preserves the outgoing task’s execution state, such as registers, program counter and stack pointer, and restores the incoming task’s state. Address-space state is changed when needed; switching between threads of one process need not change the page-table root. Exact saved state depends on the architecture and implementation.
`intermediate`	What stages are common in a compiler pipeline?	Lexing produces tokens; parsing builds a syntax tree; semantic analysis checks names and types; lowering produces an intermediate representation; optimization and code generation produce target code. Implementations may combine or omit stages.
`intermediate`	How do compilation and interpretation differ?	Compilation translates a program into another representation; interpretation executes a program representation, such as an AST or bytecode. A language implementation can combine both, and compilation need not happen ahead of time.
`advanced`	What constraints define REST, beyond resource URLs and HTTP method names?	Client–server separation, stateless requests, cache constraints, a uniform interface and a layered system; code-on-demand is optional. The uniform interface includes resource identification, manipulation through representations, self-descriptive messages and hypermedia-driven application state. REST is an architectural style, not merely CRUD over HTTP.
`advanced`	Which standard HTTP methods are idempotent, and what does that guarantee?	GET, HEAD, OPTIONS, TRACE, PUT and DELETE are idempotent by their defined semantics: repeating a request has the same intended server effect as performing it once. Responses and incidental logging can differ. POST and PATCH are not inherently idempotent, but an application can design particular operations to be retry-safe.
`advanced`	How does symmetric encryption differ from public-key cryptography?	Symmetric encryption, such as AES or ChaCha20, uses the same secret key to encrypt and decrypt. Public-key cryptography uses a related public/private key pair; depending on the scheme, it supports encryption, digital signatures or key agreement. These operations are not interchangeable.
`advanced`	In a typical certificate-authenticated TLS 1.3 handshake using ephemeral Diffie–Hellman, how are the server and session keys verified?	The client validates the server's certificate and identity, then verifies its CertificateVerify signature over the handshake transcript. Ephemeral Diffie–Hellman establishes a shared secret from which traffic keys are derived; Finished messages authenticate the transcript and confirm the derived keys. TLS 1.3 also supports other handshake modes.

4. 8-Week Spaced Repetition Study Roadmap

Weeks 1–2: Foundation (basic): Complete the Basic sets (30–32 new cards/day). Focus on instant recognition and pronunciation/core definitions. Review due cards daily (15–20 mins).
Weeks 3–5: Applied Core (intermediate): Introduce Intermediate sets (20 new cards/day) while maintaining daily spaced reviews of Basic decks. Practice producing full answers aloud or in writing.
Weeks 6–7: Mastery & Edge Cases (advanced): Transition to Advanced sets (15 new cards/day). Use interleaved practice—mixing Basic, Intermediate, and Advanced cards to sharpen discrimination under exam conditions.
Week 8: Consolidation & Self-Testing: Pause new cards for 7 days; clear all review queues on flashcards.world and re-test any leech cards (cards missed 2+ times).

5. Common Study Mistakes & How to Avoid Them

Passive Flipping Without Answering Aloud: Always formulate your exact answer in your head (or out loud) before flipping the card.
Cramming 500 Cards in One Night: Spaced repetition relies on sleep-dependent memory consolidation. 20–30 minutes every day beats a 4-hour weekend marathon.
Skipping Context & Nuance: Read the full example phrase or analytical explanation on the back of each card so you learn how the concept operates in real scenarios.
Ignoring Level Progression: Build a 90%+ accuracy rate on the basic sets before jumping into advanced sets.

6. Frequently Asked Questions (FAQ)

How many flashcards should I study per day for Computer Science?

For sustainable long-term retention, start with 20 to 32 new cards per day (1 curated set) plus your daily review queue (typically 15–25 minutes total).

Which level of Computer Science sets should I start with on flashcards.world?

Start with the Basic tier to verify your command of foundational terminology, then move to Intermediate once you score 85%+ on your first pass.

Can I study Computer Science flashcards on mobile and desktop?

Yes—all sets linked in this guide are available directly on flashcards.world across desktop and mobile browsers.

Explore All Computer Science Study Sets on flashcards.world →