Draft - Heap and Priority Queue Layers
Authoring skeleton - differentiated CS113 implementation
Short topic and PBL layers
Compare FIFO review order with priority scheduling. AssignmentQueue supplies a project context, not an existing heap implementation.
Implementation layers to author
- Array-backed binary heap and parent/child indices.
- Insert with sift-up; remove with sift-down.
- Priority scheduling with an explicit equal-priority policy.
- Week 34 continuation: heapsort using the same heap concepts.
Evidence checklist to author
Verify the heap invariant after every operation. Test empty removal, singleton queues, equal priorities, ascending/reversed inputs, and sorted removal order. Compare library use and from-scratch competence separately.
Publication checklist
Complete examples, a CodeRunner exercise, and tests before assigning courses.csa.week, removing draft/hide flags, or enabling submissions.
Code Runner Challenge
Authoring draft - heap exercise is not ready
View IPYNB Source
// CODE_RUNNER: Authoring draft - heap exercise is not ready
public class HeapDraft {
public static void main(String[] args) {
throw new UnsupportedOperationException("Draft: author heap operations and tests before publication.");
}
}
HeapDraft.main(null);
Lines: 1
Characters: 0
Output
Click "Run" in code control panel to see output ...