This is my area of expertise, but I am very old and it was decades ago that I studied these things in earnest.

Unit 6 has been simplified to a large extent. That slide you mention is based on O(n^2) compared to O(2^n). A straightforward comparison.

Traveling Salesman is NP-hard. NP means non-deterministic polynomial time. Hard means don’t hold your breath while the computer runs it. It is believed to grow faster than polynomial but not as fast as exponential. Which might make it a bad example in a simplified presentation.

The algorithm was recently improved Computer Scientists Find New Shortcuts for Infamous Traveling Salesman Problem | WIRED. You might find that interesting.

Traveling Salesman includes a kicker you may not have considered when you calculated O(n!). And that is that you want the shortest path. Asking for any path is not NP-hard.

Unit 6 Lesson 3 Level 3 is a better example. The question compares 2^n to n^20 (and a few others.) Neither of those two are good choices for a solution. When you compare exponential growth to polynomial growth it is not unusual to see the latter worse than the former in the short term. When we compare O(2^n) to O(n^20) we will see a difference after our computer has been running for a few months, maybe a year. They both get hard to solve real fast. But that makes it a good thing to explore with the students.

I created an App Lab app to explore that with the class when I get to it. Code.org - App Lab

You can experiment with different classes of algorithms by adding new formulas. I have the 4 choices from that question coded up already.

Use the bigger N button to increase the max value of N. As N gets to about 150 we see O(2^n) outgrow O(n^20). Less than that and O(n^20) seems less efficient.