Computer Science A

Course Progress 0/0
Sprint 7 Week 27: Tree, Priority, and Network Models

Week 27: Tree, Priority, and Network Models

Week 27: Tree, Priority, and Network Models

Week 27 of Sprint 7: Data Structures using OCS Project.

Learning goals

✓Build Binary Tree and BST Layers; Compare Balanced and Skewed Costs
✓Build Binary Heap and Priority Queue Layers; Verify Invariants
✓Model Graph Adjacency and Implement BFS and DFS
✓PBL Extension - Prototype Priority Review Scheduling or Graph Search over Group Relationships

The three ready documents cover graph models, Java adjacency, and BFS/DFS. Custom tree/BST and heap/priority-queue labs remain unscheduled drafts.

This week

Start: Graph Heuristics - Breadth First Search and Depth First Search → Week 27 Chat
Lesson Graph Heuristics - Breadth First Search and Depth First Search Lesson Graph Heuristics - Intro Lesson Graph Heuristics - Java and Graphs

Computer Science A