Math 211

Exam #2 review

Cavaet:  Although I try to be comprehensive in these exam reviews, please understand that you are responsible for the material covered since the last exam.  If you notice something that I have missed, please do let me know.

The second hour exam will be Friday, Oct. 17, and will cover sections 1.8 (functions) through section 2.5.  In your review look over assigned problems, definitions, and biographical essays.  In particular, be able to

• Discuss functions:  1-1, onto, domain, range (image), inverse, composition.
• Be comfortable with special functions, including floor, ceiling, log and exponential.
• Be able to define what an algorithm is.
• Be able to describe the algorithms for linear and binary search and for bubble sort.
• Be able to define and use O, Ω, Θ.  Be able to find the "witnesses" for these.
• Know the order of the functions we have used so far for O (log n, n, nlog(n), etc.).
• Be comfortable with the basic number theory discussed so far, including modular arithmetic and the statement of the fundamental theorem of arithmetic..
• Be able to convert amongst radix 2, 8, 10, and 16, and to do binary arithmetic.

Any questions?  Please ask!  - Bob