A population has the following data:

Genotype Number

AA 65

Aa 5

aa 25

A) Calculate the allelic frequency for the A allele.

B) Calculate the allelic frequency for the a allele.

C) Calculate the expected Hardy-Weinberg genotypic frequency for AA.

D) Calculate the expected Hardy-Weinberg genotypic frequency for Aa.

E) Calculate the expected Hardy-Weinberg genotypic frequency for aa.

F)Convert the expected frequency of AA into total number of people with AA.

G)Convert the expected frequency of Aa into total number of people with Aa.

H)Convert the frequency the expected frequency of aa into total number of people with aa.

I) Do a Chi-square test to determine if the population is at Hardy-Weinberg equilibrium. What is your hypothesis?

J)Do a Chi-square test to determine if the population is at Hardy-Weinberg equilibrium. What is your X² value?

K) Degree of Freedom Value?

L) What is the probability?

M) What is your conclusion?

1. Suppose X is normal with ?=10 and ?=5. Find x0 such that P(X?x0)=0.0643 10.8 15 10.32 17.6 2.4

2. A survey was conducted to measure the number of hours per week adults in the United States spend on home computers. In the survey, the number of hours was normally distributed, with a mean of 7 hours and a standard deviation of 1 hour. A survey participant is randomly selected. Which of the following statements is true?

5. Weights of newborn babies in a certain state have normal distribution with mean 5.33 lb and standard deviation 0.65 lb. A newborn weighing less than 4.85 lb is considered to be at-risk, that is, has a higher mortality rate.

(a) A baby just born in this state is picked at random. The probability that the baby is at-risk is about                            [ Select ]                       ["0.23", "0.53", "0.43", "0.33", "0.13"]      

(b) The hospital wants to take pictures of the heaviest 10% of the newborn babies. The minimum weight (in lbs) required for a picture to be taken is about                           [ Select ]                       ["6.16", "7.27", "8.12", "5.89", "9.12"]      

A Chief Security Officer (CSO) has been unsuccessful in attempts to access the website for a potential partner (www.example.net).

Which of the following rules is preventing the CSO from accessing the site? Blocked sites: *.nonews.com, *.rumorhasit.net, *.mars?

1. Rule 1: deny from inside to outside source any destination any service smtp
2. Rule 2: deny from inside to outside source any destination any service ping
3. Rule 3: deny from inside to outside source any destination {blocked sites} service http-https
4. Rule 4: deny from any to any source any destination any service any

______________________________________________________________________________________________________________________________

A security administrator is tasked with implementing centralized management of all network devices. Network administrators will be required to logon to network devices using their LDAP credentials. All command executed by network administrators on network devices must fall within a preset list of authorized commands and must be logged to a central facility.

Which of the following configuration commands should be implemented to enforce this requirement?

1. LDAP server 10.55.199.3
2. CN=company, CN=com, OU=netadmin, DC=192.32.10.233
3. SYSLOG SERVER 172.16.23.50
4. TACAS server 192.168.1.100

For this assignment, I need to write a c program named stick which plays a matchstick-picking game. Given an initial number of sticks, players take turns picking either 1, 2, 3 or 4 sticks from a pile. Whoever picks the last stick wins.

Usage

The user can run stick with or without command line arguments. i.e. somebody can enter the number of sticks to begin play when the program is launched or they can be prompted after the program begins running. Print out the initial pile of sticks as a set of pipes (|) side by side, followed by the number of sticks in parenthesis. Then, the game should greet the user, and then ask how many sticks to play with (must be an integer >= 10). The user always goes first.

On the user's turn, ask the user how many sticks to remove, and remove those from the pile. On the computer's turn, calculate the correct number of sticks to remove in order to ensure that the computer will (hopefully) win the game.

Play continues until there are no sticks left, at which point your program announces who won.You must show the set of sticks after each player's move. Show this as a set of pipes (|) side by side, followed by the number of sticks in (parenthesis), for example: ||||||| (7)

