All categories

3 years ago

What is the fundamental problem producers and consumers face?

1 answer:

5 0

<span>The fundamental problem producers and consumers face is scarcity. The term scarcity denotes the economic problem that societies do not have enough productive resources to produce everything people want. Consumers have different needs, but the producers do not have enough productive resources ...</span><span>
</span>

You might be interested in

The mathematical constant Pi is an irrational number with value approximately 3.1415928... The precise value of this constant ca

tatiyna

Answer:

I am writing a Python program:

def approxPIsquared(error):

previous = 8

new_sum =0

num = 3

while (True):

new_sum = (previous + (8 / (num ** 2)))

if (new_sum - previous <= error):

return new_sum

previous = new_sum

num+=2

print(approxPIsquared(0.0001))

Explanation:

I will explain the above function line by line.

def approxPIsquared(error):

This is the function definition of approxPlsSquared() method that takes error as its parameter and approximates constant Pi to within error.

previous = 8 new_sum =0 num = 3

These are variables. According to this formula:

Pi^2 = 8+8/3^2+8/5^2+8/7^2+8/9^2+...

Value of previous is set to 8 as the first value in the above formula is 8. previous holds the value of the previous sum when the sum is taken term by term. Value of new_sum is initialized to 0 because this variable holds the new value of the sum term by term. num is set to 3 to set the number in the denominator. If you see the 2nd term in above formula 8/3^2, here num = 3. At every iteration this value is incremented by 2 to add 2 to the denominator number just as the above formula has 5, 7 and 9 in denominator.

while (True): This while loop keeps repeating itself and calculates the sum of the series term by term, until the difference between the value of new_sum and the previous is less than error. (error value is specified as input).

new_sum = (previous + (8 / (num ** 2))) This statement represents the above given formula. The result of the sum is stored in new_sum at every iteration. Here ** represents num to the power 2 or you can say square of value of num.

if (new_sum - previous <= error): This if condition checks if the difference between the new and previous sum is less than error. If this condition evaluates to true then the value of new_sum is returned. Otherwise continue computing the, sum term by term.

return new_sum returns the value of new_sum when above IF condition evaluates to true

previous = new_sum This statement sets the computed value of new_sum to the previous.

For example if the value of error is 0.0001 and previous= 8 and new_sum contains the sum of a new term i.e. the sum of 8+8/3^2 = 8.88888... Then IF condition checks if the

new_sum-previous <= error

8.888888 - 8 = 0.8888888

This statement does not evaluate to true because 0.8888888... is not less than or equal to 0.0001

So return new_sum statement will not execute.

previous = new_sum statement executes and now value of precious becomes 8.888888...

Next num+=2 statement executes which adds 2 to the value of num. The value of num was 3 and now it becomes 3+2 = 5.

After this while loop execute again computing the sum of next term using new_sum = (previous + (8 / (num ** 2)))

new_sum = 8.888888.. + (8/(5**2)))

This process goes on until the difference between the new_sum and the previous is less than error.

screenshot of the program and its output is attached.

6 0

3 years ago

How can you enter Task Manager in Windows? Select 3 options. press Ctrl + Shift + Tab press Ctrl+Alt+Delete and then click Task

Sophie [7]

Answer:

Please find the 3 options below.

Explanation:

To begin with, Task Manager in windows, is a monitor program that provides information or shows application and processes running on a computer. Task manager also provide insights about the general status of a computer. The three options for entering or accessing task manager in windows are:

1. Press Ctrl+Alt+Delete and then click Task Manager

2. Right-click the taskbar and choose Start Task Manager

3. Right-click the taskbar and choose Manage Tasks

5 0

3 years ago

Assume we are using the simple model for floating-point representation as given in this book (the representation uses a 14-bit f

Artemon [7]

Answer:

The representation of 100.0 in the floating-point representation is computed as follows: First convert the given number 100.0 in the binary form. 10010 = 11001002 the binary representation.

Explanation:

3 0

3 years ago

Directions: On the line before each item, write ”I” if the substance is an electric insulator or “C” if the substance is an elec

Studentka2010 [4]

Answer:

___I__22. paper

___I__23. glass

___C__24. iron

___I__25. plastic

___C__26. gold

__C___27. copper

___I__28. wood

___I__29. Rubber

___C__30. Aluminum

Materials which do not allow current to flow easily are called insulators.

Materials which allows current to flow easily are called Conductors.

8 0

4 years ago

Is recursion ever required to solve a problem? What other approach can you use to solve a problem that is repetitive in nature?

Setler79 [48]

Answer:

No you can not tell that recursion is ever required to solve a problem.

Recursion is required when in the problem, the solution of the input depends on the solution of the subsets of the input.

Iteration is also another form of repetitive approach we follow to solve that kind of problems.

But the difference between recursion and iteration is :

In recursion we call the function repeatedly to return the result to next level.
In iteration certain bunch of instructions in a loop are executed until certain conditions met.

Explanation:

For example in the Fibonacci sequence problem, to find $f_{n}$ , we need to compute $f_{n-1}$ and $f_{n-2}$ before that.

In case of recursion we just call the method Fibonacci(n) repeatedly only changing the parameter Fibonacci(n-1), that calculates the value and return it.

Fibonacci(n)

1. if(n==0 or n==1)

2. return 1.

3.else

4. return( Fibonacci(n-1)+Fibonacci(n-1) )

But in case of iteration we run a loop for i=2 to n, within which we add the value of current $f_{i-1}$ and $f_{i-2}$ to find the value of $f_{i}$

Fibonacci(n)

1. if(n<=2)

2. result = 1

3. else

4. result1 =1 and result2=1.

5. { result = result1 +result2.

6. result1= result2.

7. result2 = result.

8. }

9. output result.

8 0

3 years ago