Algorithms for Searching, Sorting, and Indexing

Description

Sriram Sankaranarayanan

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.

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)

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

Tools
JupyterPython

Techniques
AlgorithmsApplied MathematicsArraysData AnalysisData ScienceFunctionsProgrammingStatistical Analysis

Similar Opportunities
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

Computational Thinking for Problem Solving

Coursera - University of Pennsylvania

Data Structures and Algorithms (IV)

Coursera - Tsinghua University