What is sorting?
Organizing data in a specified order or groups.
What is searching?
Searching is looking for specific values within a large data set.
What is an undecidable problem? And give one example.
These problems are theoretically impossible to solve by any algorithm.
ex.) halting problem
What is parallel computing?
Is a computational model where a problem or program is broken into multiple smaller sequential computing operations that are performed simultaneously in parallel.
What is the equation for merge sort?
y = x log2(x)
What are the different types of searching?
Sequential/Linear, Binary
What is the difference between undecidable problems and intractable problems?
Undecidable problem - impossible
Intractable problem - impossible to solve in reasonable time (too inefficient)
What is Distributed Computing?
It is where multiple network computers are used to solve a problem that only a single computer cannot solve.
Explain how to do a bucket sort.
Put them into their own "buckets" (one for each) and then take them out of their buckets in order.
How do you do a linear search?
What are 3 ways to create a strong password?
-non-personal information
-not too short
-not using the same password for multiple different accounts
What is one benefit and one con of parallel computing?
Benefits: computing can scale up (faster when more processors are added)
Con: there is a limitation on the efficiency
What does the bubble sort graph look like?
It is a quadratic function/parabola.
Using a binary search, if you have 8 items, how many guesses should it take to find the item you are looking for?
How can you solve an intractable problem? Is it the most optimal?
You can use heuristic solutions that produce a fast and often correct solution to the problem. But they can't be proved to be optimal.
What is Speedup and how do you calculate it?
Speedup is the improvement in the amount of time a parallelized program takes to solve a problem. The calculation is, dividing the time sequentially by the time it took in parallel.