ibarland

Lectures

Graphs: DFS/BFS, shortest path (Dijkstra), topological sort, minimum spanning tree lect15—paths; orderings
scribbles: pdf
regular expressions, regular grammars, FSMs; Graph definitions; Stable marriages.
scribbles: pdf
Also note regexp for float, and Wikipedia on Stable Marriage Problem.
Week 13: finish counting (inclusion/exclusion), recurrence (mergesort, master th'm, fib), grammars and FSM. Some partial notes.
scribbles: pdf
Week 12: counting
(Some tentative notes on counting with more examples. )
scribbles: pdf
Week 11: Strong induction (breaking chocolate bars), Recursion, recursive data (SList, Tree), algorithms and proofs on recursive data (Tree height).
scribbles: pdf
Week 10: exam/hw review; sum tricks; induction intro
scribbles: pdf and dotsOnForehead—dots on foreheads: induction
Finally, some entirely-other notes on induction.
Week 9: arithmetic (converting bases, arithmetic on bit-strings)
scribbles: pdf
Week 8: Review Big-Oh; Σ1-n, gcd.
scribbles: html pdf
Week 7: Review sets; Big-Oh.
scribbles: html pdf
Some other notes; skip to the section on big-Oh.
Week 6: Review sets; functions.
scribbles: html pdf
Week 5: Review proofs; Sets.
scribbles: html pdf
Week 4: sets, functions and relations. Also, some sample problems and solutions.
Week 3: scribbles: html

©2007, Ian Barland, Radford University
Last modified 2007.Dec.04 (Tue) Please mail any suggestions
(incl. typos, broken links)
to iba�rlandrad�ford.edu