Explore

Algorithms and Data Structures in Java - Part II

8 hours on-demand video

$ 12.99

Save Course

Go to Course

Brief Introduction

Data compression, tries, substring search and sorting

Description

This course is about data structures and algorithms. We are going to implement the problems in Java, but I try to do it as generic as possible: so the core of the algorithms can be used in C++ or Python. The course takes approximately 7 hours to complete. I highly recommend typing out these data structures several times on your own in order to get a good grasp of it.

Section 1:

what are prefix trees (tries)
basics operations: insertion, sorting and autocomplete
longest common prefix problem
prefix trees applications in networking

Section 2:

what are ternary search trees
basic operations: insertion and retrieval

Section 3:

substring search algorithms
brute-force substring search
Boyer-Moore substring search
Rabin-Karp algorithm

Section 4:

strings in programming
prefixes and suffixes
longest common prefix and longest repeated substring problem

Section 5:

basic sorting algorithms
bubble sort and selection sort
insertion sort and shell sort
quicksort and merge sort

Section 6:

what is data compression
run length encoding
Huffman-encoding
LZW compression and decompression

First, we are going to discuss prefix trees: modern search engines for example use these data structures quite often. When you make a google search there is an autocomplete feature because of the underlying trie data structure. It is also good for sorting: hashtables do not support sort operation but on the other hand, tries do support.

Substring search is another important field of computer science.You will learn about Boyer-Moore algorithm and we will discuss brute-force approach as well as Raabin-Karp method.

The next chapter is about sorting. How to sort an array of integers, doubles, strings or custom objects? We can do it with bubble sort, insertion sort, mergesort or quicksort. You will learn a lot about the theory as well as the concrete implementation of these important algorithms.

The last lectures are about data compression: run-length encoding, Huffman encoding and LZW compression.

Thanks for joining the course, let's get started!

Requirements

Requirements
Core Java
Eclipse or other IDE

Recommended for you

Data Structures and Algorithm Design Part I | 数据结构与算法设计(上)

Learn the basics of data structures and methods to design algorithms and analyze their performance. 本课程旨在围绕各类数据结构的设计与实现，揭示其中的规律原理与方法技巧；同时针对算法设计及其性能分析，使学生了解并掌握主要的套路与手段。 Knowledge in this area has been at the kernel of related curriculums....

Save Course

Modern C++ Concurrency in Depth ( C++17/20)

modern c++ concurrency features including memory model, lock free data structure, thread pools, coroutines. C++ programming language can be categorized under many topics....

Save Course