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

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

dotsdots

Algorithms for Searching, Sorting, and Indexing

Description

This course covers basics of algorithm design and analysis, as well as algorithms for sorting arrays, data structures such as priority queues, hash functions, and applications such as Bloom filters.

Algorithms for Searching, Sorting, and Indexing can be taken for academic credit as part of CU Boulder’s Master of Science in Data Science (MS-DS) degree offered on the Coursera platform. The MS-DS is an interdisciplinary degree that brings together faculty from CU Boulder’s departments of Applied Mathematics, Computer Science, Information Science, and others. With performance-based admissions and no application process, the MS-DS is ideal for individuals with a broad range of undergraduate education and/or professional experience in computer science, information science, mathematics, and statistics. Learn more about the MS-DS program at https://www.coursera.org/degrees/master-of-science-data-science-boulder.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 Algorithms for Searching, Sorting, and Indexing are most similar to the requirements found in Business Analyst job advertisements.

Similarity Scores (Out of 100)

Learning Sequence

Algorithms for Searching, Sorting, and Indexing is a part of one structured learning path.

Coursera
University of Colorado Boulder