Course
Unit 18
Lesson 23

Unit 18 - Programming Projects for Advanced Computer Science AB

Unit 1 - Introduction to Advanced Computer Science AB

1.1 About This Course

1.2 Master Schedule of Due Dates for the Academic Year 2017-2018

1.3 Build Your Virtual Notebook (On-Line Website)

Unit 2 - Course Tools

2.1 Coding Bat and Practice It

2.2 Mini Course on IntelliJ

2.3 Version Control: GitHub

Unit 3 - New (But Basic) Java Topics

3.1 Access Modifiers in Java

3.2 Abstract Base Classes (ABC) in Java

3.3 Interfaces in Java

3.4 How an Interface can Inherit from Another Interface

3.5 Java's Ternary (Conditional) Operator

3.6 Switch Statements

3.7 Java's Primitive Data Type: char

3.8 Formatted Output Using Java's printf() Method

3.9 Designing Good Classes: Copy Constructors and .equals() Methods

3.10 More About final

3.11 The Truth About ArrayLists

3.12 Using Iterators and ListIterators for Speedier Parsing

3.13 Introduction to enum

3.14 Advanced enum Concepts

Unit 4 - Advanced Programming Concepts and Java Techniques

4.1 Review of Object Oriented Programming (OOP) Principles

4.2 What is an Abstract Data Type (ADT)?

4.3 Assertions, Pre- and Post-Conditions and Loop Invariants

4.4 Memoization & BigInteger: A Faster Way to Calculate Large Fibonacci

4.5 Using Serializable to Make Objects Persist in Java

4.6 Methods with a Variable Number of Arguments

4.7 Using a Script Engine

4.8 Anonymous Inner Classes

4.9 Comparable vs. Comparator

4.10 Mutl-threading Concepts

4.11 Review of Immutability

4.12 StringBuffer & StringBuilder: Building a Mutable String in Java

Unit 5 - Software Architecture and Modeling

5.1 Intro to Modeling

5.2 Model-View-Controller (MVC) Architecture

5.3 Communicating Between Java Objects

5.4 Singletons Design Pattern in Java

5.5 Static Factory Methods

5.6 Lazy Iniitialization

5.7 Factory Design Pattern in Java

5.8 Building Classes with Generic Types

Unit 6 - Analysis of Algorithms

6.1 What is Big-O?

6.2 Video: Introduction to Big-O Notation

6.3 Video: The Mathematics of Big-O

6.4 When to Apply and When Not to Apply Big-O

6.5 Big-O: Examples in Code

6.6 Review Questions on Big-O Notation

Test on Analysis of Algorithms

Unit 7 - Introduction to Data Structures

7.1 Intro DS: Overview

7.2 Intro DS: What is Big-O?

7.3 Intro DS: Linked Lists

7.4 Intro DS: Stacks

7.5 Intro DS: Queues

7.6 Intro DS: Priority Queues

7.7 Intro DS: Graphs

7.8 Intro DS: Trees & Binary Trees

7.9 Intro DS: Intro to Hashing

7.10 Intro DS: Hashing - Open Addressing versus Separate Chaining

7.11 Intro DS: Cryptographic Hashing

7.12 Review Questions on Intro to Data Structures

7.13 Test: Introduction to Data Structures

Unit 8 - Java Collections Framework: Maps, Sets, Lists, and Queues

8.1 Introduction to Java Collections Framework

8.2 Differences Between Vector and ArrayList in Java Collections

8.3 Sets

8.4 Differences Between HashSet, TreeSet, and LinkedHashSet in Java

8.5 Java's Set Interface and HashSet Library Class

8.6 Cloning Objects in a HashSet

8.7 Java's Map Interface and HashMap Library Class

8.8 Iterating Over a Map in Java Using EntrySet Method

8.9 Java's Pair Class

8.10 Practice with Maps and Sets

Unit 9 - Data Structures: Linked Lists

9.1 Intro to Linked Lists (Single, Double, and Circular)

9.2 Projects on Linked Lists

9.3 Circular Linked Lists

9.4 Project: Using a Circular Linked List to Solve the Josephus Problem

Unit 10 - Trees

10.1 Tree Vocabulary

10.2 TreeNode

10.3 Find the Minimum Height of a Binary Tree

10.4 Binary Search Trees

10.5 Traversing and Searching Trees: Pre-order, In-order, and Post-order

10.6 Using Binary Expression Trees to Convert Between Infix, Prefix, and Postfix Expressions

Test on Trees

Unit 11 - Graphs

