Applied Data Structures
[CORE 6b]
Full Course
Class Package
Class Description:
[CORE 6b] teaches advanced algorithms and data structures using Java at a college level. Students complete weekly graded homework assignments and monthly quizzes. Most students find it necessary to attend our student help hours for for support learning these advanced concepts. This is our most challenging core class and is comparable to the material found in international computing competitions.
Prerequisites:
[CORE 6a] or permission of instructor
Related Classes
Sample Projects
These are examples of projects that students create as they grow their skills in [CORE 6b]
Syllabus
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
All Class Times
- Classes Starting Soon ▼
- Classes in Session ▼
Summer Semester: Twice Per Week
* Student Help Hours Included. See time on the bottom of website.
** Instructors currently scheduled are not guaranteed and could change at KTBYTE's discretion
These times don't work for you?
* Press the plus button to add more availabilities.