All categories

2 years ago

Identify two real-world examples of problems whose solutions do scale well

Computers and Technology

1 answer:

stellarik [79]2 years ago

3 0

Explanation:

We should see scaling well as referring to problems that can well be solved using computation. Two real-world examples are:

problems involving finding the largest or smallest of several lists of numbers: Usually, a simple program executed to lookup the data set to determine which number fits the properties needed.

problems involving equations: By computing the variables (x, y, etc) that make up the equation, and the operations (eg, addition, division) to be performed on the variables the problem can be solved well.

You might be interested in

Why linked list is better than an array?

katrin [286]

In conclusion there are many different data structures. Each data structure has strengths and weaknesses which affect performance depending on the task. Today, we explored two data structures: arrays and linked lists. Arrays allow random access and require less memory per element (do not need space for pointers) while lacking efficiency for insertion/deletion operations and memory allocation. On the contrary, linked lists are dynamic and have faster insertion/deletion time complexities. However, linked list have a slower search time and pointers require additional memory per element in the list. Figure 10 below summarizes the strength and weakness of arrays and linked lists.

8 0

2 years ago

What are sums of money that are given out for specific reasons?

xenn [34]

Answer:

Explanation:

6 0

3 years ago

Read 2 more answers

Out of a list of the values 2, 45, 18, 22, 8, and 37, what result would the MAX function return?

Vika [28.1K]

37 most likely.
No programming language is specified, and you didn't put what the function is, so assuming it's already implemented, MAX should display the highest number.

8 0

3 years ago

Read 2 more answers

2.3.2 Internet Safety

REY [17]

Answer:

False

Explanation:

There are also hackers online

5 0

2 years ago

If the contents of encrypted file1.nc and encrypted file3.nc are different, but the original file1 and file3 are the same, and y

Over [174]

Answer:

The Difference is because of the salt added to the password before hashing or encrypting it.

Explanation:

The Difference is because of the salt added to the password before hashing or encrypting it.

Salts are random data used to mention uniqueness. Suppose if two users have same password for the same system. By adding Salt to the password makes it unique in the crypto system. Its a added security layer which can safeguard the passwords or hashed data in the keystore or storage.

Salt can be prepended to the password or appended to the password.

Suppose the password is “stuti” then its SHA256 HASH value is “4beb1eb6f438495eede7b14ac0d2b955636a49412cd4eb5714341f5716144954”

So, if we add a salt with random string brainlysalttest then its SHA256 HASH value is “5429e85778f1b9f493da637848f253dedf3edbfbb72782d43eb7337cee45ab0c”

If we append the salt brainlytestsalt to the same password and hash it using SHA256 then its hash value is : “3919b677d80ae0da2b58f70b464f6492670ccffee78cf52972c6983995ed8f52”

So clearly Salting to the password and Hashing the salted password will make the difference and also unique.

3 0

2 years ago