All categories

2 years ago

If you want to selectively darken an area of an image you could use the

1 answer:

5 0

Create an adjustment layer and create a hue and saturation layer. You'll see sliders so adjust them to your liking. next select a layer mask and fill it will black. then select which areas you want to darken and use the wand tool. Apply a gradient mask if you want.

You might be interested in

Good participation in music is strictly limited to those who perform well. true or false

sdas [7]

The answer would be false because you don't have to be good at it to participate and try your hardest

8 0

3 years ago

Read 2 more answers

Add (total) all the number in the list (below) using a for loop, but skip over the number at index 3.

user100 [1]

Answer:

The program in Python is as follows:

numbers = [10,20,30,40,50,60,100]

total = 0

for i in range(len(numbers)):

if i != 3:

total+=numbers[i]

print(total)

Explanation:

This initializes the list

numbers = [10,20,30,40,50,60,100]

Set total to 0

total = 0

This iterates through numbers

for i in range(len(numbers)):

This ensures that the index 3, are not added

<em> total+=numbers[i]</em>

Print the calculated sum

print(total)

3 0

2 years ago

In 1839, Talbot released the paper-based process which he called _ to the public.

vlabodo [156]

Answer:

I'm pretty sure it's photogenic drawing.

7 0

2 years ago

What are 2 ways to access the vendor credit screen in quickbooks online?

kiruha [24]

Answer:

First by

Clicking

New Button (+) THEN click Vendor THEN click Credit

Secondly

Click Expenses Center then click New Transaction then finally click Vendor Credit

4 0

2 years ago

Suppose that a computer can run an algorithm on a problem of size 1,024 in time t. We do not know the complexity of the algorith

Setler79 [48]

Answer:

Time Complexity of Problem - O(n)

Explanation:

When n= 1024 time taken is t. on a particular computer.

When computer is 8 times faster in same time t , n can be equal to 8192. It means on increasing processing speed input grows linearly.

When computer is 8 times slow then with same time t , n will be 128 which is (1/8)th time 1024.

It means with increase in processing speed by x factor time taken will decrease by (1/x) factor. Or input size can be increased by x times. This signifies that time taken by program grows linearly with input size n. Therefore time complexity of problem will be O(n).

If we double the speed of original machine then we can solve problems of size 2n in time t.

5 0

3 years ago