week-3-data-structures.md
markdown
sha256:c2dbf04d56308f3bbf2d06e6d2eb022b8948b1e827195fe525a44e5e18d5f9c0
feat(auth): Phase B Connect cloud agent (RFC 8628) + Hermes…
Human
minor
⚠ breaking
11 days 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
Due — 2026-04-14, 23:59 (course timezone)
Submit — LMS → Assignments → “W3 Data Structures”
Status — In progress
Requirements
- Implement
StackandQueueclasses per starter template (no standard library deque for the stack). - Include unit tests for push/pop/peek edge cases.
- 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
- [ ]
pytestgreen locally - [ ] PDF write-up exported from Markdown
- [ ] Filename:
netid_w3.zip
File History
1 commit
sha256:93bcf8f9bd56d8c5b9339f4ec73b9ebd66571398d56262d38eedc2cfa9db9882
fix(test): align Band B landing assertion with desktop MCP …
Human
11 days ago