Merge branch 'master' of gram.cse.buffalo.edu:ODIn/Website

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

@@ -357,6 +357,8 @@ schedule:
       topic: Midterm Review
       due: PA2
       dow: Mon
+      section_a:
+        slides: slide/20b-Review.html
       section_b:
         slides: slide/20b-Review.html
     - date: 10/19/22
@@ -367,6 +369,10 @@ schedule:
     - date: 10/21/22
       topic: Organizing Cat Pictures
       dow: Fri
+      section_a:
+        slides: slide/21-AllYourBase.pdf
+      section_b:
+        slides: slide/21-AllYourBase.pdf
   - week: 9
     lectures:
     - date: 10/24/22

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

@@ -245,7 +245,7 @@ cat: graphics/19b/cat.png
 
   <p>A <b>Topological Sort</b> of a partial order $(A, \leq_1)$ is <i>any</i> total order $(A, \leq_2)$ over $A$ that "agrees" with $(A, \leq_1)$</p>
 
-  <p>For any two elements $x, y \in X$: 
+  <p>For any two elements $x, y \in A$: 
     <ul>
       <li>If $x \leq_1 y$ then $x \leq_2 y$</li>
       <li>If $y \leq_1 x$ then $y \leq_2 x$</li>

src/teaching/cse-250/2022fa/slide/20b-Review.erb

@@ -1,7 +1,7 @@
 ---
 template: templates/cse250_2022_slides.erb
 title: Midterm Review
-date: Oct 14, 2022
+date: Oct 17, 2022
 ---
 
 <section>
@@ -226,11 +226,11 @@ scala&gt; println(s.mkString(", ")
   <p>$f(n) \in O(g(n))$ iff...</p>
 
   <dl>
-    <dt>$\exists c_{low}, n_{0}$ s.t. $\forall n > n_{0}$, $f(n) \geq c_{low}\cdot g(n)$</dt>
-    <dd>There is some $c_{low}$ that we can multiply $g(n)$ by so that $f(n)$ is <u>always</u> bigger than $c_{low}g(n)$ for values of $n$ above some $n_0$</dd>
+    <dt style="color: #ddd;">$\exists c_{low}, n_{0}$ s.t. $\forall n > n_{0}$, $f(n) \geq c_{low}\cdot g(n)$</dt>
+    <dd style="color: #ddd;">There is some $c_{low}$ that we can multiply $g(n)$ by so that $f(n)$ is <u>always</u> bigger than $c_{low}g(n)$ for values of $n$ above some $n_0$</dd>
 
-    <dt style="color: #ddd;">$\exists c_{high}, n_{0}$ s.t. $\forall n > n_{0}$, $f(n) \leq c_{high}\cdot g(n)$</dt>
-    <dd style="color: #ddd;">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>
+    <dt>$\exists c_{high}, n_{0}$ s.t. $\forall n > n_{0}$, $f(n) \leq c_{high}\cdot g(n)$</dt>
+    <dd>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>
   </dl>
 </section>
 
@@ -240,11 +240,11 @@ scala&gt; println(s.mkString(", ")
   <p>$f(n) \in \Omega(g(n))$ iff...</p>
 
   <dl>
-    <dt style="color: #ddd;">$\exists c_{low}, n_{0}$ s.t. $\forall n > n_{0}$, $f(n) \geq c_{low}\cdot g(n)$</dt>
-    <dd style="color: #ddd;">There is some $c_{low}$ that we can multiply $g(n)$ by so that $f(n)$ is <u>always</u> bigger than $c_{low}g(n)$ for values of $n$ above some $n_0$</dd>
+    <dt>$\exists c_{low}, n_{0}$ s.t. $\forall n > n_{0}$, $f(n) \geq c_{low}\cdot g(n)$</dt>
+    <dd>There is some $c_{low}$ that we can multiply $g(n)$ by so that $f(n)$ is <u>always</u> bigger than $c_{low}g(n)$ for values of $n$ above some $n_0$</dd>
 
-    <dt>$\exists c_{high}, n_{0}$ s.t. $\forall n > n_{0}$, $f(n) \leq c_{high}\cdot g(n)$</dt>
-    <dd>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>
+    <dt style="color: #ddd;">$\exists c_{high}, n_{0}$ s.t. $\forall n > n_{0}$, $f(n) \leq c_{high}\cdot g(n)$</dt>
+    <dd style="color: #ddd;">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>
   </dl>
 </section>
 
@@ -426,8 +426,8 @@ scala&gt; println(s.mkString(", ")
     </tr>
 
     <tr>
-      <td>$O(n)$</td>
       <td>remove</td>
+      <td>$O(n)$</td>
       <td>$O(n)$ or $O(n-i)$</td>
       <td>$O(n)$ or $O(i)$</td>
       <td>$O(1)$</td>