Skip to content

One lecture, start to finish.

One Algorithms lecture, from the slides to the next move. Six stages, and only one of them changes your map.

Join the Wishlist Try a sample lecture

Wishlist access is open. Already invited? Sign in

The study loop

  1. Source

    Your slides, unchanged.

    Upload the lecture PDF. Nova keeps the original readable, page for page, and never rewrites it.

  2. Outline

    Concepts, with slide numbers.

    Nova reads the deck and lists the concepts it teaches, each pointing at the slides it came from.

  3. Study attempt

    You answer first.

    A question from the lecture. You trace, explain or calculate before any feedback appears.

  4. Feedback

    Then the marking.

    Nova responds to what you submitted. Progressive hints and a Repair step point back to the slide that fixes the gap.

  5. Evidence

    The attempt is recorded.

    Your submitted work becomes Evidence against the concepts it tested. It cannot be edited afterwards, and nothing you merely read counts.

  6. Next move

    One suggestion, explained.

    Nova reads the Evidence and proposes one thing to do next, with the reason. It is a suggestion, not an assignment.

Evidence records what you showed, not what you saw.

Earns Evidence

  • A submitted Study answer, whether right, nearly right or wrong.
  • A Worksheet sitting you typed and submitted.
  • A timed Past Paper sitting, marked against the concepts it tested.
  • A Repair step you completed after feedback.

Never earns Evidence

  • Reading or highlighting a slide.
  • Revealing an answer before attempting it.
  • Reading a Nova explanation or asking a question in Live Lecture.
  • Time spent in the app, streaks, or pages turned.

Five days. One thread.

The map changes twice, both times because something was submitted.

Watch the map build

  1. Mon
    Lecture 7 added to AlgorithmsGraph traversal.pdf becomes a Source. Nova prepares the Outline with slide numbers.
    No Evidence
  2. Tue
    Live Lecture, slide 15You ask about the FIFO queue on the slide. The answer and your note stay beside it.
    No Evidence
  3. Wed
    Study: trace BFS from AYou work the frontier order first, then submit. Feedback arrives after.
    3 signals
  4. Thu
    Worksheet 3, typed sittingThe stopping condition is marked for Repair. Nothing you read counts as understood.
    1 signal, 1 Repair
  5. Fri
    Next move: study breadth-first searchShortest paths depend on it. Depth-first search stays untested, not failed. 12 minutes.
    From Evidence

One lecture is enough to see the difference.

Join the Wishlist

Wishlist access is open. Already invited? Sign in