Blog

Consider the following equilibrium reaction: CH4 (g)  +  2 H2S (g)   ⇌   CS2 (g)   +  4 H2 (g)           Kc= 4.28 x 10−4 Which of the following statements best describes the composition of the reaction mixture at equilibrium?

Consider the following pH curve plots for four different titrations:   Which plot shows the expected pH curve when nitric acid, HNO3, is titrated by potassium hydroxide, KOH?

Copper metal, Cu (s), is produced by running a current through a solution of Cu2+ in an electrolytic cell. How many grams of copper metal can be deposited from Cu²⁺(aq) when a current of 1.50 A is run for 75 min? Hint:  F = 96,500 C/mol e− Hint:  1 A = 1 C/s

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!

Think about all of the assignments that you’ve done throughout this semester in this course (FND 430 & Lab). Which assignment(s) stood out to you? What did you like about them? 

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

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 b[5, 6] 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

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   How many cells does Hash-Delete(T, 19) probe? Please note that this question does not ask which cell is probed? It asks about HOW MANY.

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-Insert(T, 27) is