AP Computer Science A - Java Programming Language

Unit 1: In this unit, students learn about the primitive data types in Java, including integers, booleans, and characters. They also learn about arithmetic operations and how to use them with primitive types. Unit 2: This unit covers object-oriented programming concepts in Java. Students learn how to create and use objects, and how to access object fields and methods. They also learn about constructors, instance variables, and encapsulation. Unit 3: In this unit, students learn about boolean expressions and if statements in Java. They learn how to use boolean operators and how to write conditional statements to control program flow. Unit 4: This unit covers iteration in Java. Students learn how to use loops to iterate over collections of data, such as arrays and ArrayLists. They also learn about control statements like break and continue. Unit 5: This unit teaches students how to write classes in Java. They learn about the structure of a class, how to create objects from a class, and how to use constructors to initialize objects. Unit 6: This unit covers the use of arrays in Java. Students learn how to declare and initialize arrays, how to access array elements, and how to use loops to iterate over arrays. Unit 7: This unit teaches students about ArrayLists in Java. They learn about the difference between arrays and ArrayLists, how to create and modify ArrayLists, and how to use ArrayLists to store and manipulate data. Unit 8: In this unit, students learn about 2D arrays in Java. They learn how to declare and initialize 2D arrays, how to access elements in a 2D array, and how to use loops to iterate over a 2D array. Unit 9: This unit covers the concept of inheritance in Java. Students learn how to create subclasses that inherit properties and methods from a superclass. They also learn about polymorphism and how to use it to create more flexible code. Unit 10: In this unit, students learn about recursion in Java. They learn how to write recursive functions, how to use recursion to solve problems, and how to analyze the performance of recursive algorithms.