This website is an archive of the Spring 2019 semester of CS 225.

**→ Click here to view the current semester.**

Back to Exams
# Exam 0

### Topics Covered

Exam 0 is designed to be a low-stress introduction to the CBTF exam environment. This exam focuses primarily on foundational knowledge you have from your prerequisite classes.

Exam 0 is 50 minutes long and includes both multiple choice questions and a simple programming question.

- All lecture material through January 18th.
- Content of
`lab_intro`

. - Mathematical foundations:
- Be able to give a closed form solution to a recurence relation.
- Be able to indicate the big-O running time of common algorithms (eg: binary search, merge sort, etc).
- Be able to identify the relationship between two sets or functions (eg: reflexive, symmetric, transitive, ordered, equivalence, onto, one-to-one, etc)
- Be able to understand a standard proof and proof by induction.

**Points:**40

**Registration:** Tuesday, January 15

**Start:** Thursday, January 24

**End:** Sunday, January 27