All categories

2 years ago

Instructions:Type the correct answer in the box. Spell all words correctly.

2 answers:

6 0

<span>
Anna always has a hard time finding files on her computer because she does not know where she saved them. This also affects her productivity at work. Anna is lacking good Organization skills.</span>

kotegsom [21]2 years ago

5 0

Anna’s problems, which stems for her lack of file management skills, causes her to have difficulties in finding the previous files that she has saved. This would definitely lead to a lack of efficiency in her working efforts, since she would have problems trying to locate her previously created files. A way for her to manage this problem would be by creating a naming format and folder management that she can easily access.

You might be interested in

What permanent magnets of a motor are replaced with more powerful ones, what effect do you think this would have on motor rotati

Marat540 [252]

When permanent magnets of a motor are replaced with more powerful ones, the motor rotation will increase. This is because there is more electricity being generated.

7 0

2 years ago

Read 2 more answers

Write a fragment of code that reads in strings from standard input, until end-of-file and prints to standard output the largest

Nady [450]

Answer:

Explanation:

Sample input file: numbers.txt

8 9 7 67 78 45 67 99 1001

Sample Output:

The largest value is:1001

Code to Copy:

// include stdafx, if using visual studio.

#include "stdafx.h"

// declare the necessary header files.

#include <iostream>

#include <string>

#include <fstream>

using namespace std;

// Start the main function

int main()

{

// create the object of ifstream.

ifstream in_file;

// Open the file

in_file.open("numbers.txt");

// Declare the string variable

string str;

// Declare the integer variables.

int maximum = 0;

int num;

// Check whether the file open

if (in_file.is_open())

{

// Traverse the file till the end.

while (!in_file.eof())

{

// traversing the value.

in_file >> str;

// convert the string into integer.

num = stoi(str);

// Check whether value is max or not.

if (maximum < num)

{

// Update the value of maximum.

maximum = num;

}

// Display the statement on console.

cout << "The largest value is:" << maximum << endl;

// Close the file.

in_file.close();

system("pause");

return 0;

}

8 0

2 years ago

Explain how abstraction is used in a GPS system

Pavlova-9 [17]

Answer

Abstraction enables GPS system to facilitate the utilization of well defined interfaces while offering room to add additional levels of functionality which are complex to handle.

Explanation

GPS system applies abstraction to be able to arrange level of complexity on which a user will interact with the system. For example, it establishes a link of satellite positioned and timed systems to allow a radio receiver obtain a signal in four dimension after synchronizing the data of latitude, longitude, attitude and time.

7 0

2 years ago

Read 2 more answers

George has to present the goals of information management to his team member. What is a goal of information management? The goal

Law Incorporation [45]

Answer:

The purpose of information management is to: design, develop, manage, and use information with insight and innovation. support decision making and create value for individuals, organizations, communities, and societies.

Explanation:

5 0

2 years ago

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