Data Structures and Algorithms (IV)

Description

By learning this course, you will get a comprehensive grasp of Priority Queues and string match techniques, as well as their applications. By the end of this course, you will be able to understand/implement Bucketsort, Counting-sort, and Radixsort, understand the principle/implementation/application of different Priority Queues such as complete binary heap and leftist heap, understand and implement Heapsort, understand and implement typical string matching algorithms such as KMP, BM, and Karp-Rabin, implement and analyze advanced selection/sorting algorithms such as Quicksort, QuickSelect, LinearSelect, and Shellsort.


Read more.

Career Relevance by Data Role

The techniques and tools covered in Data Structures and Algorithms (IV) are most similar to the requirements found in Data Scientist job advertisements.


Similarity Scores (Out of 100)

Subscribe for updates and new courses
Or create a DataKwery.com account
Fast Facts
Techniques
AlgorithmsData Analysis

Similar Opportunities
NP-Complete Problems

edX - University of California, San Diego

Algorithms, Part II

Coursera - Princeton University

Data Structures and Algorithms (I)

Coursera - Tsinghua University

Advanced Algorithms and Complexity

Coursera - National Research University Higher School of Economics

Algorithmic Thinking (Part 1)

Coursera - Rice University

Algorithms and Data Structures Capstone

edX - University of California, San Diego