Additional Notes / Readings
A link to
the CLRS textbook
(Cormen, Leiserson, Rivest, Stein) to give you access to it via Colby's library.
Some LaTeX resources:
A
recommended LaTeX resource
, as presented on
the website of Prof. Scott Taylor
(Colby Mathematics).
Overleaf
is a commonly used, browser-based editing environment for LaTeX; you are welcome to do your TeX-work in Overleaf, if you'd like. There's a
Learn LaTeX in 30 Minutes
guide from Overleaf, but I recommend that you also familiarize yourself with other LaTeX resources, such as those from Prof. Taylor's page mentioned above.
A few very simple LaTeX Templates and Samples
(.tex file)
(PDF file)
that could be used for presenting algorithms and specifications. (It was originally put together for Colby's CS376, but it works equally well for CS375.)
Some
example recursive algorithms and inductive arguments
for CS375, to supplement our lecture notes. This document is made specifically for this CS375 course.
An
online Scheme interpreter
(from a
berkeley.edu
website) that I use for some demonstrations of recursion and functional programming.
Also, here's some
very brief starter code that runs on that interpreter
, in case you want to program LList algorithms in Scheme. You can copy / paste the code into the interpreter window and hit CTRL-Enter to see two runs of an LLMax algorithm.
Please note
, however, that I am not a Scheme expert, and I may well not be able to answer questions about Scheme, so please be forewarned!