Blog

The length of a path in a graph is equal to

Consider the following binary elements.  Show the result after performing one pass of the Radix Exchange sort algorithm.   1   0   1   0   0 0   1   0   1   0 0   0   1   0   1 1   1   1   1   1 1   1   0   0   0 0   0   0   0   1 1   1   1   0   0 1   0   1   0   1 0   1   1   1   0  0   0   1   1   0  

Draw the 2-3-4 trees that result when you insert the keys                                     E  N  J  O  Y  T  H  E  B  R  E  A  K into an initially empty tree: Draw each intermediate tree — make sure that you split the 4 nodes at the proper time! When inserting, less  than goes to the left and greater than/equal goes to the right.

When implementing Dijkstra’s Single-Source Shortest path algorithm, the value and path for a node should be updated whenever a path is found that is at least as good as the one that has already been found.

Match each treatment with it’s primary proposed mechanism of action 

In Red/Black trees, a rotation is always needed when a two-node is made into a three-node.

The complexity for the worst case search operation for Red/Black trees is O (n).

Using the same values as was given in Question #16, show the resulting table when using a hash function of h1(k) = x mod 11 and linear probing. 

Consider the following definition of a node to be used by the container class My_queue.  class myNode {             private int datum; private myNode next;       …   };   Write a method of the class My_queue that would be used to enqueue an integer that is passed into it.  You can also assume that the pointers “front” and “back” have already been declared and initialized correctly.  Use the interface/signature line given below.   void enqueue (int data)

Consider a queue of integers implemented as a circular array with maximum size equal to the constant CAPACITY.  Assume that the two pointers are front and back and that the first element to be enqueued will go into the array at position 0.  For this implementation, there is no variable to keep track of the number of elements that are in the queue at any time.  Give the values of the front and back index values after each of the following nine operations.  If an operation cannot be done, note that and do not change either of these variable values.  Use the table given as a pattern for your solution. enqueue (11), dequeue (), enqueue (22), enqueue (33), dequeue(), dequeue (), enqueue (44), enqueue (55), dequeue()   Solution pattern: After operation 1:  front =        back = After operation 2:  front =        back  =