SUBJECT MATTER:

• Book sections 1.5 through 2.3
• Lectures up to and including March 5.

• Exams are closed book. One 81/2 by 11 sheet of paper (crib sheet) can be used for reference to study notes. No other information is allowed.
• Bring your own paper and stapler to class
• CALCULATORS WILL BE ALLOWED DURING THIS EXAM
• Selection of exam problems will give emphasis to the topics emphasized in the lectures and the problems assigned as homework.

 

Functions (one-to-one, onto, neither, not a function) Inverse Function (invertable) Important Functions (be able to compute) Floor Ceiling Integer Fraction Sequences and Summations (be able to compute or derive a relationship) arithmetic progression geometric progression general progression summations closed form of summations Big-O (be able to derive) polynomials log n (be able to change base)

factorial Algorithms definition linear search binary search Complexity of algorithms (Table 1. Page 109) Integer division Computing factors Determining prime factors (by hand, not with calculator) Division algorithm GCD LCM Modular Arithmetic (both positive and negative numbers) Congruences Cryptology Hashing function Caesar cipher Newton-Ralphson Iteration for transcendental equations