UDEMY 2021 - Algorithms and Data Structures in Java – Part II
- 1. UDEMY 2021 - Create Ethereum & Blockchain Applications Using Solidity
- 2. UDEMY 2021 - Ethereum : Decentralized Application Design & Development
- 3. UDEMY 2021 - ARP spoofing &Man In The Middle Attacks Execution &Detection
- 4. UDEMY 2021 - Ethical Hacking for Mobile Phones, Facebook & Social Media!
Data compression, tries, substring search and sorting
What Will I Learn?
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.
Hope you will like the course, let’s get started!
Who is the target audience?
Created by Holczer BalazsLast updated 4/2018EnglishEnglish [Auto-generated]
Size: 1 GB