Khachaturyan Meri

⋆。°✩ ENGS110 – Interactive Homeworks & Polynomial Solver ✩°。⋆

📚🍎 Homeworks (click to open)
🗜️
HW: RLE Compression
Run‑Length Encoding – compress repeated chars (single‑digit counts).
HW: Stack Reverser
Fixed‑size stack (no malloc) to reverse strings/numbers.
🚦
HW: Traffic Light
Finite state machine: RED → GREEN → YELLOW → RED.

🗜️ Run‑Length Encoding (RLE) – single‑digit counts

Click "Compress" to see RLE result.
Note: Only single‑digit counts (max 9 repeats per character).

Stack‑Based Reverser (fixed‑array, no malloc)

Result will appear here.
Uses a fixed‑size stack (max 100 elements) – push all chars, then pop to reverse.

🚦 Traffic Light Simulator (enum + switch)

RED
Click Step or Auto to see state transitions.
⚙️ Project: Polynomial Root Finder
🔢 Polynomial Root Finder Python + Canvas

Horner evaluation, bisection, Newton‑Raphson with fallback – runs real Python in your browser (Pyodide).

⏳ Loading Pyodide (Python runtime)... please wait.