Exam 2 study outline
Completion requirements
Exam 2 will cover material from Chapter 6-8
Relations: representations and properties
Algorithms and their complexity
Sequences and sigma notation
Math induction (1 proof)
Recursion (recursive algorithms, specification of recursive structures)
In particular:
Relations: representations and properties
Algorithms and their complexity
Sequences and sigma notation
Math induction (1 proof)
Recursion (recursive algorithms, specification of recursive structures)
In particular:
Last modified: Tuesday, December 12, 2017, 2:41 PM