Make sure you actually know everything outlined here,
including Bash, VMs, Containers, Git, Standard Input/Output (I/O),
etc.:
../../ClassGeneral.html
The schedule and due dates will be updated as we progress through the
semester (on Canvas).
Please check back regularly for changes.
Content/Introduction.html
Show Canvas landing page
Show Canvas calendar
Review ../../ClassGeneral.html
Show Zulip
Show syllabus quiz
Show git-classes with CI/CD results, example:
https://git.mst.edu/make-grade/make-grade-haskell
Meet your in-class neighbors
As backgroun for discrete math itself,
you should already know recursion and functional programming,
along with some understanding of computational complexity.
This is a review of those ideas in Python:
../ComputationalThinking/Content/13-AlgorithmsSoftware.html
../ComputationalThinking/Content/14-Recursion.html
../ComputationalThinking/Content/21-FunctionalProg.html
This is a review of those ideas in C++:
../../DataStructures/Content.html
Sections here on “Mathematical preliminaries and recursion” and
“Algorithm analysis”
If you do not, then read the above links well enough to understand them.