Illegal Moves

When the user is asked how many sticks to take, they must enter 1, 2, 3 or 4. If their entry is illegal (anything other than 1 2 3 or 4), remind them of their options, and ask once more. If they enter another illegal number, announce that they have forfeited the game, and exit the program. If the user entered a valid number the second try, gameplay continues (in this case, if later the user again enters an illegal number, you should again given them a second chance).

•the user may be badly behaved: they might enter anything at anytime, so your program must be prepared to handle any input (including non integers, etc.)

Algorithm

Your algorithm for picking sticks is simple: given n remaining sticks, pick (n mod 5) sticks, unless (n mod 5)=0; in that case, pick 1 stick.

IMPORTANT

Note that you must use fgets and sscanf to test this input. Do not simply compare the character to '1' '2 and '3' or use "atoi" The user might enter " 3" or "001" If sscanf accepts these as integers, then your program must also.

For this assignment, you are allowed to ignore extraneous input in the number of sticks to take. For example, if the user says "3 hahahayou" can take their input as “take 3 sticks” and ignore the “hahaha.” In class we’ll go over how to process input in a aay that handles all of these cases.

For this assignment, I need to write a c program named stick which plays a matchstick-picking game. Given an initial number of sticks, players take turns picking either 1, 2, 3 or 4 sticks from a pile. Whoever picks the last stick wins.

Usage

You run stick with or without command line arguments. i.e. somebody can enter the number of sticks to begin play when the program is launched or they can be prompted after the program begins running. Print out the initial pile of sticks as a set of pipes (|) side by side, followed by the number of sticks in parenthesis. Then, the game should greet the user, and then ask how many sticks to play with (must be an integer >= 10). The user always goes first.

On the user's turn, ask the user how many sticks to remove, and remove those from the pile. On the computer's turn, calculate the correct number of sticks to remove in order to ensure that the computer will (hopefully) win the game.

Play continues until there are no sticks left, at which point your program announces who won.You must show the set of sticks after each player's move. Show this as a set of pipes (|) side by side, followed by the number of sticks in (parenthesis), for example: ||||||| (7)

Illegal Moves

When the user is asked how many sticks to take, they must enter 1, 2, 3 or 4. If their entry is illegal (anything other than 1 2 3 or 4), remind them of their options, and ask once more. If they enter another illegal number, announce that they have forfeited the game, and exit the program. If the user entered a valid number the second try, gameplay continues (in this case, if later the user again enters an illegal number, you should again given them a second chance).

•the user may be badly behaved: they might enter anything at anytime, so your program must be prepared to handle any input (including non integers, etc.)

Algorithm

Your algorithm for picking sticks is simple: given n remaining sticks, pick (n mod 5) sticks, unless (n mod 5)=0; in that case, pick 1 stick.

IMPORTANT

Note that you must use fgets and sscanf to test this input. Do not simply compare the character to '1' '2 and '3' or use "atoi" The user might enter " 3" or "001" If sscanf accepts these as integers, then your program must also.

For this assignment, you are allowed to ignore extraneous input in the number of sticks to take. For example, if the user says "3 hahahayou" can take their input as “take 3 sticks” and ignore the “hahaha.” In class we’ll go over how to process input in a aay that handles all of these cases.

For this assignment, I need to write a c program named stick which plays a matchstick-picking game. Given an initial number of sticks, players take turns picking either 1, 2, 3 or 4 sticks from a pile. Whoever picks the last stick wins.

Usage

You run stick with or without command line arguments. i.e. somebody can enter the number of sticks to begin play when the program is launched or they can be prompted after the program begins running. Print out the initial pile of sticks as a set of pipes (|) side by side, followed by the number of sticks in parenthesis. Then, the game should greet the user, and then ask how many sticks to play with (must be an integer >= 10). The user always goes first.

