VR SCHOOL
ONLINE
Nexus Home
Course Catalog
Meta-Campus
Status
Enter The Nexus
Home
Courses
Challenging Difficult Problems
Curriculum
6 Sections
14 Lessons
10 Weeks
Expand all sections
Collapse all sections
Chapter 15: Working with Greedy Algorithms
2
1.1
Deciding When It Is Better to Be Greedy
10 mins
1.2
Finding Out How Greedy Can Be Useful
10 mins
Chapter 16: Relying on Dynamic Programming
2
2.1
Explaining Dynamic Programming
10 mins
2.2
Discovering the Best Dynamic Recipes
10 mins
Chapter 17: Using Randomized Algorithms
2
3.1
Defining How Randomization Works
10 mins
3.2
Putting Randomness into your Logic
10 mins
Chapter 18: Performing Local Search
3
4.1
Understanding Local Search
10 mins
4.2
Presenting local search tricks
10 mins
4.3
Solving Satisfiability of Boolean Circuits
10 mins
Chapter 19: Employing Linear Programming
2
5.1
Using Linear Functions as a Tool
10 mins
5.2
Using Linear Programming in Practice
10 mins
Chapter 20: Considering Heuristics
3
6.1
Differentiating Heuristics
10 mins
6.2
Routing Robots Using Heuristics
10 mins
6.3
Explaining Path Finding Algorithms
10 mins
This content is protected, please
login
and
enroll
in the course to view this content!
Modal title
Main Content