Reintroduce modules for posterity

_config.yml

@@ -35,6 +35,7 @@ footer_content: 'Kevin Lin &copy; 2021 <a rel="license" href="http://creativecom
 # Collections for website data
 collections:
   staffers:
+  modules:
 # Default layouts for each collection type
 defaults:
   - scope:
@@ -45,6 +46,11 @@ defaults:
       height: 300
       subpath: '/assets/images/'
       width: 300
+  - scope:
+      path: ''
+      type: modules
+    values:
+      layout: module
 
 compress_html:
   clippings: all

_layouts/module.html

-<h2 class="fs-4" id="{{ page.title | slugify }}" >{{ page.title }}</h2>
+<h3 id="{{ page.title | slugify }}" >{{ page.title }}</h3>
 <div class="module">
   {{ content }}
 </div>

_modules/0-abstractions.md

+---
+title: Abstractions
+---
+
+#### Data Structures
+
+6/21
+: **Introduction**
+
+6/23
+: **Search Trees**
+
+6/24
+: **Sec**{: .label .label-purple }**Data Structures**
+
+6/25
+: **Asymptotic Analysis**

_modules/1-autocomplete.md

+---
+title: Autocomplete
+---
+
+#### Algorithm Analysis
+
+6/28
+: **Recurrence Relations**
+: **Prj**{: .label .label-red }**Autocomplete**
+
+6/30
+: **2-3 Trees**
+
+7/1
+: **Sec**{: .label .label-purple }**Algorithm Analysis**
+
+7/2
+: **Left-Leaning Red-Black Trees**
+
+#### Balanced Search Trees
+
+7/5
+: *Holiday*
+
+7/7
+: **Binary Heaps**
+
+7/8
+: **Sec**{: .label .label-purple }**Balanced Search Trees**
+
+7/9
+: **Design Justice**

_modules/2-priority-queues.md

+---
+title: Priority Queues
+---
+
+#### Heaps and Hashing
+
+7/12
+: **Affordance Analysis**
+: **Prj**{: .label .label-red }**Priority Queues**
+
+7/14
+: **Hash Tables**
+
+7/15
+: **Sec**{: .label .label-purple }**Heaps and Hashing**
+
+7/16
+: **Memory and Caching**
+
+#### Graph Data Type
+
+7/19
+: **Graphs**
+
+7/21
+: **Graph Traversals**
+
+7/22
+: **Sec**{: .label .label-purple }**Graph Data Type**
+
+7/23
+: **Shortest paths**

_modules/3-shortest-paths.md

+---
+title: Shortest Paths
+---
+
+#### Graph Algorithms
+
+7/26
+: **Reduction Algorithms**
+: **Prj**{: .label .label-red }**Shortest Paths**
+
+7/28
+: **Minimum Spanning Trees**
+
+7/29
+: **Sec**{: .label .label-purple }**Graph Algorithms**
+
+7/30
+: **Dynamic Programming**
+
+#### Sorting Algorithms
+
+8/2
+: **Comparison Sorts**
+
+8/4
+: **Recursive Sorts**
+
+8/5
+: **Sec**{: .label .label-purple }**Sorting Algorithms**
+
+8/6
+: **Algorithm Bounds**

_sass/custom/module.scss

@@ -13,11 +13,15 @@
     }
   }
 
+  h4 {
+    @extend .fs-3;
+  }
+
   >dl {
     border-bottom: $border $border-color;
     border-top: $border $border-color;
     display: grid;
-    grid-template-columns: max-content 1fr;
+    grid-template-columns: 1fr 6fr;
     margin: $sp-2 (-$sp-4);
 
     &:first-child {
@@ -28,10 +32,6 @@
       margin-bottom: 0;
     }
 
-    @include mq(lg) {
-      grid-template-columns: 1fr 7fr;
-    }
-
     %module-item {
       margin: 0;
       padding: $sp-2;

index.md

@@ -43,6 +43,12 @@ In the first 7 weeks, we'll study 3 interfaces and 6 applications of data struct
 
 In the final 2 weeks, we'll wrap up the course by reflecting on our journey through computing.
 
+## Schedule
+
+{% for module in site.modules %}
+{{ module }}
+{% endfor %}
+
 ## Values and Policies
 
 The education you receive in this course can help prepare you for programming jobs, but this isn't the only purpose for learning computer science.[^1] Education is not only about yourself and your personal gain, but also about all of us and our capacity to live together as a community.