Inorganic Chemistry Question:
Give an example of 2 sets of elements that display the n and n+10 similarity.



Inorganic Chemistry Question: Give an example of 2 sets of elements that display the n and...
2- Give two examples of organic compounds and two examples of inorganic compounds Organic Compounds Inorganic Compounds 3- For each molecule below, write the molecular formula and the condensed formula. Molecule Molecular Formula Condensed Formula -0-00- 4- Define isomers and give an example. 5- Complete the table. n(number of carbons ) Alkane CnH2n+2 Alkene CnH2n Alcohol CnH2n+2 O 5 6- Draw three structural isomers of heptane C7H16.
This question involves a lab question within inorganic chemistry: Compare and constrast the reactivities of nickle (II) and copper (II) complexes.
Give an efficient algorithm to compute the union of sets A and B, where n = max(|A|, |B|). The output should be an array of distinct elements that form the union of the sets, such that they appear exactly once in the union. Assume that A and B are unsorted. Give an O(n log n) time algorithm for the problem.
Prove by induction that if A and B are finite sets, A with n elements and B with m elements, then A x B has nm elements. Also, prove by induction the corresponding results for k sets.
Place the following sets of elements in order of increasing size and give the rationale for the answer. [Al, P, Na, Ar], [I, Cl, F, Br] (these are 2 different sets.)
1. Give an example of two sets A and B such that A ¢ B, B ¢ A, but A n Bメ0.
2. Prove that a finite union of compact sets is compact. Give an example of a countable union of compact sets which is not compact. Book Problems: Chapter 2, Problems 12, 13, 16, 17, 19, 22
Give an example to show that a union of countable sets need not
be countable. (Obviously your example must involve infinitely many
sets.)
4. Give an example to show that a union of countable sets need not be countable. (Obvi- ously your example must involve infinitely many sets.)
How many elements are there in the sets { -2, -1, ... , 11}, and { 0, 1, 2 } × { a, b, c, d}? If X has m elements and Y has n elements, how many elements are there in X × Y? Suppose Xi has mi elements, for i = 1, 2, ..., N. How many elements are there in X1 × X2 × ... × XN ? If X has m elements, how many elements are...
Suppose you have two data sets, each of which contain n comparable elements. As an basic operation, you may ask one set to tell you the kth largest element of that set, for a value k you choose. Give an algorithm that, with O(log n) queries, determines the median value of the union of the two sets.