Managerial · Today’s learning

Choose today’s work from saved experiments, reviews and course progress.

Choose questions with Selekta →

Plans and these learning results stay in this browser, including when signed in. Times are estimates.

Create a short plan to find your next step. You can begin without a diagnosis.

This week

Completed tasks and checked answers are counted separately. No study duration is inferred from an open page.

0Days with activity
0Reading sections
0Practice tasks answered
0 / 20Foundation sessions

0 tasks deferred this week. They are reconsidered rather than piled onto tomorrow.

CS foundations · 20 learning sessions

Four groups of five sessions. Sessions may span several days depending on your available time.

Week 1

  1. Trace a running program

    Explain source code versus a process

  2. Storage and lifetimes

    Compare stack and heap roles

  3. Input size and operation counts

    Estimate operations as input grows

  4. Count the cost of an operation sequence

    Distinguish worst single-operation cost and amortized cost

  5. Calculate array addresses

    Find an address from an index and element size

Week 2

  1. Conditions behind hash tables

    Explain collision and load-factor effects

  2. A structure for extracting minima

    Trace heap operations and its invariant

  3. Measure CPU work

    Distinguish instructions, cycles and runtime

  4. Use nearby data

    Explain temporal and spatial locality with examples

  5. Reason about shared cache lines

    Explain contention between distinct variables

Week 3

  1. Create and replace a process

    Trace the difference between fork and exec

  2. Understand virtual addresses

    Distinguish virtual and physical addresses

  3. Cache address translations

    Distinguish a TLB miss from a page fault

  4. Trace processing from a fault

    Explain what follows a page fault

  5. Reason about intermediate states

    Trace interleaved read-modify-write operations

Week 4

  1. Ordering and synchronization

    Distinguish wall-clock order and synchronization order

  2. Resolve a name

    Trace DNS queries and caching

  3. Deliver a byte stream

    Explain ordering, retransmission and application boundaries

  4. Concurrent updates and visibility

    Trace row versions and transaction visibility

  5. Connect processing to access control

    Connect communication, storage, authentication and authorization