Claude Code + Enhance-Slides

From Static Slides
to Interactive Learning

40+ lecture decks transformed from lifeless PowerPoints into Canvas-powered interactive experiences — zero dependencies, pure HTML.

4
Courses
40+
Decks
500+
Visualizations
0
Dependencies
The Problem

Death by bullet point

Traditional lecture slides: walls of text, zero interactivity, students checked out by slide three.

Lecture05_Pointers.pptx — PowerPoint

Pointers in C

  • A pointer stores the memory address of another variable
  • Declared using the * operator: int *p;
  • Use & to get address: p = &x;
  • Dereference with *: *p = 42;
  • NULL pointer: points to nothing
  • Common errors: dangling pointers, memory leaks
[ Generic pointer diagram.png — 640×480 ]
Slide 5 of 32 CS310 Advanced Programming

Sound familiar?

Before & After

Same content, different universe

Static bullet points become live, explorable visualizations students actually want to use.

Before — PowerPoint

Pointers & Memory

  • A pointer holds a memory address
  • int *p = &x; stores address of x
  • *p dereferences the pointer
  • Arrays decay to pointers
  • Pointer arithmetic: p+1 moves by sizeof(*p)
  • NULL pointer: points to nothing
  • Common errors: dangling pointers, memory leaks
[ static-memory-diagram.png — 640×480 ]

Students stare at this for 50 minutes.

After — Interactive Enhanced

CS310 Pointers: Static bullet list → live Canvas memory layout with click-to-dereference, address highlighting, and step-through animations.

Before — PowerPoint

Deterministic Finite Automata

  • A DFA is a 5-tuple (Q, Σ, δ, q0, F)
  • Q = finite set of states
  • Σ = input alphabet
  • δ = transition function Q × Σ → Q
  • q0 = start state, F = accept states
  • Exactly one transition per symbol per state
  • Process string left-to-right, accept if end in F
[ state-diagram.png — hand-drawn circles & arrows ]

Try explaining state transitions with just bullet points.

After — Interactive Enhanced

CS305 DFA: Formal definition dump → live automata simulator where students type input strings and watch states light up in real time.

Before — PowerPoint

OCaml Pattern Matching

  • match expression with patterns
  • Patterns checked top-to-bottom
  • _ is a wildcard pattern
  • Exhaustiveness checking at compile time
  • Nested patterns: match (x, y) with ...
  • Guards: | n when n > 0 → ...
[ code-snippet.png — monospace text on white ]

Code on a slide. Revolutionary.

After — Interactive Enhanced

CS336 OCaml: Passive code listing → pattern matching playground with Canvas tree visualization and interactive evaluation stepper.

How It Works

Three steps, zero setup

From boring PPTX to interactive deck in minutes.

1

Drop in source

Start with any PPTX or PDF lecture file. No special formatting — just the raw slides as-is from the professor's desk.

2

Claude analyzes & builds

Claude Code reads the content, plans interactive elements, and generates a self-contained HTML file in 3 parts.

3

Interactive deck

Canvas animations, step-through reveals, playgrounds, quizzes — single HTML file, zero dependencies.

Try It Yourself

Two commands, you're in

Install the enhance-slides plugin in Claude Code and start transforming your own lectures.

Step 1 — Add the marketplace
Tell Claude Code where to find the plugin.
/plugin marketplace add weihaoqu/enhance-slides-plugin
Step 2 — Install
That's it. Run /enhance-slides on any lecture file.
/plugin install enhance-slides
Also Built with Claude Code

Course web apps

Interactive tools and platforms deployed alongside the slide decks.

Curriculum Builder
Course planning tool
CS205
Data Structures
CS215
AI Literacy
CS336
Programming Languages
BF422
Business Finance