[CORE 6b] teaches advanced algorithms and data structures with Java at a university level. Students complete weekly graded homework assignments and monthly quizzes. Most students find it necessary to attend our student help hours for support with learning these advanced concepts. This is our most challenging core class and is comparable to the material found in international computing competitions.
[CORE 6b] teaches advanced algorithms and data structures with Java at a university level. Students complete weekly graded homework assignments and monthly quizzes. Most students find it necessary to attend our student help hours for support with learning these advanced concepts. This is our most challenging core class and is comparable to the material found in international computing competitions.
[CORE 6a] or permission of instructor
[CORE 6a] or permission of instructor
Linked Lists Review
Generics & Inheritance Review, Intro to Trees
Trees
Binary Search Trees
Heaps & Priority Queues
String Encoding
Huffman Trees
Huffman Tree Project Intro
Project Work Time
Regular Expressions
Review of Trees, Intro to Graphs
Graphs Search
Graph Paths
Pathfinder Project Introduction
Pathfinder Project Time - Graph Construction & Display
Dijkstra's Algorithm
Project Time - Path Finding
Project Time - Debugging & Bonus Features
Linked Lists Review
Generics & Inheritance Review, Intro to Trees
Trees
Binary Search Trees
Heaps & Priority Queues
String Encoding
Huffman Trees
Huffman Tree Project Intro
Project Work Time
Regular Expressions
Review of Trees, Intro to Graphs
Graphs Search
Graph Paths
Pathfinder Project Introduction
Pathfinder Project Time - Graph Construction & Display
Dijkstra's Algorithm
Project Time - Path Finding
Project Time - Debugging & Bonus Features