JAVA Beginner FREE TRACK ~18 Hours +320 XP Reward

Java Data Structures & Algorithmic Problem Solving Struktur Data Java & Penyelesaian Masalah Algoritmik

Develop strong computer science foundations and algorithmic problem-solving skills in Java. Implement dynamic arrays, linked nodes, hash tables, stacks, queues, recursion, binary search, and sorting algorithms with automated test-driven cloud labs. Kembangkan fondasi ilmu komputer yang kuat dan keterampilan pemecahan masalah algoritmik di Java. Implementasikan array dinamis, linked list, tabel hash, stack, queue, rekursi, binary search, dan algoritma pengurutan dengan lab cloud berbasis pengujian otomatis.

Course Syllabus & ModulesSilabus & Modul Kursus

Module 1: Collections Framework, Generics & Linear Structures Modul 1: Framework Koleksi, Generics & Struktur Linier

ArrayList internal capacity resizing, generics, LinkedList nodes, stacks, and queues. Resize kapasitas internal ArrayList, generics, node LinkedList, stack (tumpukan), dan queue (antrean).

4 LessonsPelajaran

1.1 Java Collections Framework: Generics & Dynamic ArrayList 1.1 Framework Koleksi Java: Generics & Dynamic ArrayList

Theory 20 mins

1.2 ArrayList Deduplication & Frequency Counter Challenge 1.2 Tantangan Deduplikasi ArrayList & Frekuensi Elemen

Interactive code 20 mins

1.3 Linked Nodes, Stacks & Queue Structures 1.3 Node Terhubung, Struktur Stack & Queue

Theory 20 mins

1.4 Balanced Parentheses & Expression Validator Challenge 1.4 Tantangan Validasi Kurung Siku & Ekspresi Seimbang

Interactive code 20 mins

Module 2: Hash Tables, Recursion & Divide-and-Conquer Modul 2: Tabel Hash, Rekursi & Divide-and-Conquer

HashMap bucket hashing, recursion call frames, binary search, and log-linear sorting (Quicksort/Mergesort). Hashing bucket HashMap, stack frame rekursi, binary search, dan pengurutan log-linear (Quicksort/Mergesort).

4 LessonsPelajaran

2.1 Hash Tables, HashSets & HashMap Collision Resolution 2.1 Tabel Hash, HashSet & Resolusi Tabrakan HashMap

Theory 20 mins

2.2 Recursion Mechanics, Call Stack & Binary Search 2.2 Mekanisme Rekursi, Call Stack & Binary Search

Theory 20 mins

2.3 Divide-and-Conquer Sorting: QuickSort vs MergeSort 2.3 Pengurutan Divide-and-Conquer: QuickSort vs MergeSort

Theory 20 mins

3.1 Custom Generic Stack & Queue Engine Lab 3.1 Lab Mesin Stack & Queue Generik Kustom

Lab 20 mins Isolated Lab

Module 3: Data Structure & Algorithmic Cloud Labs Modul 3: Lab Struktur Data & Algoritma Cloud

Building custom generic stacks, LRU caches, inverted document indexers, binary search trees, and priority task schedulers. Membangun stack generik kustom, cache LRU, pengindeks dokumen terbalik, pohon biner (BST), dan penjadwal tugas prioritas.

4 LessonsPelajaran

3.2 LRU (Least Recently Used) Cache Lab 3.2 Lab Cache LRU (Least Recently Used)

Lab 20 mins Isolated Lab

3.3 Word Frequency & Inverted Document Indexer Lab 3.3 Lab Frekuensi Kata & Indeks Dokumen Terbalik

Lab 20 mins Isolated Lab

3.4 Binary Search Tree (BST) & In-Order Traversal Lab 3.4 Lab Pohon Biner Pencarian (BST) & Traversal In-Order

Lab 20 mins Isolated Lab

3.5 Priority Task Scheduler with Min-Heap Lab 3.5 Lab Penjadwal Tugas Prioritas dengan Min-Heap

Lab 20 mins Isolated Lab