Ask question

Ask question

All categories

3 years ago

7

A carpenter is building a rectangular deck. The deck should have a width, f(x), to length, g(x), ratio of 2 to 3. The area of th

e deck is represented by the function h(x). Complete the table with the missing side lengths and areas of the deck.

1 answer:

saul85 [17]3 years ago

5 0

Answer:

1. 6

2. 6

3. 10

4. 600

Step-by-step explanation:

edg :)

You might be interested in

How do I get this answer <br> 1 7/10 + 3 3/4

Alex

Answer:

Exact Form 109/20

Decimal form 5.45

mixed number form 5 9/20

I hope I'm right

hope this helps

4 0

4 years ago

Read 2 more answers

The table shows the relationship

Airida [17]

The linear relationship which exists between the change in weight and number of days of hibernation in a hedgedog can be modeled using the equation y = - 0.03 + 0

Change in weight per day of hibernation = - 0.03
Change in weight for 115 days = - 3.45 ounces

A linear model can be created using the data in the table given using a regression calculator or excel ;

The linear model obtained in the form y = m + bx is :

y = - 0.03x + 0
y = change in weight
x = number of days of hibernation
Intercept = 0
Slope = -0.03

The slope value of the function gives the change in weight value per number of days of hibernation ; which is -0.03.

Using the regression equation, substitute, the vlaue of x = 115
-0.03(115) + 0 = - 3.45

Therefore, the change in weight after 115 days of hibernation is - 3.45 ounces.

Learn more :brainly.com/question/18405415

8 0

2 years ago

Marquis wrote the linear regression equation y=1.245x - 3.684 to predict the cost, y, of x songs purchased. Marquis spent $40 on

jasenka [17]

What you should do for this casp is to use the given expression and clear the value of x.
We have then:
y = 1.245x - 3.684
Clearing x:
1.245x = (y + 3.684)
x = (y + 3,684) / (1,245)
Substituting the value of y:
x = ((40) +3,684) / (1,245) = 35.09
x = 35
answer:
the best estimate of the number of songs that Marquis purchased is 35

4 0

4 years ago

Read 2 more answers

Find the opposite of -25<br><br> 25<br> -25<br> 1/25<br> -1/25

kolbaska11 [484]

The opposite of -25

to find the opposite of a number, just switch the sign
example : opposite of 3 is -3
opposite of -5 is 5

so the opposite of -25 is 25 <==

4 0

4 years ago

The ternary search algorithm locates an element in a list of increasing integers by successively splitting the list into three s

Zigmanuir [339]

Answer:

Algorithm

The steps involved in this algorithm are:

(The list must be in sorted order)

• Step 1: Divide the search space (initially, the list) in three parts (with two mid-points: mid1 and mid2)

• Step 2: The target element is compared with the edge elements that is elements at location mid1, mid2 and the end of the search space. If element matches, go to step 3 else predict in which section the target element lies. The search space is reduced to 1/3rd. If the element is not in the list, go to step 4 or to step 1.

• Step 3: Element found. Return index and exit.

• Step 4: Element not found. Exit.

Complexity

• Worst case time complexity: O(log N)

• Average case time complexity: O(log N)

• Best case time complexity: O(1)

• Space complexity: O(1)

Algorithm

The steps involved in this algorithm are:

(The list must be in sorted order)

• Step 1: Divide the search space (initially, the list) in three parts (with two mid-points: mid1 and mid2)

• Step 2: The target element is compared with the edge elements that is elements at location mid1, mid2 and the end of the search space. If element matches, go to step 3 else predict in which section the target element lies. The search space is reduced to 1/3rd. If the element is not in the list, go to step 4 or to step 1.

• Step 3: Element found. Return index and exit.

• Step 4: Element not found. Exit.

Complexity

• Worst case time complexity: O(log N)

• Average case time complexity: O(log N)

• Best case time complexity: O(1)

• Space complexity: O(1)

#include <stdio.h>

int ternarySearch(int array[], int left, int right, int x)

{

if (right >= left) {

int intvl = (right - left) / 3;

int leftmid = left + intvl;

int rightmid = leftmid + intvl;

if (array[leftmid] == x)

return leftmid;

if (array[rightmid] == x)

return rightmid;

if (x < array[leftmid]) {

return ternarySearch(array, left, leftmid, x);

}

else if (x > array[leftmid] && x < array[rightmid]) {

return ternarySearch(array, leftmid, rightmid, x);

}

else {

return ternarySearch(array, rightmid, right, x);

}

}

return -1;

}

int main(void)

{

int array[] = {1, 2, 3, 5};

int size = sizeof(array)/ sizeof(array[0]);

int find = 3;

printf("Position of %d is %d\n", find, ternarySearch(array, 0, size-1, find));

return 0;

}

Step-by-step explanation:

6 0

3 years ago