Sketching Algorithms | UC Berkeley CS 294-165 | Jelani Nelson

Explore the power of sketching algorithms in data structures and big data processing. Taught by renowned expert Jelani Nelson.

Introduction

This course covers sketching algorithms, which are a powerful tool in the field of data structures and algorithms. Sketching algorithms allow for efficient storage and processing of large datasets, making them highly relevant in the era of big data.

Highlights

• Covers a wide range of sketching techniques, including Count-Min Sketch, Bloom Filters, and Sparse Recovery.
• Taught by Jelani Nelson, a renowned expert in the field of sketching algorithms.
• Provides a strong theoretical foundation as well as practical applications of sketching algorithms.
• Includes hands-on exercises and programming assignments to reinforce the concepts learned.

Recommendation

This course is highly recommended for students and professionals interested in data structures, algorithms, and the challenges of working with large datasets. It provides a deep understanding of sketching algorithms and their applications, making it a valuable resource for anyone looking to enhance their skills in this field.

YouTube Videos