Discrete Math

This course covers asymptotic analysis of algorithms. Students will learn about analyzing algorithm efficiency and complexity.

• Big-O Notation
• Big-Omega Notation
• Big-Theta Notation