Beyond Math AcademyUniversity Math, CS & Software Engineering Campus
← All modules
University CS & Software Engineering · MODULE 5

Algorithms, Complexity & Applied CS Math

Big-O asymptotic bounds, divide-and-conquer recurrences, master theorem, modular arithmetic, and cryptographic number theory.

1

Discover: Algorithms, Complexity & Applied CS Math

Guided lesson · 3 practice labs · 10-question test

Start
2

Vocabulary: Algorithms, Complexity & Applied CS Math

Guided lesson · 3 practice labs · 10-question test

Start
3

Guided Example: Algorithms, Complexity & Applied CS Math

Guided lesson · 3 practice labs · 10-question test

Start
4

Skill Builder: Algorithms, Complexity & Applied CS Math

Guided lesson · 3 practice labs · 10-question test

Start
5

Patterns: Algorithms, Complexity & Applied CS Math

Guided lesson · 3 practice labs · 10-question test

Start
6

Real Life: Algorithms, Complexity & Applied CS Math

Guided lesson · 3 practice labs · 10-question test

Start
7

Problem Solving: Algorithms, Complexity & Applied CS Math

Guided lesson · 3 practice labs · 10-question test

Start
8

Create: Algorithms, Complexity & Applied CS Math

Guided lesson · 3 practice labs · 10-question test

Start
9

Explain: Algorithms, Complexity & Applied CS Math

Guided lesson · 3 practice labs · 10-question test

Start
10

Mastery: Algorithms, Complexity & Applied CS Math

Guided lesson · 3 practice labs · 10-question test

Start

Module Exam

Complete all 10 lesson tests, then score 8/10 on the exam.

Complete lessons