Evaluating and Fine-Tuning Regression Models in Python with Scikit-learn

Free Live ML Workshop #3 on Sep 3 - Register Now

dotsdots

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.

This resource is offered by an affiliate partner. If you pay for training, we may earn a commission to support this site.

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)