The purpose of the lysis procedure is:
to sequence the 16S rRNA gene
to separate the pieces of nucleic acid from one another
to break open the bacterial cells to release the genetic material
to amplify the 16S rRNA gene
Match the components of HotShot buffer with their role.
NaOH
removes anions so they cannot be used as cofactors by enzymes, increases pH to denature nucleases, disrupts lipid membranes, removes cations so they cannot be used as cofactors by enzymes, or decreases pH to denature nucleases
Detergent
removes anions so they cannot be used as cofactors by enzymes, increases pH to denature nucleases, disrupts lipid membranes, removes cations so they cannot be used as cofactors by enzymes, or decreases pH to denature nucleases
Chelator
(removes cations so they cannot be used as cofactors by enzymes)
When taking some of your bacterial isolate to place in the HotShot buffer you should take as much as can fit on the end of the pipette tip.
True OR False
The role of neutralization buffer is to:
restore the pH to approximately neutral
increase the pH to 10
introduce nucleases into the reaction
decrease the pH to 3
Nuclease-free water is added to the reaction mix to _____________________. Choose all that apply.
increase the volume of the solution without introducing nucleases which could degrade the nucleic acids
dilute the lysate so it is not too concentrated for later procedures
to stop the chemical reactions occuring in the solution
add nucleases to the reaction mix
In: Biology
C# assignment 5: Shipping Charges
A large Internet merchandise provider determines its shipping
charges based on the number of items purchased. As the number
increases, the shipping charges proportionally decrease. This is
done to encour- age more purchases. If a single item is purchased,
the shipping charge is $2.99. When customers purchase between 2 and
5 items, they are charged the initial $2.99 for the first item and
then $1.99 per item for the remaining items. For customers who
purchase more than 5 items but less than 15, they are charged the
initial $2.99 for the first item, $1.99 per item for items 2
through 5, and $1.49 per item for the remaining items. If they
purchase 15 or more items, they are charged the initial $2.99 for
the first item, $1.99 per item for items 2 through 5, and $1.49 per
item for items 6 through 14, and then just $0.99 per item for the
remaining items. Allow the user to enter the number of items
purchased. Define appropriate constants, use the decimal data type,
and display the ship- ping formatted charges.
In: Computer Science
Question 1:
Eight measurements were made on the inside diameter of forged piston rings used in an automobile engine. The data (in millimeters) are 74.001, 74.003, 74.015, 74.000, 74.005, 74.002, 74.005, and 74.004.
Question 2:
The April 22, 1991 issue of Aviation Week and Space Technology reports that during Operation Desert Storm, U.S. Airforce F-117A pilots flew 1270 combat sorties for a total of 6905 hours. What is the mean duration of an F-117A mission during this operation? Why is the parameter you have calculated a population mean?
In: Math
Most graduate schools of business require applicants for admission to take the Graduate Management Admission Council’s GMAT examination. Scores on the GMAT are roughly normally distributed with a mean of 540 and a standard deviation of 125.
a) What is the probability of an individual scoring above 515 on the GMA T?
b) What is the probability of an individual scoring below 460 on the GMA T?
c) If a sample of 36 individual are selected, find the probability that their average is between 470 and 580 on the GMAT?
d) How high must an individual score on the GMAT in order to score in the highest 10%?
In: Statistics and Probability
23) Possible outcomes for three investment alternatives and
their probabilities of occurrence are given
next.
| Alternative 1 | Alternative 2 | Alternative 3 | ||||||||||||||||||
| Outcomes | Probability | Outcomes | Probability | Outcomes | Probability | |||||||||||||||
| Failure | 80 | 0.40 | 90 | 0.20 | 100 | 0.30 | ||||||||||||||
| Acceptable | 80 | 0.20 | 185 | 0.20 | 220 | 0.50 | ||||||||||||||
| Successful | 155 | 0.40 | 220 | 0.60 | 375 | 0.20 | ||||||||||||||
Using the coefficient of variation, rank the three alternatives in
terms of risk from lowest to highest. (Do not round
intermediate calculations. Round your answers to 3 decimal
places.)
In: Finance
The large scale structure of the universe has been carefully mapped using redshift surveys of a very large number of galaxies. A. Suppose that a large telescope with modern equipment can measure the redshift to a galaxy in just 10 minutes. And suppose we want to spend no more than a year map- ping the distribution of galaxies. How many redshifts can be surveyed? B. There are about 100 billion galaxies in the visible universe. What fraction of the uni- verse has been mapped in a year? C. One way to measure more redshifts is to use different telescopes at different times of the year. Which is a better strategy? Be sure to explain why. A. Use a telescope in Arizona in July, and one in Chile in December. B. Use a telescope in Arizona in December, and on in Chile in July.
In: Physics
We mentioned that IP packets are forwarded hop-by-hop. How do
you know how many
hops are there if you ping 8.8.8.8? What does the traceroute
command do? How does this
command work? Can you explain how it works using the output of the
traceroute command
generated on your machine?
In: Computer Science
In this game, two players sit in front of a pile of 100 stones. They take turns, each
removing between 1 and 5 stones (assuming there are at least 5 stones left in the pile).
The person who removes the last stone(s) wins.
Write a program to play this game. This may seem tricky, so break it down into parts.
Like many programs, we have to use nested loops (one loop inside another).
In the outermost loop, we want to keep playing until we are out of stones.
Inside that, we want to keep alternating players. You have the option of either writing
two blocks of code, or keeping a variable that tracks the current player. The second way
is slightly trickier since we haven't learned lists yet, but it's definitely do-able!
Finally, we might want to have an innermost loop that checks if the user's input is valid.
Is it a number? Is it a valid number (e.g. between 1 and 5)? Are there enough stones in
the pile to take off this many? If any of these answers are no, we should tell the user
and re-ask them the question.
So, the basic outline of the program should be something like this:
TOTAL = 100
MAX = 5
pile = TOTAL // all stones are in the pile to start
while (pile>=0){
while (palyer1_turn){
[ask player 1]
[check player 1's input... is it valid?]
[same as above for player 2]
Note how the important numbers 100 and 5 are stored in a single variable at the top.
This is good practice -- it allows you to easily change the constants of a program. For
example, for testing, you may want to start with only 15 or 20 stones.
Be careful with the validity checks. Specifically, we want to keep asking player 1 for their
choice as long as their answer is not valid, BUT we want to make sure we ask them at
least ONCE. So, for example, we will want to keep a variable that tracks whether their
answer is valid, and set it to false initially.
In: Computer Science
Term structure of interest rates The following yield data for a number of highest-quality corporate bonds existed at each of the three points in time noted in the following table:
| Time to maturity (years) | 5 years ago | 2 years ago | Today |
| 1 | 7.8 | 14.6 | 7.9 |
| 3 | 8.1 | 12.8 | 8.4 |
| 5 | 7.8 | 12.2 | 9.5 |
| 10 | 8.1 | 10.9 | 11.2 |
| 15 | 7.9 | 10.7 | 11.3 |
| 20 | 7.9 | 10.5 | 11.5 |
| 30 | 8.1 | 10.5 | 12.1 |
a. On the same set of axes, draw the yield curve at each of the three given times. Select the graph that correctly represents the yield curves associated with the data in the table.
b. Label each curve in part a with its general shape (downward-sloping, upward-sloping, flat).
c. Describe the general interest rate expectation existing at each of the three times.
d. Examine the data from 5 years ago. According to the expectations theory, what approximate return did investors expect a 5-year bond to pay as of today?
In: Finance
write a java program to evaluate the highest number input by user, cannot use math class, must use overloading . Must compute four computeHighNum methods. Here is what I have.
import java.util.Scanner;
public class Overload {
public static void main(String[] args){
Scanner input = new Scanner(System.in);
int number1 = input.nextInt();
int number2 = input.nextInt();
int number3 = input.nextInt();
//int maximum = maximum(number1, number2 );
System.out.printf("Highest integer is ");
// int number1 = input.nextInt();
// int number2 = input.nextInt();
// int number3= input.nextInt();
// int maximum = maximum(int number1, int number2, int
number3);
// System.out.print("Highest number is %d%n",max());
//double number6 = input.nextDouble();
//double number7 = input.nextDouble();
//double number8 = input.nextDouble();
//double int = maximum( number1, number2, number3);
//System.out.println("The highest number is "+ maximum);
}
public static int computeHighNum(int x, int y, int z){
System.out.print("Enter 3 intergers, seperated by a space, on a
single line: ");
int maximumValue = x;
if(y > maximumValue){
maximumValue = y;
}
if(z > maximumValue){
maximumValue = z;
}
return maximumValue;
}
public static int computeHighNum(int x, int y){
System.out.printf("Enter 2 integers, seperated by a space, on a
single line: \n");
int maximumValue = x;
if (y > maximumValue){
maximumValue = y;
}
return maximumValue;
}
public static double computeHighNum(double x, double y, double
z){
System.out.println("Enter 3 doubles, separated by a space, on a
single line: \n");
double maximumValue = x;
if(y > maximumValue){
maximumValue = y;
}
if(z > maximumValue){
maximumValue = z;
}
return maximumValue;
}
public static double computeHighNum(double x, double y){
System.out.print("Enter 2 doubles, separated by a space, on a
single line: \n");
double maximumValue = x;
if (y > maximumValue){
maximumValue = y;
}
return maximumValue;
}
}
In: Computer Science