All categories

1 year ago

Classify the given items as belonging to the public domain or protected by copyright law.

Computers and Technology

2 answers:

irina1246 [14]1 year ago

6 0

Answer-A book published in 1758 can be classified as belonging to the public domain. According to U.S laws, works or creations published in the U.S before 1924 might be deemed expired.

As a bloggers, when you hit the publish button, any work created is protected by copyright and the material inside is yours.

A music record from the 1960s - protected by copyright law

An infographic made by the federal government - public domain

A photograph taken in 1980 - protected by copyright law

max2010maxim [7]1 year ago

3 0

Anything protected by the copyright law has a legal concept that grants artists or authors control over their creations. On the other hand, anything in the public domain is not protected by intellectual property laws and the public owns these works.

A book published in 1758 can be classified as belonging to the public domain. According to U.S laws, works or creations published in the U.S before 1924 might be deemed expired.

As a bloggers, when you hit the publish button, any work created is protected by copyright and the material inside is yours.

A music record from the 1960s - protected by copyright law

An infographic made by the federal government - public domain

A photograph taken in 1980 - protected by copyright law

You might be interested in

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

2 years ago

how do you make a circuit so 1 switch will turn on/off all the lights(3 lights) and a second switch will change the lights from

expeople1 [14]

Parallel circuit. On a wire you put the lights and one switch, on the other you put a resistor and another switch. (and the third wire contains the generator)

7 0

1 year ago

Read 2 more answers

________ is free software created and updated by a worldwide community of programmers. office software a web service cloud-based

Yanka [14]

I would thing ios or apple cloud personally.

6 0

1 year ago

Select the correct answer. Richard owns a chain of hardware stores. He wants to update the store website and write a numbered li

olga_2 [115]

What’s the answer choices ?

3 0

2 years ago

Use the loop invariant (I) to show that the code below correctly computes the product of all elements in an array A of n integer

NeTakaya

Answer:

Given Loop Variant P = a[0], a[1] ... a[i]

It is product of n terms in array

Explanation:

The Basic Step: i = 0, loop invariant p=a[0], it is true because of 'p' initialized as a[0].

Induction Step: Assume that for i = n - 3, loop invariant p is product of a[0], a[1], a[2] .... a[n - 3].

So, after that multiply a[n - 2] with p, i.e P = a[0], a[1], a[2] .... a[n - 3].a[n - 2].

After execution of while loop, loop variant p becomes: P = a[0], a[1], a[2] .... a[n -3].a[n -2].

for the case i = n-2, invariant p is product of a[0], a[1], a[2] .... a[n-3].a[n-2]. It is the product of (n-1) terms. In while loop, incrementing the value of i, so i=n-1

And multiply a[n-1] with p, i.e P = a[0].a[1].a[2].... a[n-2].

a[n-1]. i.e. P=P.a[n-1]

By the assumption for i=n-3 loop invariant is true, therefore for i=n-2 also it is true.

By induction method proved that for all n > = 1 Code will return product of n array elements.

While loop check the condition i < n - 1. therefore the conditional statement is n - i > 1

If i = n , n - i = 0 , it will violate condition of while loop, so, the while loop will terminate at i = n at this time loop invariant P = a[0].a[1].a[2]....a[n-2].a[n-1]

6 0

2 years ago