Build the Finance Skills That Lead to Promotions — Not Just Certificates
Python, Prompt Engineering, Data Science — Build the Skills Employers Want Now
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore the fundamental concepts of asymptotic notation in this graduate-level lecture from Carnegie Mellon University's "CS Theory Toolkit" course. Delve into Big O, Little O, Big Omega, Little Omega, poly(), O-tilde, and standard form functions. Learn from Professor Ryan O'Donnell as he covers essential math and computer science fundamentals for research in theoretical computer science. Gain insights from recommended resources such as "Asymptopia" by Joel Spencer, "Concrete Mathematics" by Graham-Knuth-Patashnik, and "Asymptotic Methods in Analysis" by Dick de Bruijn. Access additional course materials through CMU's Diderot system for a comprehensive understanding of these crucial concepts in computer science theory.
Syllabus
Introduction
Little O
Twiddle
Omega twiddle
Examples
Taught by
Ryan O'Donnell