Course
Unit 17
Lesson 22

Unit 17 - 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 - New (But Basic) Java Topics

2.1 Abstract Base Classes (ABC) in Java

2.2 Interfaces in Java

2.3 New Java Topics: How an Interface an Inherit from Another Interface

2.4 New Java Topics: Conditional Operator

2.5 New Java Topics: Switch Statements

2.6 New Java Topics: The Primitive char

2.7 Formatted Output

2.8 More About final

2.9 New Java Topics: Enums

2.10 The Truth About ArrayLists

2.11 New Java Topics: Iterators and ListIterators

2.12 New Java Topics: Copy Constructors and .equals() Methods

Unit 3 - Advanced Programming Concepts and Java Techniques

3.1 Version Control: GitHub

3.2 Review of Object Oriented Programming (OOP) Principles

3.3 What is an Abstract Data Type (ADT)?

3.4 Introduction to Loop Invariants

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

3.6 Using Serializable to Make Objects Persist in Java

3.7 Methods with a Variable Number of Arguments

3.8 Mutl-threading Concepts

3.9 StringBuffer & StringBuilder: Building a Mutable String in Java

3.10 Comparable vs. Comparator

3.11 Using a Script Engine

Unit 4 - Software Architecture and Modeling

4.1 Intro to Modeling

4.2 Model-View-Controller (MVC) Architecture

4.3 Communicating Between Java Objects

4.4 Static Factory Methods

4.5 Lazy Iniitialization

4.6 Factory Design Pattern in Java

4.7 Singletons Design Pattern in Java

4.8 Building Classes with Generic Types

4.9 Inner Classes and Static Inner Classes

Unit 5 - Analysis of Algorithms

5.1 What is Big-O?

5.2 Video: Introduction to Big-O Notation

5.3 Video: The Mathematics of Big-O

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

5.5 Big-O: Examples in Code

5.6 Review Questions on Big-O Notation

Test on Analysis of Algorithms

Unit 6 - Introduction to Data Structures

6.1 Intro DS: Overview

6.2 Intro DS: What is Big-O?

6.3 Intro DS: Linked Lists

6.4 Intro DS: Stacks

6.5 Intro DS: Queues

6.6 Intro DS: Graphs

6.7 Intro DS: Trees & Binary Trees

6.8 Intro DS: Intro to Hashing

6.9 Intro DS: Hashing - Open Addressing versus Separate Chaining

6.10 Intro DS: Cryptographic Hashing

6.11 Review Questions on Intro to Data Structures

6.12 Test: Introduction to Data Structures

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

7.1 Introduction to Java Collections Framework

7.2 Differences Between Vector and ArrayList in Java Collections

7.3 Sets

7.4 Differences Between HashSet, TreeSet, and LinkedHashSet in Java

7.5 Java's Set Interface and HashSet Library Class

7.6 Cloning Objects in a HashSet

7.7 Java's Map Interface and HashMap Library Class

7.8 Iterating Over a Map in Java Using EntrySet Method

7.9 Java's Pair Class

7.10 Practice with Maps and Sets

Unit 8 - Trees

8.1 Tree Vocabulary

8.2 TreeNode

8.3 Find the Minimum Height of a Binary Tree

8.4 Binary Search Trees

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

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

Test on Trees

Unit 9 - Graphs

9.1 Graphs: Eulerian Paths and Circuits

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

9.3 Graphs: Dijkstra's Algorithm

9.4 Test on Graphs

Unit 10 - Data Structures: Linked Lists

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

10.2 Projects on Linked Lists

10.3 Circular Linked Lists

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

Unit 11 - Stacks and Queues

11.1 Using a Stack to Parse a String Expression

11.2 Dijkstra's Two Stack Boogaloo

11.3 Using a Stack to Go from Infix to Postfix

11.4 Using Stacks to Evaluate Prefix and Postfix Expressions

11.5 Permuting a String Using a Stack

11.6 Backtracking Using a Stack: A Rat in a Maze

11.7 Queues

11.8 Project: Dijkstra 2 Stack Boogaloo

Unit 12 - Preparing for Priority Queues

12.1 Review of Full, Complete and Perfect Trees

12.2 The Advantages of Indexing from 1 - YIKES!

12.3 How to Store a Complete Binary Tree in an Array

Unit 13 - Data Structures: Priority Queues and Heaps

13.1 What Is a Heap?

13.2 Diffences Between a Priority Queue and a Heap

13.3 Introduction to Priority Queues

13.4 Converting From a Max to Min Heap

13.5 Prority Queue: Insertion of New Elements

13.6 Priority Queue: Deletion of Elements Using Polling

13.7 Big-Oh Analysis of Heap Functions

13.8 How to Code a Heap from Scratch in Java

13.9 Heapsort

13.10 Revisiting the Dijkstra Shortest Path Algorithm

13.11 Huffman Coding Using a Heap

Unit 14 - Advanced Sorting Algorithms

14.1 Merge Sort

14.2 Quicksort

14.3 Counting and Bucket Sorts

14.4 Radixi Sort is a d-Dimensional Bucket Sort

14.5 Revisiting Heapsort

Unit 15 - Hashing

15.1 Review of Searching

15.2 Hashing: The Greatest Idea in Programming

15.3 More on Hash Tables

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

15.5 Hashing for Security: Securing Passwords

15.6 Perfect Hash Functions: Cichelli's Method for Strings

15.7 Hashing Review

Unit 16 - Functional Java

16.1 Basics of Functional Programming

16.2 Lambda Expressions

16.3 Lambda Shortcuts

16.4 The Functional Interface in Java 8

16.5 Exception Handling with Lambdas

16.6 Miscellaneous Topics Related to Lambda Expressions

16.7 Introduction to Streams

Unit 17 - Programming Projects for Advanced Computer Science AB

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

17.2 Project: Balanced Ternary Modeling - Ants on a Log

17.3 BigInteger Class and Memoization

17.4 Project on Enums: Playing Cards

17.5 Java Project on New Java Topics

17.6 Project: The Singleton Design Pattern

17.7 Project on Java Collections: Iterators

17.8 Project on Linked Lists: CD Library

17.9 Using a Library Tree Class to Display a Hierarchy

17.10 Converting Strings to Equations and Evaluating Them in Java

17.11 Project on Graphs: Dijkstra's Algorithm

17.12 Project on Trees: Binary Search Tree

17.13 Projects on Stacks & Queues

17.14 Project: Huffman Coding Using Priority Queues

17.15 Projects on Hashing

17.16 Project: Perfect Hashing on Strings Using Cichelli Method

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

17.18 A Brief Review of Permutations and Combinations

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

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

17.21 Programming Project: Scrambled Equations

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

17.23 Initializing and Using Hashmaps in Java

17.24 Understanding Backtracking

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

Unit 18 - Review for Final Exam

Final Exam

19.1 Intro to Regular Expressions

19.2 Combining Regular Expressions

19.3 Introduction to the Pattern and Matcher Classes

19.4 Using Regular Expressions in Java

19.5 RegEx Project: Dollar Bill Poker

19.6 Regular Expressions Review Questions

Using Java's Standard Stack Class in the Utility Library