The CS OER

Table of Contents

CS 1

1. Introduction to Primitives in Java

   1. 1. Primitive Types and String

      2. Arithmetic Operations and Libraries (such as Math)

      3. User Interaction

2. Decision Structures

   1. 1. Decision Structures: if/else Statements

      2. Decision Structures: Multiple Conditions, if/else if Statements and the Use of the Nested if

      3. Decision Structures: Logical Operators

      4. Decision Structures: Switch Case

      5. String Comparisons and Ordering

3. Repetitive Structures (Loops and Recursion)

   1. 1. Repetitive Structures: The while, for, and do-while

      2. Repetitive Structures: Loop Validation

      3. Sequential Search for a String

      4. How to Read and Write Files

      5. How to Generate Random Numbers

4. Functions

   1. 1. Method definition and Method calls

      2. Divide and Conquer Example

      3. Identifying Primes: Object-Oriented Approach

5. Data Structures Part I: Arrays

   1. 1. Arrays: Declaration and Initialization

      2. Arrays: Implementation

      3. Arrays: Using Strings

      4. Arrays and Methods Pt. 1

      5. Arrays and Methods Pt. 2

6. Object Orientation Programming

   1. 1. OOP: Introduction

      2. OOP: Fields and Constructors, UML

      3. OOP: Setters, Getters, and Methods, Tester

      4. OOP: Tester Class

      5. OOP: Inheritance

      6. OOP: Inheritance Implementation

CS2

1. 2D Arrays

   1. 1. Representation/Accessing Elements in 2D Arrays

      2. Traverse 2D Arrays and Operations

2. Exceptions

   1. 1. Exception Handling: Introduction

      2. Exception Handling: The try/catch Blocks

      3. Exception Handling: The throws, throw, and extends

3. Recursion

   1. 1. Recursion: Intro and Stack

      2. Recursion: The factorial Method

      3. Recursion: The countOccurrences Method

      4. Recursion: The fibonacci Method

4. Algorithms Part I: Sorting

   1. 1. Sorting Algorithms: A Survey

      2. Sorting Algorithms: Bubble Sort

      3. Sorting Algorithms: Selection Sort

      4. Sorting Algorithms: Insertion Sort

      5. Sorting Algorithms: Merge Sort

      6. Sorting Algorithms: Quick Sort

      7. Sorting Algorithms: Analysis

5. Algorithms Part II: Searching

   1. 1. Linear Search: Visualization and Implementation

      2. Binary Search: Visualization and Implementation

      3. Analysis: Linear vs. Binary Search

6. Data Structures Part I: Linked Lists

   1. 1. Linked Lists: Introduction

      2. Linked Lists: The add() and isEmpty() Methods

      3. Linked Lists: The print() Method

      4. Linked Lists: The size() Method

      5. Linked Lists: The add(x,p) Method

      6. Linked Lists: The find() Method

      7. Linked Lists: The remove() Method

7. Data Structures Part II: Stack + Queue = Deque

   1. 1. Deque: The Ultimate ADT

8. Data Structures Part III: Trees

   1. 1. BST: Introduction

      2. BST: Traversals

      3. BST: The getHeight() and getSize() Methods

      4. BST: The countParents() Method

      5. AVL Tree: Introduction and Operations

      6. AVL Tree: Single Rotation to the Left

      7. AVL Tree: Double RL Rotation