Todo

This exercise ought to get expanded to a much richer set of variations on the question.

Todo

Rewrite along these lines: Here are two measures of "out of order": inversions and min-swaps. Selection sort (especially w/ optimization) meets min-swaps, but that's not a useful measure in general. Insertion sort tracks inversions, it is I + n. Now, if we had an exchange sort, what would cost be? Go on to the proof.

Todo

Rewrite along these lines: A classic form of code tuning is "test to save work". For each of our three sorting algorithms, we have a potential "test to save work" "optimization". The question is: When is the cost of test worth the work saved? Let's look at each of the three.

Todo

To make students more engaged in the GrowthRates exercise, we may need a tool that allows students to input two growth rate functions. Then the tool should plot the graph of both functions and mark their crossing point. The student also should be allowed to play with the constant values for both functions and see that this only changes the crossing point but doesn't change which function grows faster than the other.

Todo

Fix and return hashAV.html to here.

The following visualization lets you test out different combinations of hash function and collision resolution, on your own input data.

Todo

Provide a unified AV that can allow the user to pick which topsort (DFS or Queue), with or without cycles in the graph. The start of this is in AV/Development/topSortAV* (for just random DFS), AV/Development/qTopSortAV.* (for just random queue-based topsort), and AV/Development/topsortAVs* (tries to unify).

Todo

Provide an AV that runs on a random graph. An initial version is in AV/Development/dijkstraAV.*.

Todo

AV here to demonstrate the minVertex implementation.

Todo

Add version where you can click to get the node inserted.

Todo

Make a proper visualization for perfect hashing, that lets the user specify a set of input keys, computes the hash function, then lets the user input keys to the table. A proper explanation for the process should be part of the visualization.

Todo

Practice fft algorithm. Maybe only practice the final for loop since the rest of the algorithm is recursivly dividing the polynomial and performing fft on the smaller polynomials.

Todo

Put first BlockPy exercise here.

Todo

Put second BlockPy exercise here.

Todo

Put third BlockPy exercise here.

Todo

Why does the code look for an unvisited value first? Is there an easier way?

Todo

Show the minimal form of the next drawing without trap state, etc.

Todo

Throughout this module, there are references to equations, both on this page and in the Summations module. These should be made into proper cross-references rather than hard-coded equation numbers.

Todo

Need exercises for inserting to and deleting from doubly linked lists.

Todo

Battery of MCQs for content.

Todo

Consider the Quicksort implementation for this module, where the pivot is selected as the middle value of the partition. Give a permutation for the values 0 through 7 that will cause Quicksort to have its worst-case behavior.

There are a number of possible correct answers. To assess the answer, will need to run Quicksort over student's partition, and verify that at each step it will generate new partitions of size 6, 5, 4, 3, 2, then 1.

Todo

This is a good question, but its not nearly enough for a chapter summary.

Todo

Add a battery of questions to test knowledge of the implementations.

Todo

Summary exercise for graph traversals.

Todo

Summary battery of questions for Dijkstra's algorithm

Todo

Proficiency exercise for Prim's algorithm.

Todo

Todo

Need an exercise to study lower bound on Colletz function

Todo

The slideshow should subsume the next paragraph and the caption.

Todo

Replace this figure with an applet that demonstrates the use of handles.

Todo

Show figure

Todo

Provide a proficiency exercise that randomly alternates between proficiency for DFS-based and queue-based Topsort. The bare beginnings of an exercise can be found in AV/Development/topSortDFSPE.*

Todo

Is this really correct? In this example, x is a single non-terminal. In general, we can't have just a terminal on the left side, can we? Later, more complicated grammars might have a series of things on the left side with suitable restrictions. Do we want to bring that up here?

Todo

We need to think about a technique for visualizing the running time of some loop constructs. This can be very similar to how we visualize reaching the closed form solution of summations.

Todo

The figure above and the following text should all be rolled into a slideshow.

Todo

The preceding paragraph could be turned into a slideshow.

Todo

Replace this figure with a slideshow that demonstrates the use of reference counts (including the problem with cycles).

Todo

Put here a visualization that demonstrates the use of reference counts.

Todo

Replace this figure with an AV that demonstrates DSW.

Todo

Replace the above figure with a slideshow that incorporates the following paragraph.

Todo

Replace the following paragraph with a slideshow.

Todo

Incorporate the following into a slideshow.

Todo

Incorporate the following paragraph into a slideshow with the figure below it.

Todo

Provide a slideshow to demonstrate the following example.

Todo

This slideshow illustrates Dijkstra's algorithm using the heap. The start vertex is A. All vertices except A have an initial value of \(\infty\). After processing Vertex A, its neighbors have their D estimates updated to be the direct distance from A. After processing C (the closest vertex to A), Vertices B and E are updated to reflect the shortest path through C. The remaining vertices are processed in order B, D, and E. Changes in the D array should be shown along with this.

Todo

Slideshow to demonstrate the relative costs of the two algorithms.

Todo

Replace the previous diagram with a slideshow illustrating the concept of MCST.

Todo

Implement a slideshow demonstrating the Priority Queue version of Prim's algorithm

Todo

Slideshow of Book Figure 6.16: shows full and complete Karytrees for K=3. In practice, most applications of Karytrees limit them to be either full or complete.

Full and complete 3-ary trees. (a)~This tree is full (but not complete). (b)~This tree is complete (but not full).}{ThreeTree}

Todo

Replace the images above with a slideshow that presents first the NFA, and then shows, step-by-step, the process of building the DFA.

Todo

Replace the images above with a slideshow that presents, step-by-step, the process of minimizing the DFA.

Todo

Provide a summary battery of questions.

Todo

Where did that last claim about the linear probing cost come from?

Todo

We need a proficiency exercise.

Todo

Give an example of this type of representational change.

Todo

Explain how Perfect Hashing works.