Congratulations! You have completed (and survived) CHM 116!  It was a pleasure to share the semester with you, and I hope you have a truly fantastic summer!  This is a free question – Pick YES if you would like to get the free points!   Grades will be calculated as quickly as possible after the Final Exam closes on Tuesday, May 6 at 11:59 pm MST.  Announcements will go out to let you know that point totals have been added to Canvas.  Please don’t email with questions about your grades – I won’t have any answers for you if you haven’t seen an announcement.  And don’t worry, you will get a chance to review your scores before grades are submitted to the University.   Congratulations on crossing the finish line!

The following figure shows a red-black tree (RBT) T in which a circle denotes a red node, a square denotes a black node, and the NIL nodes are not shown (to save space). The number inside a circle/square is the key value of the corresponding node. The label (upper-case letter) next to a node is a pointer pointing to the memory location of the corresponding node. You should use the label when referring to a node.   (a) Suppose that we want to insert key 26 into the tree in the figure. We first allocate memory for a tree node P and set its color to red and its key to 26. Then we insert it into tree T as if inserting into a binary search tree. After BST insertion (before RBT insertion fixup), the parent of P is [a]   (b) Suppose that we want to insert key 26 into the tree in the figure. We first allocate memory for a tree node P and set its color to red and its key to 26. Then we insert it into tree T as if inserting into a binary search tree. After BST insertion (before RBT insertion fixup), which property of RBT is violated? [b]   (c) Suppose that we want to insert key 26 into the tree in the figure. We first allocate memory for a tree node P and set its color to red and its key to 26. Then we insert it into tree T as if inserting into a binary search tree. In the resulting RBT,  (after RBT insertion fixup), the color of node E is [c]   (d) Suppose that we want to insert key 26 into the tree in the figure. We first allocate memory for a tree node P and set its color to red and its key to 26. Then we insert it into tree T as if inserting into a binary search tree. In the resulting RBT,  (after RBT insertion fixup), the left child of node P is [d]   (e) Suppose that we want to insert key 26 into the tree in the figure. We first allocate memory for a tree node P and set its color to red and its key to 26. Then we insert it into tree T as if inserting into a binary search tree. In the resulting RBT,  (after RBT insertion fixup), the parent of node P is [e]   (f) Suppose that we want to delete the node D with key 10 from the RBT. After the BST deletion, we need to perform deletion fixup. What case is this deletion fixup?  [f]   (g) Suppose that we want to delete the node D with key 10 from the RBT. In the resulting RBT (after the deletion fixup), what is the left child of node A? [g]   (h) Suppose that we want to delete the node D with key 10 from the RBT. In the resulting RBT (after the deletion fixup), what is the color of node H? [h]   (i) Suppose that we want to delete the node D with key 10 from the RBT. In the resulting RBT (after the deletion fixup), what is the left child of node H? [i]   (j) Suppose that we want to delete the node D with key 10 from the RBT. In the resulting RBT (after the deletion fixup), what is the right child of node H? [j]

This question is concerned with hashing with open addressing, where the table size is 13 (indexed from 0 to 2) and the (linear) probing sequence is defined by h'(k) = k mod 13 and h(k, i) = (h'(k) + i) mod 13. Assume that the content of the hash table T is as follows: T[0] = 13 T[1] = 14 T[2] = DELETED T[3] = 15 T[4] = NIL T[5] = 5 T[6] = DELETED T[7] = 19 T[8] = NIL T[9] = 9 T[10] = 23 T[11] = 24 T[12] = 25   The last cell (index to the table) probed by Hash-Search(T, 18) is

This question is concerned with hashing with open addressing, where the table size is 13 (indexed from 0 to 2) and the (linear) probing sequence is defined by h'(k) = k mod 13 and h(k, i) = (h'(k) + i) mod 13. Assume that the content of the hash table T is as follows: T[0] = 13 T[1] = 14 T[2] = DELETED T[3] = 15 T[4] = NIL T[5] = 5 T[6] = DELETED T[7] = 19 T[8] = NIL T[9] = 9 T[10] = 23 T[11] = 24 T[12] = 25   The first cell (index to the table) probed by Hash-Search(T, 18) is

There are two sequences X= and Y=. You need to use the dynamic programming algorithm taught in class to compute a longest common subsequence (LCS) of X and Y. You need to compute the values of c[i, j] and b[i, j]. For the value of b[i, j], N denotes an up arrow, W denotes a left arrow, NW denotes an arrow to the upper-left. The value of c[5, 5] is

This question is concerned with hashing with open addressing, where the table size is 13 (indexed from 0 to 2) and the (linear) probing sequence is defined by h'(k) = k mod 13 and h(k, i) = (h'(k) + i) mod 13. Assume that the content of the hash table T is as follows: T[0] = 13 T[1] = 14 T[2] = DELETED T[3] = 15 T[4] = NIL T[5] = 5 T[6] = DELETED T[7] = 19 T[8] = NIL T[9] = 9 T[10] = 23 T[11] = 24 T[12] = 25   The last cell (index to the table) probed by Hash-Insert(T, 27) is

Choose which label corresponds to this function: What structure (s) is responsible for the majority of the refractory (bending of light to focus on the retina) power of the eye? A. Ciliary body B. Cornea and lens C. Iris D. Anterior cavity with aqueous humor E. Posterior cavity with vitreous humor

According to the brief video on the Mexican-American War, American settlers were drawn to California due to… 

In terms of revenues produced, what was the leading cash crop grown in the United States in the nineteenth century?

The largest immigrant group in the cities of the Northeast came to the United States from which country?