- Unit One: Primitive Types
- Unit Two: Using Objects
- Unit Three: Boolean Expressions and if Statements
- Unit Four: Iteration
- Unit Five: Writing Clauses
- Unit Six: Array
- Unit Seven: ArrayList
- Unit Eight: 2D Array
- Unit Nine: Inheritance
- Unit Ten: Recurision
Unit One: Primitive Types
Goal: To learn the fundamentals of Java and other foundational concepts for coding.
- The main primitive types focused on by College Board are int, double, and boolean
- The primitive type that is building block for a String is a single character called char
- String is an array of char’s and the uppercase S in String means it is a Class
- String is a Non-Primitive data type that is a Class in Java
- With Java, we use scanner for an input
- The two keys to programming are inputs and outputs
- Primitive types rarely ever stand alone
Unit Two: Using Objects
Goal: Explore reference data in order to represent real-world objects in a digital world and discover methods to initiate more complex operations
Unit Three: Boolean Expressions and if Statements
Goal: Dive into the building blocks of algorithms and use conditional statements to solve problems and have control over your results
Unit Four: Iteration
Goal: Learn about iteration which is used for repetition in algorithms
Unit Five: Writing Clauses
Goal: Explore real-world interactions that can be expressed through code by organizing behaviors and attribites into classes – also learn about the legal and ethical implications of programming
Unit Six: Array
Goal: Learn techniques and standard algorithms to work with collections of data structures
Unit Seven: ArrayList
Goal: Delve into data setts, exploring ArrayList objects for larger amounts of data, as well as the privacy concerns for your personal data storage
Unit Eight: 2D Array
Goal: Experiment with data sets represented in a table
Unit Nine: Inheritance
Goal: Manipulate programming without altering original code by using subclasses to create a hierarchy
Unit Ten: Recurision
Goal: Solve larger problems by solving small versions of the same problems using recursive methods