Calculate the pH of a solution containing [c]M pyridine, C5H5N. (Kb = 1.7×10-9) Express your answer to two decimal places.

 PbCl2 has a Ksp of 1.1×10−5. Solutions of lead (II) nitrate and aluminum chloride are mixed, forming a solution containing 0.020 M Pb(NO3)2 and 0.010 M AlCl3. What can be said of this solution?

The following anions can be separated by precipitation as lead salts: OH-, I–, CrO42–, AsO43- . If Pb2+ is added to a solution containing the four anions (each anion at a concentration of 0.10 M) in what order will they precipitate?   First, [I] Second, [II] Third, [III] Fourth, [IV]   Compound Ksp PbCrO4= 1.8 x 10–14 Pb3(AsO4)2= 4.1 x 10–36 Pb(OH)2= 2.8 x 10–16 PbI2= 8.7 x 10–9

Which one(s) of the following combinations (I to VI) that after being mixed can possibly create a buffer solution? Choose an answer containing all those combinations  I. HIO3 and KOH II. NH3 and HBr III. HNO2 and NaNO2 IV. H2SO4 and Na2SO4 (assume H2SO4 deprotonates completely into SO42-) V. HNO3 and NH4NO3 VI. CH3NH2 and CH3NH3Cl 

Calculate the wavelength (in nm) of the blue light emitted by a mercury lamp with a frequency of 6.88 × 1014 Hz. 

For a process at constant pressure, 5250 joules are released. This quantity is equivalent to

Given the following reactions 2S (s) + 3O2 (g) → 2SO3 (g) ΔH = -790 kJ   S (s) + O2 (g) → SO2(g) ΔH = -297 kJ the enthalpy of the reaction in which sulfur dioxide is oxidized to sulfur trioxide 2SO2 (g) + O2 (g) → 2SO3 (g)is ________ kJ.

Write a class called ItemOrder that stores information about an item being ordered. Each ItemOrder object should keep track of its item number (a string), an integer quantity, and a price per item. The price will be passed to the constructor as an integer number of pennies. For example: ItemOrder* item1 = new ItemOrder(“007”, 3, 36); Notice that the quantity is passed as a parameter before the price in the constructor, so this indicates an order for item number 007 with a quantity of 3 at 36 cents each. The total price for this order would be 108 cents. In addition to the constructor described above, the class should include the following public member functions and operator overloads: member function description getItem() returns the item number for this item as a string getPrice() returns the total price for this order in pennies getQuantity() returns the total quantity this order is for operators description

O(N2) Sort Write the state of the elements in the vector below after each of the first 3 passes of the outermost loop of the selection sort algorithm. vector numbers {63, 9, 45, 72, 27, 18, 54, 36}; selectionSort(numbers); after pass 1: [p1] after pass 2: [p2] after pass 3: [p3] Merge Sort Trace the complete execution of the merge sort algorithm when called on the vector below, similarly to the example of merge sort shown in the lecture slides. Show the sub-vectors that are created by the algorithm and show the merging of sub-vectors into larger sorted vectors. vector numbers {22, 88, 44, 33, 77, 66, 11, 55}; mergeSort(numbers); Make sure to format your answers with each sub-vectorsurrounded by { } braces, such as {1, 2} {3, 4}. 1st split      [s1] 2nd split     [s2] 3rd split      [s3] 1st merge   [m1] 2nd merge  [m2] 3rd merge   [m3] Binary Search Suppose we are performing a binary search on a sorted vector called numbers initialized as follows: // index 0 1 2 3 4 5 6 7 8 9 10 11 12 13 vector numbers {-2, 0, 1, 7, 9, 16, 19, 28, 31, 40, 52, 68, 85, 99}; ​ int index = binarySearch(numbers, 5); Write the indexes of the elements that would be examined by the binary search (the mid values in our algorithm’s code) and write the value that would be returned from the search. Assume that we are using the binary search algorithm shown in class. indexes examined: [e1] values returned:     [e2]

Write a function called filterDistance that takes a reference to a vector of pointers to Point objects, an individual Point object and a real number representing a distance as parameters. Your function should move any Points in the vector that are a greater distance from individual Point than the passed in distance to the end. They can end up in any order after your function runs as long as all points greater than the passed in distance away are after all points less than or equal to the passed in distance. For example if we run the code below: vector points {new Point(1, 2), new Point(90, 200), new Point(100, 100), new Point(4, 5), new Point(1, 2), new Point(100, 200)}; Point location(10, 10); filterDistance(points, location, 30); We will find points contains points (1, 2), (4, 5), (1, 2) before points (90, 200), (100, 100), (100, 200) as the distance between the first three and location is less than or equal to 30 and the distance between location and the last three is greater than 30. Point objects have the following public members: Name Description Point(int x, int y) constructs a point with the given coordinates int getX() returns the x coordinate int getY() returns the y coordinate double distance(Point p) returns the distance between this point and the passed in point