Blog

You want to use FFT to compute

You found two alternatives to solve a problem of input size n. Check the fastest (i.e. smaller running time in big-O notation)

We introduced two versions of the Knapsack Problem: one where you are trying to fill a knapsack with some subset of n items which cannot be repeated (0/1 version), and another where you assume you have an unlimited supply of every one of the n items that you can put in the knapsack. We called the dynamic programming algorithm for the former Knapsack No Repeat and for the latter, we called it Knapsack Repeat. Let the running time for Knapsack No Repeat be f(n) and let g(n) be the running time for algorithm Knapsack Repeat. Assume both algorithms receive the same set of weights, values and the same capacity. Which one of the following is true:

A compound contains hydroxyl groups as its predominant functional group. Therefore, this compound _________.

Of the 4 most commonly found elements in living things, which has the most valence electrons? (I could not find a periodic table large enough for this question, so I have this one. Disregard the outlining of certain elements and the extra information on the bottom)     

Adding NH3 (ammonia) to water makes NH4+. What will be the general pH of this new solution, and what will happen to the ion concentrations?

The buffer reaction shown by this equation H2CO3 < ------ > H+ + HCO3-  indicate that

Which of the following would be considered to be a strong base?

Which functional group when attached to a hydrocarbon chain will allow that molecule to act as a base?

Rank these items in order from MOST basic to LEAST basic: 1. pH = 9 2. [H+] = 10-2 3. pH = 3 4. [H+] = 10-11 5. [H+] = 10-5