week-3-data-structures.md markdown
40 lines 1.1 KB
Raw
sha256:65ccb454656ea5acdea0a10e559b78bcde1eb6ff753ecc2911bc99d1c3d7cadd feat(calendar): enforce agent context tiers in retrieval AP… Human minor ⚠ breaking 1 day ago

title: "Assignment — Week 3: Data structures fundamentals" project: "cs101-intro" tags:

  • assignment
  • data-structures
  • cs101 date: 2026-04-07

Week 3 — Data structures fundamentals

Due2026-04-14, 23:59 (course timezone)
Submit — LMS → Assignments → “W3 Data Structures”
Status — In progress

Requirements

  1. Implement Stack and Queue classes per starter template (no standard library deque for the stack).
  2. Include unit tests for push/pop/peek edge cases.
  3. Write 200–300 words comparing when you would choose each structure for a text undo feature.

Grading rubric (snapshot)

Criterion Weight
Correctness + tests 60%
Complexity discussion 25%
Style + docstrings 15%

Notes / blockers

  • Clarified with TA: amortized O(1) for dynamic array stack is acceptable if documented.
  • Still confused on whether peek() should throw on empty—ask in Piazza thread 118.

Checklist before submit

  • [ ] pytest green locally
  • [ ] PDF write-up exported from Markdown
  • [ ] Filename: netid_w3.zip
File History 2 commits
sha256:65ccb454656ea5acdea0a10e559b78bcde1eb6ff753ecc2911bc99d1c3d7cadd feat(calendar): enforce agent context tiers in retrieval AP… Human minor 1 day ago
sha256:9103f98c89257ed2b01c237cea895dabb3e85ea337dccb1161c175e4422355b6 docs: accept Calendar Events v0 spec with Phase 0 security … Human 1 day ago