X
Advanced Computer Science AB
Login
Announcements
Course
Registration
Show Syllabus
Hide Syllabus
Course
Unit 13
Lesson 20
Unit 13 - Programming Projects for Advanced Computer Science AB
13.1 Project on Switch Statements: Converting from Letter to Numerical Grades
13.2 Project: Balanced Ternary Modeling - Ants on a Log
13.3 BigInteger Class and Memoization
13.4 Project on Enums: Playing Cards
13.5 Java Project on New Java Topics
13.6 Project on Java Collections: Iterators
13.7 Project on Linked Lists: CD Library
13.8 Using a Library Tree Class to Display a Hierarchy
13.9 Converting Strings to Equations and Evaluating Them in Java
13.10 Project on Graphs: Dijkstra's Algorithm
13.11 Project on Trees: Binary Search Tree
13.12 Project: Huffman Coding Using Priority Queues
13.13 Projects on Hashing
13.14 Project: Perfect Hashing on Strings Using Cichelli Method
13.15 Project: Using Java's Pair Class to Track Owners of Dogs
13.16 A Brief Review of Permutations and Combinations
13.17 Combinations in Java: Selecting K Items from an Array of N Objects
13.18 Permutations in Java: Rearranging Objects in an Array in Every Possible Way
13.19 Programming Project: Scrambled Equations
13.20 Using Java's Standard Stack Class in the Utility Library
13.21 Initializing and Using Hashmaps in Java
13.22 Understanding Backtracking
13.23 Programming Project: A Sudoku Solver Using Backtracking (Without Recursion)
Using Java's Standard Stack Class in the Utility Library
Previous Page
Next Page
