Algorithms and Data Structures in Java – Part II

Algorithms and Data Structures in Java – Part II Udemy Free download. Data compression, tries, substring search and sorting.

This course is written by Udemy’s very popular author Holczer Balazs. It was last updated on July 29, 2020. The language of this course is English but also have Subtitles (captions) in English (US) languages for better understanding. This course is posted under the categories of Other, Data Structures and IT & Software on Udemy.

There are more than 5156 people who has already enrolled in the Algorithms and Data Structures in Java – Part II which makes it one of the very popular courses on Udemy. You can free download the course from the download links below. It has a rating of 4.6 given by 435 people thus also makes it one of the best rated course in Udemy.

The Udemy Algorithms and Data Structures in Java – Part II free download also includes 4 hours on-demand video, 4 articles, 48 downloadable resources, Full lifetime access, Access on mobile and TV, Assignments, Certificate of Completion and much more.

What am I going to learn?

If you are wondering what you are going to learn or what are the things this course will teach you before free downloading Algorithms and Data Structures in Java – Part II, then here are some of things:

• 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

What do I need?

These are the very few things you need first before you can free download Algorithms and Data Structures in Java – Part II:

• Core Java
• Eclipse or other IDE

Is this course right for me?

If you are still confused whether you should free download Algorithms and Data Structures in Java – Part II or is it the course you are actually looking for, then you should know that this course is best 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

Course 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!

Free Download Algorithms and Data Structures in Java – Part II