Explain the difference between algorithms and programs.

Explain the difference between data structures and abstract data types.

Explain the relationship between data representation, data structures, and algorithms.

What is the relationship between search algorithms and the searching problem?

What is the relationship between search algorithms and the autocomplete feature?

Why is algorithmic correctness difficult to determine?

What are some limitations of experimental analysis?

What are some benefits of experimental analysis over asymptotic analysis?

Why is a 1-element list the best-case situation for sequential search?

If phone numbers are ten digits long and can contain digits from zero through nine, what is the total number of potential phone numbers?

Why might we prefer a sub-optimal greedy algorithm over a correct brute-force algorithm?

What’s problematic about the statement, "municipal broadband planning reduces to Kruskal’s algorithm"?

Describe the relationship between the pivot element and the left and right sublists after the first partition in quicksort.

The runtime of Kruskal’s algorithm is in O(|E| log |E|) with respect to |E|, the number of edges. What primarily contributes to this linearithmic order of growth?

Both Prim’s algorithm and Dijkstra’s algorithm are greedy algorithms that organize vertices in a priority queue data structure. What is the difference between the ordering of vertices in the priority queue for Prim’s algorithm and Dijkstra’s algorithm?

What is the relationship between models of computation and algorithms?

What is the common difficulty preventing us from designing an efficient algorithm for solving NP-complete problems?

What are the consequences of P = NP?