Ask question

Ask question

All categories

2 years ago

11

Assign test_stat_72 to the value of the test statistic for the years 1971 to 1973 using the states in death_penalty_murder_rates

. As before, the test statistic is, "the number of increases minus the number of decreases.

Computers and Technology

1 answer:

Alika [10]2 years ago

3 0

Answer:

Find attached below the solution and explanation to the problem.

Explanation:

You might be interested in

Given the macro definition and global declarations shown in the image below, provide answers to the following questions:

galben [10]

Answer:

A. 243

B. True

C. 0

Explanation:

Macro instruction is a line of coding used in computer programming. The line coding results in one or more coding in computer program and sets variable for using other statements. Macros allows to reuse code. Macro has two parts beginning and end. After the execution of statement of quiz4 x, 4 the macro x will contain 243. When the macro is invoked the statement will result in an error. When the macro codes are executed the edx will contain 0. Edx serve as a macro assembler.

4 0

2 years ago

You are consulting for a trucking company that does a large amount ofbusiness shipping packages between New York and Boston. The

likoan [24]

Answer:

Answer explained with detail below

Explanation:

Consider the solution given by the greedy algorithm as a sequence of packages, here represented by indexes: 1, 2, 3, ... n. Each package i has a weight, w_i, and an assigned truck t_i. { t_i } is a non-decreasing sequence (as the k'th truck is sent out before anything is placed on the k+1'th truck). If t_n = m, that means our solution takes m trucks to send out the n packages.

If the greedy solution is non-optimal, then there exists another solution { t'_i }, with the same constraints, s.t. t'_n = m' < t_n = m.

Consider the optimal solution that matches the greedy solution as long as possible, so \for all i < k, t_i = t'_i, and t_k != t'_k.

t_k != t'_k => Either

1) t_k = 1 + t'_k

i.e. the greedy solution switched trucks before the optimal solution.

But the greedy solution only switches trucks when the current truck is full. Since t_i = t'_i i < k, the contents of the current truck after adding the k - 1'th package are identical for the greedy and the optimal solutions.

So, if the greedy solution switched trucks, that means that the truck couldn't fit the k'th package, so the optimal solution must switch trucks as well.

So this situation cannot arise.

2) t'_k = 1 + t_k

i.e. the optimal solution switches trucks before the greedy solution.

Construct the sequence { t"_i } s.t.

t"_i = t_i, i <= k

t"_k = t'_i, i > k

This is the same as the optimal solution, except package k has been moved from truck t'_k to truck (t'_k - 1). Truck t'_k cannot be overpacked, since it has one less packages than it did in the optimal solution, and truck (t'_k - 1)

cannot be overpacked, since it has no more packages than it did in the greedy solution.

So { t"_i } must be a valid solution. If k = n, then we may have decreased the number of trucks required, which is a contradiction of the optimality of { t'_i }. Otherwise, we did not increase the number of trucks, so we created an optimal solution that matches { t_i } longer than { t'_i } does, which is a contradiction of the definition of { t'_i }.

So the greedy solution must be optimal.

6 0

2 years ago

#Write a function called string_finder. string_finder should #take two parameters: a target string and a search string. #The fun

adoni [48]

Answer:

I am writing a Python program:

def string_finder(target,search): #function that takes two parameters i.e. target string and a search string

position=(target.find(search))# returns lowest index of search if it is found in target string

if position==0: # if value of position is 0 means lowers index

return "Beginning" #the search string in the beginning of target string

elif position== len(target) - len(search): #if position is equal to the difference between lengths of the target and search strings

return "End" # returns end

elif position > 0 and position < len(target) -1: #if value of position is greater than 0 and it is less than length of target -1

return "Middle" #returns middle

else: #if none of above conditions is true return not found

return "not found"

#you can add an elif condition instead of else for not found condition as:

#elif position==-1

#returns "not found"

#tests the data for the following cases

print(string_finder("Georgia Tech", "Georgia"))

print(string_finder("Georgia Tech", "gia"))

print(string_finder("Georgia Tech", "Tech"))

print(string_finder("Georgia Tech", "Idaho"))

Explanation:

The program can also be written in by using string methods.

def string_finder(target,search): #method definition that takes target string and string to be searched

if target.startswith(search): #startswith() method scans the target string and checks if the (substring) search is present at the start of target string

return "Beginning" #if above condition it true return Beginning

elif target.endswith(search): #endswith() method scans the target string and checks if the (substring) search is present at the end of target string

return "End" #if above elif condition it true return End

elif target.find(search) != -1: #find method returns -1 if the search string is not in target string so if find method does not return -1 then it means that the search string is within the target string and two above conditions evaluated to false so search string must be in the middle of target string

return "Middle" #if above elif condition it true return End

else: #if none of the above conditions is true then returns Not Found

return "Not Found"

6 0

1 year ago

Each frame is composed of a number of colors recorded in digital format; we call these pixels. What information does the number

Nookie1986 [14]

I'd say the size of the frame.

The size, quantity and color combination of pixels is measured in terms of display resolution. A resolution, however, is the number of pixels in an image and is identified by the width and the height. How you’ve set the resolution for the display screen will determine the specific size of the pixels.

7 0

2 years ago

Write a loop that displays all possible combinations of two letters where the letters are 'a', or 'b', or 'c', or 'd', or 'e'. T

Dafna11 [192]

Answer:

for (char outerChar='a'; outerChar<='e'; outerChar++){

for (char innerChar='a'; innerChar<='e'; innerChar++){

cout << outerChar << innerChar << "\n";

}

}

3 0

1 year ago