Review Slides

src/teaching/cse-250/2022fa/index.erb

@@ -357,6 +357,8 @@ schedule:
       topic: Midterm Review
       due: PA2
       dow: Mon
+      section_b:
+        slides: slide/20b-Review.html
     - date: 10/19/22
       special: Midterm Exam
       links:

src/teaching/cse-250/2022fa/slide/15b-Graphs.erb

@@ -54,7 +54,7 @@ attribution: Based on slides by Tamassa Goodrich
   <h4 class="slide_title">Other Applications</h4>
   
   <ul>
-    <li>Transporation (Flight/Road/Rail Routing)</li>
+    <li>Transportation (Flight/Road/Rail Routing)</li>
     <li>Protein/Protein Interactions</li>
     <li>Social Networks</li>
     <li>Dependency Tracking (e.g., <b>make</b>)</li>

src/teaching/cse-250/2022fa/slide/19b-Orderings.erb

@@ -1,8 +1,8 @@
 ---
 template: templates/cse250_2022_slides.erb
-title: Graph Exploration
+title: Orderings, Priority Queues
 date: Oct 14, 2022
-textbookTBD: Ch. 15.3
+textbook: Ch. 13.1
 cat: graphics/19b/cat.png
 ---
 

src/teaching/cse-250/2022fa/slide/4b-AsymptoticNotation.erb

@@ -179,7 +179,7 @@ textbook: "Ch. 7.3-7.4"
 
     <dt>$\exists c_{high}, n_{0}$ s.t. $\forall n > n_{0}$, $f(n) \leq c_{high}\cdot g(n)$</dt>
     <dd class="fragment">There is some $c_{high}$ that we can multiply $g(n)$ by so that $f(n)$ is <u>always</u> smaller than $c_{high}g(n)$ for values of $n$ above some $n_0$</dd>
-  </ul>
+  </dl>
 </section>
 
 <section>