On the user's turn, ask the user how many sticks to remove, and remove those from the pile. On the computer's turn, calculate the correct number of sticks to remove in order to ensure that the computer will (hopefully) win the game.

Play continues until there are no sticks left, at which point your program announces who won.You must show the set of sticks after each player's move. Show this as a set of pipes (|) side by side, followed by the number of sticks in (parenthesis), for example: ||||||| (7)

Illegal Moves

When the user is asked how many sticks to take, they must enter 1, 2, 3 or 4. If their entry is illegal (anything other than 1 2 3 or 4), remind them of their options, and ask once more. If they enter another illegal number, announce that they have forfeited the game, and exit the program. If the user entered a valid number the second try, gameplay continues (in this case, if later the user again enters an illegal number, you should again given them a second chance).

•the user may be badly behaved: they might enter anything at anytime, so your program must be prepared to handle any input (including non integers, etc.)

Algorithm

Your algorithm for picking sticks is simple: given n remaining sticks, pick (n mod 5) sticks, unless (n mod 5)=0; in that case, pick 1 stick.

IMPORTANT

Note that you must use fgets and sscanf to test this input. Do not simply compare the character to '1' '2 and '3' or use "atoi" The user might enter " 3" or "001" If sscanf accepts these as integers, then your program must also.

For this assignment, you are allowed to ignore extraneous input in the number of sticks to take. For example, if the user says "3 hahahayou" can take their input as “take 3 sticks” and ignore the “hahaha.” In class we’ll go over how to process input in a aay that handles all of these cases.

Match the following aqueous solutions with the appropriate letter from the column on the right.
1)

2)

3)

Superhero physics: a) Choose a height between 1.00 miles and 3.00 miles. How fast would a superhero have to throw a ball straight upwards in order for it to rise this high? Give your answer in both m/s and mph. Assume air resistance is negligible, since at these speeds that's as believable as superheroes are. b) Choose a time between 1.00 minutes and 3.00 minutes. How fast would a superhero have to throw a ball straight upwards in order for it to spend this much time in the air (that is, for it to take that much time to return to their hand)? Give your answer in both m/s and mph. Same assumption. c) Without resorting to further calculations, which of these two balls will be in the air longer? Explain your reasoning, explicitly citing evidence. d) Choose one case, (a) or (b), and calculate the time required for the ball to rise halfway to its highest point, and the time to rise from there to the highest point. Check: see next question. e) Why does it take less time to rise halfway to the highest point than to rise the rest of the way?

Consider the following two projects: Cash flows Project A Project B C0 −$ 260 −$ 260 C1 110 138 C2 110 138 C3 110 138 C4 110 a. If the opportunity cost of capital is 10%, which of these two projects would you accept (A, B, or both)? b. Suppose that you can choose only one of these two projects. Which would you choose? The discount rate is still 10%. c. Which one would you choose if the cost of capital is 15%? d. What is the payback period of each project? e. Is the project with the shortest payback period also the one with the highest NPV? f. What are the internal rates of return on the two projects? g. Does the IRR rule in this case give the same answer as NPV? h-1. If the opportunity cost of capital is 10%, what is the profitability index for each project? h-2. Is the project with the highest profitability index also the one with the highest NPV? h-3. Which measure should you use to choose between the projects?

In C++

Write a function called findBestSimScore that takes a genome and a sequence and returns the highest similarity score found in the genome as a double.

Note: the term genome refers to the string that represents the complete set of genes in an organism, and sequence to refer to some substring or sub-sequence in the genome.

• Your function MUST be named findBestSimScore

• Your function should take two parameters in this order:

  • a string parameter for the genome (complete set of genes)

  • a string parameter for the sequence (sub-sequence of the genome)

• Your function should return the highest similarity score as a double.

• Your function should not print anything.

The best similarity scores is [0.0,1.0]

Our sequence is "ACT", which is a string of length 3. That means we need to compare our sequence with all the 3 character long sub-sequences (substrings) in the genome.

Examples: