Java: Non-Linear Data Structures

Overview

6-week cohort with live MIT Faculty sessions. Learn to scale AI beyond the pilot stage.

Code and run your first Java program about data structures and algorithms in minutes without installing anything!

This course is designed for learners familiar with Java basics and object-oriented programming. It provides a solid foundation of not just Java, but core data structures and algorithms topics that can be transferred to other languages. The modules in this course cover non-linear data structures like heaps, hash tables (and maps), graphs, and sets.

To allow for a truly hands-on, self-paced learning experience, this course is video-free. Assignments contain short explanations with images and runnable code examples with suggested edits to explore code examples further, building a deeper understanding by doing. You'll benefit from instant feedback from a variety of assessment items along the way, gently progressing from quick understanding checks (multiple choice, fill in the blank, and un-scrambling code blocks) to small, approachable coding exercises that take minutes instead of hours.

Syllabus

Explain, implement, and analyze heap-based data structures and algorithms.

Design, implement, and evaluate hash table–based solutions by applying hashing principles, collision resolution strategies, rehashing techniques, and security and scalability practices.

Define and implement graph and set abstract data types by constructing graphs with adjacency lists, performing core set operations, and selecting the appropriate data structure based on problem requirements.