All categories

2 years ago

What is bigger that terbites

Computers and Technology

2 answers:

7nadin3 [17]2 years ago

4 0

Answer:

Units larger than a terabyte include a petabyte, exabyte, zettabyte, yottabyte and brontobyte. A geopbyte is also larger than a terabyte and refers to 10 30 bytes, or 1,000 brontobytes. Additional units of measurement become necessary as the amount of data in the world increases.

Explanation:

TiliK225 [7]2 years ago

4 0

Answer:

I think you mean terabyte so the answer would be a petabyte

Explanation:

There are more thing that are bigger than terabytes and petabytes too, here are a few of them. exabyte, zettabyte, and yottabyte

You might be interested in

Can someone help me plz

xxMikexx [17]

Answer:

ok but on what tho

Explanation:

plz explain yourself

8 0

3 years ago

Read 2 more answers

2. When a business practices offensive behavior, you have many options. The option with the loudest voice is

Andreas93 [3]

—-_-__-____- _—-_- -__-_-____-__

___-_-_ _- —|

4 0

2 years ago

What are the characteristics of: Master file Transaction file Reference file

IRISSAK [1]

<h3>Master File :-</h3>

Master files contain descriptive data, such as name and address, as well as summary information, such as amount due and year-to-date sales.

<h3>Transaction File :-</h3>

Fast performance with a rapid response is critical. Organisations rely heavily on their TPS with failure possibly stopping business.

<h3>Reference File :-</h3>

Information in one drawing can be overlaid on a different drawing, eliminating the need to redraw information.
Proper use of reference files will result in significant time savings and greater coordination of drawings.

Explanation:

<h3>Hope it helps you!</h3>

7 0

1 year ago

Write a function that takes a string like 'one five two' and returns the corresponding integer (in this case, 152). A function j

Lelu [443]

Answer:

see explaination

Explanation:

def words2number(s):

words = s.split()

numbers = ['zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight', 'nine']

result = ""

for word in words:

if word in numbers:

result += str(numbers.index(word))

return result

4 0

3 years ago

Read 2 more answers

a cryptarithm is a mathematical puzzle where the goal is to find the correspondence between letters and digits such that the giv

Leokris [45]

Using the knowledge in computational language in C++ it is possible to write a code that cryptarithm is a mathematical puzzle where the goal is to find the correspondence between letters and digits

<h3>Writting the code:</h3>

#include <bits/stdc++.h>

using namespace std;

// chracter to digit mapping, and the inverse

// (if you want better performance: use array instead of unordered_map)

unordered_map<char, int> c2i;

unordered_map<int, char> i2c;

int ans = 0;

// limit: length of result

int limit = 0;

// digit: index of digit in a word, widx: index of a word in word list, sum: summation of all word[digit]

bool helper(vector<string>& words, string& result, int digit, int widx, int sum) {

if (digit == limit) {

ans += (sum == 0);

return sum == 0;

}

// if summation at digit position complete, validate it with result[digit].

if (widx == words.size()) {

if (c2i.count(result[digit]) == 0 && i2c.count(sum%10) == 0) {

if (sum%10 == 0 && digit+1 == limit) // Avoid leading zero in result

return false;

c2i[result[digit]] = sum % 10;

i2c[sum%10] = result[digit];

bool tmp = helper(words, result, digit+1, 0, sum/10);

c2i.erase(result[digit]);

i2c.erase(sum%10);

ans += tmp;

return tmp;

} else if (c2i.count(result[digit]) && c2i[result[digit]] == sum % 10){

if (digit + 1 == limit && 0 == c2i[result[digit]]) {

return false;

}

return helper(words, result, digit+1, 0, sum/10);

} else {

return false;

}

// if word[widx] length less than digit, ignore and go to next word

if (digit >= words[widx].length()) {

return helper(words, result, digit, widx+1, sum);

}

// if word[widx][digit] already mapped to a value

if (c2i.count(words[widx][digit])) {

if (digit+1 == words[widx].length() && words[widx].length() > 1 && c2i[words[widx][digit]] == 0)

return false;

return helper(words, result, digit, widx+1, sum+c2i[words[widx][digit]]);

}

// if word[widx][digit] not mapped to a value yet

for (int i = 0; i < 10; i++) {

if (digit+1 == words[widx].length() && i == 0 && words[widx].length() > 1) continue;

if (i2c.count(i)) continue;

c2i[words[widx][digit]] = i;

i2c[i] = words[widx][digit];

bool tmp = helper(words, result, digit, widx+1, sum+i);

c2i.erase(words[widx][digit]);

i2c.erase(i);

}

return false;

}

void isSolvable(vector<string>& words, string result) {

limit = result.length();

for (auto &w: words)

if (w.length() > limit)

return;

for (auto&w:words)

reverse(w.begin(), w.end());

reverse(result.begin(), result.end());

int aa = helper(words, result, 0, 0, 0);

}

int main()

{

ans = 0;

vector<string> words={"GREEN" , "BLUE"} ;

string result = "BLACK";

isSolvable(words, result);

cout << ans << "\n";

return 0;

}

See more about C++ code at brainly.com/question/19705654

#SPJ1

3 0

2 years ago