Decisions regarding whether to invest in a new technology or enter a new market are which types of decisions?

Francis has colorblindness and icthyosis, which causes scaly skin. Both traits are X-linked recessive. The probability that she transmits both traits to her sons is

PKU is a recessive disorder. If a homozygous dominant and a heterozygous parent for the PKU allele have a child, what is the probability their child will have PKU?

A woman who is heterozygous for an allele that results in X-linked, recessive baldness marries a man who is bald. Which of the following would be true of their offspring?

If two parents, one with the genotype  IAIA for blood type A and the other with the genotype IBi for blood type B, have a child, what is the probability that the child will have Blood Type O? (Assume both parents are homozygous dominant for the H locus, i.e. no Bombay effect)

In _________ (country), there have been long-term consequences for a decision that resulted in altering the demographics (e.g. sex-ratio) and also in an aging population that doesn’t have enough workforce to support them. Only until 2015, the rules changed to a two-child policy and just a couple of weeks ago, on May 31, 2021, they are allowing three children. Which country am I referring to?

One form of hemophilia is caused by a sex-linked recessive gene. If a man with no hemophilia marries a woman carrier (heterozygous) for hemophilia, what is the probability that their first daughter will have hemophilia?

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: