Additional Notes / Readings
A link to
the CLRS textbook
(Cormen, Leiserson, Rivest, Stein) to give you access to it via Colby's library.
A
recommended LaTeX resource
, as presented on
the website of Prof. Scott Taylor
(Colby Mathematics)
As background material about propositional logic that will be needed for CS376, here are some supplementary lecture note slides about
propositions and truth tables
. (These notes were originally put together for a different audience, but they provide background that might be useful for some CS376 students, too.) Please feel free to ask me any questions about them!
A good
resource about binary numbers, binary addition, and binary multiplication
, posted by Prof. Rebelsky at Grinnell College Computer Science. For CS376, we only really need to know the parts about converting binary numbers to decimals, binary addition, binary multiplication, and converting decimals to binary, but every part of it is useful in general for CS applications.
A few very simple LaTeX Templates and Samples
(.tex file)
(PDF file)
that could be used for presenting algorithms and specifications, put together by your CS376 Prof.
An example proof
of a relatively simple proposition about sets (
For all S, S is a subset of S
), to illustrate the details present in such a proof.
An example proof
about the size of the power set of finite sets (from Small Assignment 0), to illustrate subtleties about the induction in the proof.
An example inductive proof
that "our favorite summation formula" is correct, to illustrate the details present in such a proof.