Algorithms and Data Structures in Java – Part II Free Download
Data compression, tries, substring search and sorting
What you’ll learn
- Grasp the fundamentals of algorithms and data structures
- Develop your own algorithms that best fit to the personal need
- Detect non-optimal code snippets
- Get to know data compression
- Get to know sorting algorithms
- Core Java
- Eclipse or other IDE
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.
- what are prefix trees (tries)
- basics operations: insertion, sorting and autocomplete
- longest common prefix problem
- prefix trees applications in networking
- what are ternary search trees
- basic operations: insertion and retrieval
- substring search algorithms
- brute-force substring search
- Boyer-Moore substring search
- Rabin-Karp algorithm
- strings in programming
- prefixes and suffixes
- longest common prefix and longest repeated substring problem
- basic sorting algorithms
- bubble sort and selection sort
- insertion sort and shell sort
- quicksort and merge sort
- what is data compression
- run length 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!
Who this course is for:
- This course is meant for university students with quantitative background (mathematics, computer science) but anyone with core java knowledge can get a good grasp of the lectures