# Exam 0 Exam 0

Registration opens: | Monday, August 27 |
---|---|

Exam starts: | Thursday, September 6 |

Exam ends: | Sunday, September 9 |

## Overview of “Exam 0”

Exam 0 is designed to be a low-stress introduction to the CBTF exam environment. This exam is worth only 40 points and 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.

### Topics Covered

- All lecture material through Friday, Aug. 31
- Content of
`lab_intro`

. - Mathematical foundations:
- Be able to give a closed form solution to a recurence relation.
- Reference: Chapter 12: Recursive Definition in “Building Blocks for Theoretical Computer Science” by Prof. Margaret Fleck (CS 173)
- Be able to indicate the big-O running time of common algorithms (eg: binary search, merge sort, etc).
- Reference: Chapter 14: Big-O in “Building Blocks for Theoretical Computer Science” by Prof. Margaret Fleck (CS 173)
- Be able to identify the relationship between two sets or functions (eg: reflexive, symmetric, transitive, ordered, equivalence, onto, one-to-one, etc)
- Reference: Chapters 6-8 in “Building Blocks for Theoretical Computer Science” by Prof. Margaret Fleck (CS 173)
- Be able to understand a standard proof and proof by induction.
- Reference: Chapters 3 and 11 in “Building Blocks for Theoretical Computer Science” by Prof. Margaret Fleck (CS 173)