11.1 Graphs: Eulerian Paths and Circuits

11.2 Traversing & Searching Graphs: Breadth First versus Depth First Searches

11.3 Graphs: Dijkstra's Algorithm

11.4 Project on Graphs: Generating a Maximal Independent Set

11.5 Test on Graphs

Unit 12 - Stacks and Queues

12.1 Permuting a String Using a Stack

12.2 Using a Stack to Parse a String Expression

12.3 Dijkstra's Two Stack Boogaloo

12.4 Using Stacks to Evaluate Prefix and Postfix Expressions

12.5 Using a Stack to Go from Infix to Postfix

12.6 Backtracking Using a Stack: A Rat in a Maze

12.7 Queues

12.8 Project: Dijkstra 2 Stack Boogaloo

Unit 13 - Preparing for Priority Queues

13.1 Review of Full, Complete and Perfect Trees

13.2 The Advantages of Indexing from 1 - YIKES!

13.3 How to Store a Complete Binary Tree in an Array

Unit 14 - Data Structures: Priority Queues and Heaps

14.1 What Is a Heap?

14.2 Diffences Between a Priority Queue and a Heap

14.3 Introduction to Priority Queues

14.4 Converting From a Max to Min Heap

14.5 Prority Queue: Insertion of New Elements

14.6 Priority Queue: Deletion of Elements Using Polling

14.7 Big-Oh Analysis of Heap Functions

14.8 How to Code a Heap from Scratch in Java

14.9 Heapsort

14.10 Revisiting the Dijkstra Shortest Path Algorithm

14.11 Huffman Coding Using a Heap

Unit 15 - Advanced Sorting Algorithms

15.1 Merge Sort

15.2 Quicksort

15.3 Counting and Bucket Sorts

15.4 Radixi Sort is a d-Dimensional Bucket Sort

15.5 Revisiting Heapsort

Unit 16 - Hashing

16.1 Review of Searching

16.2 Hashing: The Greatest Idea in Programming

16.3 More on Hash Tables

16.4 Java's Built-In HashMap (and Hashtable) Classes

16.5 Hashing for Security: Securing Passwords

16.6 Perfect Hash Functions: Cichelli's Method for Strings

16.7 Hashing Review

Unit 17 - Functional Java

17.1 Basics of Functional Programming

17.2 Lambda Expressions

17.3 Lambda Shortcuts

17.4 The Functional Interface in Java 8

17.5 Exception Handling with Lambdas

17.6 Miscellaneous Topics Related to Lambda Expressions

17.7 Introduction to Streams

17.8 Functional Techniques to Iterate over an enum

Unit 18 - Programming Projects for Advanced Computer Science AB

18.1 Project on Switch Statements: Converting from Letter to Numerical Grades

18.2 Project: Balanced Ternary Modeling - Ants on a Log

18.3 BigInteger Class and Memoization

18.4 Project on Enums: Playing Cards

18.5 Java Project on New Java Topics

18.6 Project: The Singleton Design Pattern

18.7 MVC, Lazy Initialization, Factory Methods: Battleship Lab

18.8 Project on Java Collections: Iterators

18.9 Project on Linked Lists: CD Library

18.10 Using a Library Tree Class to Display a Hierarchy

18.11 Converting Strings to Equations and Evaluating Them in Java

18.12 Project on Graphs: Dijkstra's Algorithm

18.13 Project on Trees: Binary Search Tree

18.14 Projects on Stacks & Queues

18.15 Project: Huffman Coding Using Priority Queues

18.16 Projects on Hashing

18.17 Project: Perfect Hashing on Strings Using Cichelli Method

18.18 Project: Using Java's Pair Class to Track Owners of Dogs

18.19 A Brief Review of Permutations and Combinations

18.20 Combinations in Java: Selecting K Items from an Array of N Objects

18.21 Permutations in Java: Rearranging Objects in an Array in Every Possible Way

18.22 Programming Project: Scrambled Equations

18.23 Using Java's Standard Stack Class in the Utility Library

18.24 Initializing and Using Hashmaps in Java

18.25 Understanding Backtracking

18.26 Programming Project: A Sudoku Solver Using Backtracking (Without Recursion)

Unit 19 - Review for Final Exam

Final Exam

20.1 Intro to Regular Expressions

20.2 Combining Regular Expressions

20.3 Introduction to the Pattern and Matcher Classes

20.4 Using Regular Expressions in Java

20.5 RegEx Project: Dollar Bill Poker

20.6 Regular Expressions Review Questions

Using Java's Standard Stack Class in the Utility Library