Which are examples of copyrighted online materials? Check all that apply.

Information is stored on a compact disk in a coded pattern of tiny pits arranged in a track that spirals outward toward the rim

Maksim231197 [3]

Answer:

(i) The rotation speed must stay the same.

(ii) The rotation speed must increase.

(iii) The rotation speed must decrease.

Explanation:

According to Equation

10.10, the angular speed must therefore vary as the laser–lens system moves

radially along the disc. In a typical CD player, the constant speed of the surface at

the point of the laser–lens system is 1.3 m/s.

5 0

2 years ago

Write a second constructor as indicated. Sample output: User1: Minutes: 0, Messages: 0 User2: Minutes: 1000, Messages: 5000

Mashcka [7]

Complete Question:

Write a second constructor as indicated. Sample output:User1: Minutes: 0, Messages: 0User2: Minutes: 1000, Messages: 5000// ===== Code from file PhonePlan.java =====public class PhonePlan { private int freeMinutes; private int freeMessages; public PhonePlan() { freeMinutes = 0; freeMessages = 0; } // FIXME: Create a second constructor with numMinutes and numMessages parameters. /* Your solution goes here */ public void print() { System.out.println("Minutes: " + freeMinutes + ", Messages: " + freeMessages); return; }}

Answer:

The second constructor is given as:

//This defines the constructor, the name has to be the same as the class //name

PhonePlan(int numOfMinutes, int numberOfMessages) {

this.freeMinutes = numOfMinutes;

this.freeMessages = numberOfMessages

}

Explanation:

The second constructor is defined using java programming language.

The given class has two constructors This is called "Constructor Overloading) which implements polymophism
In the second constructor that we created, we pass in two arguments of type integer numOfMinutes and numberOfMessages.
In the constructor's body we assign these values to the initially declared variables freeMinutes and freeMessages

6 0

2 years ago

Sarah works in a coffee house where she is responsible for keying in customer orders. A customer orders snacks and coffee, but l

Maru [420]

Answer:

Stack

Explanation:

Stack is a linear data structure that follows a particular order in the way an operation is done or sequence a job is completed.

It uses either LIFO ( Last In, First Out) which is also known as first come first served sequence or FILO (First In, Last Out) sequence.

There are several real life examples of which we can use the example of replacing the snack items Sarah brought for the customer.

If Sarah used the LIFO method, it means she replaced the snack items first ontop of the already existing snack items that's why there is a mismatch.

5 0

2 years ago

Read 2 more answers

Generating a signature with RSA alone on a long message would be too slow (presumably using cipher block chaining). Suppose we c

boyakko [2]

Answer:

Following are the algorithm to this question:

Explanation:

In the RSA algorithm can be defined as follows:

In this algorithm, we select two separate prime numbers that are the "P and Q", To protection purposes, both p and q combines are supposed to become dynamically chosen but must be similar in scale but 'unique in length' so render it easier to influence. Its value can be found by the main analysis effectively.

Computing N = PQ.

In this, N can be used for key pair, that is public and private together as the unit and the Length was its key length, normally is spoken bits. Measure,

$\lambda (N) = \ lcm( \lambda (P), \lambda (Q)) = \ lcm(P- 1, Q - 1)$ where $\lambda$ is the total function of Carmichaels. It is a privately held value. Selecting the integer E to be relatively prime from $1$ and $gcd(E, \lambda (N) ) = 1;$ that is $E \ \ and \ \ \lambda (N)$ . D was its complex number equivalent to E (modulo $\lambda (N)$ ); that is d was its design multiplicative equivalent of E-1.

It's more evident as a fix for d provided of DE ≡ 1 (modulo $\lambda (N)$ ).E with an automatic warning latitude or little mass of bigging contribute most frequently to 216 + 1 = 65,537 more qualified encrypted data.

In some situations it's was shown that far lower E values (such as 3) are less stable.

E is eligible as a supporter of the public key.

D is retained as the personal supporter of its key.

Its digital signature was its module N and the assistance for the community (or authentication). Its secret key includes that modulus N and coded (or decoding) sponsor D, that must be kept private. P, Q, and $\lambda (N)$ will also be confined as they can be used in measuring D. The Euler totient operates $\varphi (N) = (P-1)(Q - 1)$ however, could even, as mentioned throughout the initial RSA paper, have been used to compute the private exponent D rather than λ(N).

It applies because $\varphi (N)$ , which can always be split into $\lambda (N)$ , and thus any D satisfying DE ≡ 1, it can also satisfy (mod $\lambda (N)$ ). It works because $\varphi (N)$ , will always be divided by $\varphi (N)$ ,. That d issue, in this case, measurement provides a result which is larger than necessary (i.e. D > $\lambda (N)$ ) for time - to - time). Many RSA frameworks assume notation are generated either by methodology, however, some concepts like fips, 186-4, may demand that D< $\lambda (N)$ . if they use a private follower D, rather than by streamlined decoding method mostly based on a china rest theorem. Every sensitive "over-sized" exponential which does not cooperate may always be reduced to a shorter corresponding exponential by modulo $\lambda (N)$ .

As there are common threads (P− 1) and (Q – 1) which are present throughout the $N-1 = PQ-1 = (P -1)(Q - 1)+ (P-1) + (Q- 1))$ , it's also possible, if there are any, for all the common factors $(P -1) \ \ \ and \ \ (Q - 1)$ to become very small, if necessary.

Indication: Its original writers of RSA articles conduct their main age range by choosing E as a modular D-reverse (module $\varphi (N)$ ) multiplying. Because a low value (e.g. 65,537) is beneficial for E to improve the testing purpose, existing RSA implementation, such as PKCS#1, rather use E and compute D.

8 0

2 years ago

Write the execution steps if the input is a lion.

balandron [24]

Explanation:

Execution step:

1. Starting the program

2. It will get the animal name

3. Check whether the animal eats only plants. Then it prints "Herbivore". If the condition is false, it prints "carnivore".

4. Stop the program

To identify input, output and decision:

Start and Stop (oval): These are neither input nor output

Does it eat only plants?: Decision making statement ("d")

Read the names of the animals(Parallelogram): Input ("i")

Print Herbivore, Print Carnivore: Output "o"

Scenario 1: Input is lion

1. Start

2. Reads the input as "lion"

3. Check if lion eats only plants. So here it is false

4. Print "Carnivore"

5. Stop

Scenario 1: Input is Elephant

1. Start

2. Reads the input as "Elephant"

3. Check if lion eats only plants. So here it is true

4. Print "Herbivore"

5. Stop

7 0

2 years ago