What is required to control access to the file system using file and folder permissions on a windows based computer?

AP CSP - Write a program that takes 10 random numbers from 1 to 12 inclusively and averages them together.

Amanda [17]

Answer:

follows are the correct python code to this question:

import random as r#import random package as r

import statistics as s #import statistics package as s

l= r.sample(range(0,12),10)#defining l variable that use random function to store 10 random numbers

avg= s.mean(l)#defining avg variable for calculate average of l

print('List of random number are: ', l)#print list of random numbers

print("The random number Average is: ", avg)#print average value

Output:

List of random number are: [4, 10, 6, 0, 3, 5, 1, 7, 11, 2]

The random number Average is: 4.9

Explanation:

In question 1:

In the given code, two packages are imported, which are "random and statistics", in which "random" is used to generate a random number, and "statistics" is used to calculate the average value.

In the code, the "l" variable is used, which uses a random function and store 10 random numbers, and an "avg" variable is defined that calculates the average value. In the last step, the print method is used that print number and its average value.

In question 2:

The given code is wrong because it only calls the "random" method, which is not defined.

3 0

3 years ago

The number of operations executed by algorithms A and B is 40n2 and 2n3, respectively. Determine n0 such that A is better than B

Tom [10]

Answer:

Given that:

A= 40n^2

B = 2n^3

By given scenario:

40n^2=2n^3

dividing both sides by 2

20n^2=n^3

dividing both sides by n^2 we get

20 = n

Now putting n=20 in algorithms A and B:

A=40n^2

= 40 (20)^2

= 40 * (400)

A= 16000

B= 2n^3

= 2 (20)^3

= 2(8000)

B= 16000

Now as A and B got same on n = 20, then as given:

n0 <20 for n =20

Let us take n0 = 19, it will prove A is better than B.

We can also match the respective graphs of algorithms of A and B to see which one leads and which one lags, before they cross at n= 20.

8 0

3 years ago

Please do this now

Ber [7]

here are some ideas

some things i wished i knew before coming into middle school:

1. be organized

2. dont worry about other peoples opinions

3. DO YOUR HOMEWORK

things you learned so far:

1. a lot of things...

2. take notes

3.people change

advice:

if you stress too much, it gets hard.

its okay to get a bad grade on an assignment every once and a while.

be flexable with the people around you

TAKE DEEP BREATHS

DONT TALK DURING CLASS

going into the next grade:

i would change my dynamics and sleeping habits

so there are some ideas that i hope will help!!!

8 0

3 years ago

. Generate 106 message bits (random binary values (bool/int) ). 2. Generate the corresponding code bits for r = 3, 5. This means

N76 [4]

Answer:

While loops are typically used when you don’t know how many times the loop needs to repeat. The body of the loop will repeat while the condition is true. The logical expression will be evaluated just before the body of the loop is repeated.

Let’s say that we want to find the square root of a number. For some square roots, you’re never going to be exact. Let’s say that we want to find a square root that, when multiplied by itself, is within 0.01 of the square we want. How do we do it? There’s a really old process that we can apply here.

Start by guessing 2.

Compute the guess squared.

Is the guess squared close to the target number? If it’s within 0.01, we’re done. We’ll take the absolute value of the difference, in case we overshoot. (In Python, abs is the absolute value function.)

If it’s not close enough, we divide the target number by our guess, then average that value with our guess.

That’s our new guess. Square it, and go back to Step #3.

Explanation:

7 0

4 years ago

How many bits are necessary for a binary representation (unsigned) of:

pshichka [43]

Answer:

Hi!

The answer to:

a. 6 bits.

b. 9 bits.

c. 26 bits.

Explanation:

a. For the states of the U.S.A, you need 50 or more combinations to represents each element.

If you use 6 bits, the possible combinations are 2⁶ = 64.

b. For days in a year, you need 365 or more combinations to represents each element.

If you use 9 bits, the possible combinations are 2⁹ = 512.

c. For inhabitants of California, you need 36,457,549 or more combinations to represents each element.

If you use 26 bits, the possible combinations are 2²⁶ = 67,108,864. If you use 25 bits instead of 26, then you have 2²⁵ = 33,554,432 combinations. These possible combinations are not enough to represent each inhabitant.

4 0

3 years ago