Computer Science A Study Library.

Primitive data types: int, double, boolean · Variable declaration and assignment · Arithmetic operators and operator precedence · Integer division and modulo operator · Calling methods on objects using dot notation · Constructor calls with the new keyword · String methods: length(), substring(), indexOf(), equals(), compareTo() · Math class methods: Math.abs(), Math.pow(), Math.sqrt(), Math.random() · Wrapper classes: Integer and Double · Autoboxing and unboxing · System.out.print() and System.out.println()

Boolean expressions using &&, ||, and ! · De Morgan's Laws · if / else if / else branching · Nested conditionals · while loops and loop termination conditions · for loops and loop control variables · Infinite loop detection and prevention · String traversal using index-based loops with substring() and charAt() · Nested loops and their output patterns · Compound assignment operators: +=, -=, *= · Comparing loop structures for efficiency and clarity

Writing class headers · Instance variables with private access modifier · Access modifiers: public and private · Writing default and parameterized constructors · Writing instance methods: getters, setters, and behavior methods · static vs. instance context and scope · The this keyword · Implementing toString() and equals() methods · Method overloading · Constructor headers and method headers

1D array creation, initialization, and traversal · Array algorithms: minimum, maximum, sum, average, count with condition · Linear search implementation and analysis · Selection sort and insertion sort: trace, understand, implement · ArrayList<E>: add(), remove(), get(), set(), size(), contains(), indexOf() · ArrayList traversal with for loops and enhanced for loops · Forward and backward ArrayList traversal patterns · Safe ArrayList element removal during iteration · 2D array creation and initialization · 2D array row-major and column-major traversal · 2D array partial traversal and boundary conditions · 2D array algorithms: row/column sums, searching, in-place mutation · File reading with java.io.File and java.util.Scanner · Scanner methods: nextLine(), nextInt(), hasNextLine() · Data analysis with collections · Recursion tracing: predicting output of recursive methods