1/9
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai |
|---|
No analytics yet
Send a link to your students to track their progress
Exponential algorithms
algorithms that take 2^n steps to complete
Optimization problem
Tries to find the best possible solution
Parallel algorithms
problems are broken into small pieces some of which are run simultaneously
Sequential algorithms
programs which run in order, one step at a time.
Linear algorithms
algorithms that take n steps to complete
Speedup
the time used to complete a task sequentially divided by the time to complete a task in parallel
Heuristics
provide a good-enough solution when actual solution is impossible
Undecidable algorithms
problems for which no algorithms can provide a correct yes or no answer
Unreasonable algorithms
Algorithms with no solution that can not be found in a reasonable amount of time
Distributed programs
can be run on thousand on millions of computers to solve giant problems