Algorithms & Data Structures

This is the most common entry point for mathematics and is taken by students who completed geometry in grade 8 or the summer before grade 9.  It is a three semester sequence and is our version of a combined algebra II/precalculus course.

The properties of the real numbers and of functions, and the solution of equations in one variable are introduced. The discussion of functions includes all forms of algebraic, exponential, logarithmic, and circular functions. The study of each function includes a precise definition, a consideration of graphs and applications, an analysis of distinguishing features, and an identification of related tangents and slope.

The definition, properties,and application of matrices are studied. The discussion of functions includes all forms of algebraic, exponential, logarithmic, and circular functions. The study of each function includes a precise definition, a consideration of graphs and applications, an analysis of distinguishing features, and an identification of related tangents and slope.

Algorithms & Data Structures Unit Outline

Semester 1

• Java syntax and style

• Primitive data types, variables, and arithmetic

• Conditional statements and boolean logic

• Iterative control structures

• Strings

• Methods

• Exceptions

• Objects and classes

• Arrays

Semester 2

• Programming in Java

• Algorithm runtime analysis (Big O)

• Sorting and searching algorithms

• Memory

• Objects, classes, and object-oriented design

• Class hierarchies and inheritance

• Recursion

• Linear data structures (Arrays, 2D-Arrays, ArrayLists, etc.)

• Traversal algorithms