Overview
What this challenge is about.
Read the device spec (32 KB RAM, 200 mAh daily budget, 9 sensing modes with mAh cost and farmer-value scores) and formulate the daily allocation as a 0/1 knapsack DP (dynamic programming) variant — with two twists: (1) some modes have minimum-frequency constraints (must run at least once/day), (2) value scores depend on the current soil-moisture reading (state-dependent value). Implement a Python prototype against 30 days of simulated farmer days, then port the inner loop to C suitable for the device's runtime. Deliver the formulation memo, the Python prototype, the C port, and a memory-usage analysis.
The Brief
What you'll do, and what you'll demonstrate.
Formulate and ship a knapsack-style DP battery allocator that runs on a 32KB-RAM device and outperforms the heuristic on simulated farm days.
Earning criteria — what you'll demonstrate
- Recognize when a real problem maps to a 0/1 knapsack DP variant
- Handle DP with state-dependent values and additional constraints
- Port a DP from Python prototype to C with memory budget in mind
- Benchmark a DP-based decision system against a heuristic baseline
Program Fit
Where this fits in your program.
Sharpens the same skills your degree expects you to demonstrate.
Skills
Skills you'll demonstrate.
Each one shows up on your verified credential.
Careers
Roles this prepares you for.
Real titles. Real skill bridges. Pick the one closest to your trajectory.
Career mappings coming soon.