exhibit: teacher to students, pre-class email, Silicon Forest May, 2022

--===============2001026183468163841==
Content-Type: multipart/alternative; boundary="00000000000098266705de850f03"

--00000000000098266705de850f03
Content-Type: text/plain; charset="UTF-8"

From: Sunshine Elite Education
Date: Sun, May 8, 2022 at 12:07 PM
Subject: Data Structure and Algorithms in Python: Sunday May 8: Pre Class
Prim's Algorithm


Greetings guys --

In the old days of purely paper textbooks, adding to them or changing them
was hard and only happened from one edition to the next, with maybe years
in between.

Today, those of us using Jupyter Notebooks within a version control system
for textbooks, likely have the ability to update them often.  We now think
in terms of an electronic textbook that has the ability to change
continuously through frequent new "versions" (instread of through
relatively infrequent "editions").

Along those lines...

At https://github.com/4dsolutions/elite_school

I have expanded ADS_sandbox_6.ipynb with new material regarding Prim's
algorithm for finding the least costly spanning tree within a graph.

Here's a Youtube I cite and include screenshots from:
https://youtu.be/Uj47dxYPow8

Prim's Algorithm: Minimum Spanning Tree (MST)
371,043 views
Jun 23, 2016
EducateYourself <https://www.youtube.com/channel/UC10JldFF3n7mRSGX6QfrQAA>
2.07K subscribers
Short example of Prim's Algorithm, graph is from "Cormen" book.


Another resource I recently added, a new link from our textbook:
https://www.geeksforgeeks.org/5-best-books-for-competitive-programming/

Might these be books from your library if you see CP in your future?  Are
any of them online?  Maybe you already have some data structure and
algorithms books you would like to recommend and/or share about.

I've included a few recommendations of my own e.g. Math Adventures with
Python for example.  I show a picture of its author, in front of my house.

See you at 6 pm.

Kirby


*Course Name*: Data Structure and Algorithms in Python
*Datetime*: 01/29-06/19 Wednesday,Sunday 6:00pm-7:00pm
*Location*: Online10

Thanks,
Sunshine Elite Education
------------------------------------------------

--00000000000098266705de850f03
Content-Type: text/html; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr"><div class=3D"gmail_default" style=3D"font-family:arial,he=
lvetica,sans-serif;font-size:small"><br></div>From: <b class=3D"gmail_sende=
rname" dir=3D"auto">Sunshine Elite Education</b><span dir=3D"auto"></span><=
br><div class=3D"gmail_quote"><div dir=3D"ltr" class=3D"gmail_attr">Date: S=
un, May 8, 2022 at 12:07 PM<br>Subject: Data Structure and Algorithms in Py=
thon: Sunday May 8:  Pre Class Prim&#39;s Algorithm<br><br></div><br><p>Gre=
etings guys --<br><br>In the old days of purely paper textbooks, adding to =
them or changing them was hard and only happened from one edition to the ne=
xt, with maybe years in between.<br><br>Today, those of us using Jupyter No=
tebooks within a version control system for textbooks, likely have the abil=
ity to update them often.=C2=A0 We now think in terms of an electronic text=
book that has the ability to change continuously through frequent new &quot=
;versions&quot; (instread of through relatively infrequent &quot;editions&q=
uot;).<br><br>Along those lines...</p>
<p>At <a href=3D"https://github.com/4dsolutions/elite_school" target=3D"_bl=
ank">https://github.com/4dsolutions/elite_school</a><br><br>I have expanded=
 ADS_sandbox_6.ipynb with new material regarding Prim&#39;s algorithm for f=
inding the least costly spanning tree within a graph.<br><br>Here&#39;s a Y=
outube I cite and include screenshots from:<br><a href=3D"https://youtu.be/=
Uj47dxYPow8" target=3D"_blank">https://youtu.be/Uj47dxYPow8</a></p>
<p>Prim&#39;s Algorithm: Minimum Spanning Tree (MST)<br>371,043 views <br><=
span id=3D"m_-4895090160822896721dot"></span>Jun 23, 2016</p>
<div id=3D"m_-4895090160822896721text-container"><a dir=3D"auto" href=3D"ht=
tps://www.youtube.com/channel/UC10JldFF3n7mRSGX6QfrQAA" target=3D"_blank">E=
ducateYourself</a></div>
<div id=3D"m_-4895090160822896721upload-info">2.07K subscribers</div>
<div id=3D"m_-4895090160822896721description">Short example of Prim&#39;s A=
lgorithm, graph is from &quot;Cormen&quot; book.</div>
<div id=3D"m_-4895090160822896721content">
<div>=C2=A0</div>
</div>
<p>Another resource I recently added, a new link from our textbook:<br><a h=
ref=3D"https://www.geeksforgeeks.org/5-best-books-for-competitive-programmi=
ng/" target=3D"_blank">https://www.geeksforgeeks.org/5-best-books-for-compe=
titive-programming/</a><br><br>Might these be books from your library if yo=
u see CP in your future?=C2=A0 Are any of them online?=C2=A0 Maybe you alre=
ady have some data structure and algorithms books you would like to recomme=
nd and/or share about.</p>
<p>I&#39;ve included a few recommendations of my own e.g. Math Adventures w=
ith Python for example.=C2=A0 I show a picture of its author, in front of m=
y house.<br><br>See you at 6 pm.<br><br>Kirby<br><br><br><b>Course Name</b>=
: Data Structure and Algorithms in Python<br><b>Datetime</b>: 01/29-06/19 W=
ednesday,Sunday 6:00pm-7:00pm<br><b>Location</b>: Online10<br><br> Thanks,<=
br> Sunshine Elite Education <br> -----------------------------------------=
-------</p><p><br></p>
</div></div>

--00000000000098266705de850f03--

--===============2001026183468163841==
Content-Type: text/plain; charset="us-ascii"
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Content-Disposition: inline

_______________________________________________
Edu-sig mailing list -- [email protected]
To unsubscribe send an email to [email protected]
https://mail.python.org/mailman3/lists/edu-sig.python.org/
Member address: [email protected]

--===============2001026183468163841==--